./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/toy2.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf 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/toy2.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 0f721563b23ef637d292551ef1a662f821e744b5 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.1-wip.dd.seqcomp-5fbdf5b [2021-08-29 16:47:56,057 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-29 16:47:56,059 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-29 16:47:56,083 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-29 16:47:56,084 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-29 16:47:56,085 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-29 16:47:56,086 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-29 16:47:56,088 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-29 16:47:56,089 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-29 16:47:56,090 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-29 16:47:56,091 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-29 16:47:56,092 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-29 16:47:56,092 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-29 16:47:56,093 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-29 16:47:56,094 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-29 16:47:56,095 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-29 16:47:56,096 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-29 16:47:56,097 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-29 16:47:56,098 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-29 16:47:56,100 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-29 16:47:56,101 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-29 16:47:56,106 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-29 16:47:56,107 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-29 16:47:56,108 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-29 16:47:56,110 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-29 16:47:56,110 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-29 16:47:56,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-29 16:47:56,119 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-29 16:47:56,120 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-29 16:47:56,121 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-29 16:47:56,121 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-29 16:47:56,122 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-29 16:47:56,123 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-29 16:47:56,123 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-29 16:47:56,124 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-29 16:47:56,124 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-29 16:47:56,125 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-29 16:47:56,125 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-29 16:47:56,126 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-29 16:47:56,126 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-29 16:47:56,127 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-29 16:47:56,130 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-29 16:47:56,161 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-29 16:47:56,163 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-29 16:47:56,164 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-29 16:47:56,164 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-29 16:47:56,166 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-29 16:47:56,166 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-29 16:47:56,166 INFO L138 SettingsManager]: * Use SBE=true [2021-08-29 16:47:56,166 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-29 16:47:56,166 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-29 16:47:56,167 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-29 16:47:56,167 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-29 16:47:56,167 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-29 16:47:56,168 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-29 16:47:56,168 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-29 16:47:56,168 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-29 16:47:56,168 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-29 16:47:56,168 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-29 16:47:56,168 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-29 16:47:56,169 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-29 16:47:56,169 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-29 16:47:56,169 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-29 16:47:56,169 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-29 16:47:56,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 16:47:56,170 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-29 16:47:56,170 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-29 16:47:56,170 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-29 16:47:56,170 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-29 16:47:56,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-29 16:47:56,170 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-29 16:47:56,171 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-29 16:47:56,171 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 -> 0f721563b23ef637d292551ef1a662f821e744b5 [2021-08-29 16:47:56,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-29 16:47:56,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-29 16:47:56,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-29 16:47:56,486 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-29 16:47:56,486 INFO L275 PluginConnector]: CDTParser initialized [2021-08-29 16:47:56,488 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy2.cil.c [2021-08-29 16:47:56,562 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfb1a7a50/64f913526dbe47469606b7b011e6cb4b/FLAGf8629e3ad [2021-08-29 16:47:57,070 INFO L306 CDTParser]: Found 1 translation units. [2021-08-29 16:47:57,073 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c [2021-08-29 16:47:57,091 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfb1a7a50/64f913526dbe47469606b7b011e6cb4b/FLAGf8629e3ad [2021-08-29 16:47:57,534 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfb1a7a50/64f913526dbe47469606b7b011e6cb4b [2021-08-29 16:47:57,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-29 16:47:57,539 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-29 16:47:57,541 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-29 16:47:57,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-29 16:47:57,544 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-29 16:47:57,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 04:47:57" (1/1) ... [2021-08-29 16:47:57,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7505ce78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:47:57, skipping insertion in model container [2021-08-29 16:47:57,546 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 04:47:57" (1/1) ... [2021-08-29 16:47:57,552 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-29 16:47:57,583 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-29 16:47:57,669 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c[393,406] [2021-08-29 16:47:57,731 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 16:47:57,738 INFO L203 MainTranslator]: Completed pre-run [2021-08-29 16:47:57,756 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c[393,406] [2021-08-29 16:47:57,808 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 16:47:57,832 INFO L208 MainTranslator]: Completed translation [2021-08-29 16:47:57,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:47:57 WrapperNode [2021-08-29 16:47:57,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-29 16:47:57,835 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-29 16:47:57,836 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-29 16:47:57,836 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-29 16:47:57,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:47:57" (1/1) ... [2021-08-29 16:47:57,861 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:47:57" (1/1) ... [2021-08-29 16:47:57,901 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-29 16:47:57,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-29 16:47:57,904 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-29 16:47:57,904 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-29 16:47:57,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:47:57" (1/1) ... [2021-08-29 16:47:57,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:47:57" (1/1) ... [2021-08-29 16:47:57,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:47:57" (1/1) ... [2021-08-29 16:47:57,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:47:57" (1/1) ... [2021-08-29 16:47:57,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:47:57" (1/1) ... [2021-08-29 16:47:57,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:47:57" (1/1) ... [2021-08-29 16:47:57,949 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:47:57" (1/1) ... [2021-08-29 16:47:57,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-29 16:47:57,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-29 16:47:57,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-29 16:47:57,958 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-29 16:47:57,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:47:57" (1/1) ... [2021-08-29 16:47:57,965 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 16:47:57,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 16:47:57,984 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-29 16:47:58,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-29 16:47:58,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-29 16:47:58,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-29 16:47:58,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-29 16:47:58,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-29 16:47:58,262 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-29 16:47:58,263 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2021-08-29 16:47:58,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 04:47:58 BoogieIcfgContainer [2021-08-29 16:47:58,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-29 16:47:58,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-29 16:47:58,266 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-29 16:47:58,268 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-29 16:47:58,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 04:47:57" (1/3) ... [2021-08-29 16:47:58,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7640011a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 04:47:58, skipping insertion in model container [2021-08-29 16:47:58,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:47:57" (2/3) ... [2021-08-29 16:47:58,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7640011a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 04:47:58, skipping insertion in model container [2021-08-29 16:47:58,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 04:47:58" (3/3) ... [2021-08-29 16:47:58,271 INFO L111 eAbstractionObserver]: Analyzing ICFG toy2.cil.c [2021-08-29 16:47:58,275 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-29 16:47:58,275 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-29 16:47:58,306 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-29 16:47:58,311 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-29 16:47:58,311 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-29 16:47:58,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 123 states have (on average 1.8780487804878048) internal successors, (231), 124 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:58,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-29 16:47:58,332 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:58,333 INFO L513 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] [2021-08-29 16:47:58,333 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:58,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:58,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1633671955, now seen corresponding path program 1 times [2021-08-29 16:47:58,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:58,352 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854147380] [2021-08-29 16:47:58,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:58,354 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:58,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:47:58,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:58,527 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854147380] [2021-08-29 16:47:58,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854147380] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:58,527 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:58,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:47:58,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248628952] [2021-08-29 16:47:58,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:47:58,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:58,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:47:58,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:58,556 INFO L87 Difference]: Start difference. First operand has 125 states, 123 states have (on average 1.8780487804878048) internal successors, (231), 124 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:58,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:58,937 INFO L93 Difference]: Finished difference Result 242 states and 449 transitions. [2021-08-29 16:47:58,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:47:58,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-08-29 16:47:58,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:58,951 INFO L225 Difference]: With dead ends: 242 [2021-08-29 16:47:58,951 INFO L226 Difference]: Without dead ends: 121 [2021-08-29 16:47:58,954 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.07ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:58,958 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 212 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 216.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.62ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 340.28ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:58,960 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 0 Invalid, 218 Unknown, 0 Unchecked, 2.62ms Time], IncrementalHoareTripleChecker [0 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 340.28ms Time] [2021-08-29 16:47:58,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-08-29 16:47:59,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-08-29 16:47:59,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.775) internal successors, (213), 120 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:59,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 213 transitions. [2021-08-29 16:47:59,017 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 213 transitions. Word has length 35 [2021-08-29 16:47:59,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:59,018 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 213 transitions. [2021-08-29 16:47:59,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:59,019 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 213 transitions. [2021-08-29 16:47:59,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-29 16:47:59,022 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:59,022 INFO L513 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] [2021-08-29 16:47:59,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-29 16:47:59,023 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:59,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:59,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1611039701, now seen corresponding path program 1 times [2021-08-29 16:47:59,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:59,026 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574158220] [2021-08-29 16:47:59,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:59,026 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:59,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:47:59,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:59,119 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574158220] [2021-08-29 16:47:59,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574158220] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:59,120 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:59,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 16:47:59,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999927534] [2021-08-29 16:47:59,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 16:47:59,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:59,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 16:47:59,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:47:59,123 INFO L87 Difference]: Start difference. First operand 121 states and 213 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:59,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:59,564 INFO L93 Difference]: Finished difference Result 325 states and 571 transitions. [2021-08-29 16:47:59,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 16:47:59,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-08-29 16:47:59,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:59,572 INFO L225 Difference]: With dead ends: 325 [2021-08-29 16:47:59,572 INFO L226 Difference]: Without dead ends: 207 [2021-08-29 16:47:59,577 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.23ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:47:59,579 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 553 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 286.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.81ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 381.33ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:59,579 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [553 Valid, 0 Invalid, 368 Unknown, 0 Unchecked, 7.81ms Time], IncrementalHoareTripleChecker [5 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 381.33ms Time] [2021-08-29 16:47:59,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-08-29 16:47:59,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2021-08-29 16:47:59,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.7586206896551724) internal successors, (357), 203 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:59,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 357 transitions. [2021-08-29 16:47:59,600 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 357 transitions. Word has length 35 [2021-08-29 16:47:59,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:59,604 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 357 transitions. [2021-08-29 16:47:59,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:59,604 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 357 transitions. [2021-08-29 16:47:59,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-29 16:47:59,609 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:59,610 INFO L513 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] [2021-08-29 16:47:59,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-29 16:47:59,610 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:59,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:59,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1101566611, now seen corresponding path program 1 times [2021-08-29 16:47:59,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:59,613 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379550796] [2021-08-29 16:47:59,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:59,613 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:59,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:47:59,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:59,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379550796] [2021-08-29 16:47:59,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379550796] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:59,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:59,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:47:59,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146330234] [2021-08-29 16:47:59,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:47:59,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:59,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:47:59,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:59,713 INFO L87 Difference]: Start difference. First operand 204 states and 357 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:59,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:59,945 INFO L93 Difference]: Finished difference Result 399 states and 701 transitions. [2021-08-29 16:47:59,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:47:59,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-08-29 16:47:59,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:59,947 INFO L225 Difference]: With dead ends: 399 [2021-08-29 16:47:59,947 INFO L226 Difference]: Without dead ends: 204 [2021-08-29 16:47:59,948 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.96ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:59,949 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 182 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 179.22ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.60ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 217.84ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:59,949 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 0 Invalid, 218 Unknown, 0 Unchecked, 0.60ms Time], IncrementalHoareTripleChecker [8 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 217.84ms Time] [2021-08-29 16:47:59,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-08-29 16:47:59,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2021-08-29 16:47:59,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.6995073891625616) internal successors, (345), 203 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:59,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 345 transitions. [2021-08-29 16:47:59,968 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 345 transitions. Word has length 35 [2021-08-29 16:47:59,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:59,969 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 345 transitions. [2021-08-29 16:47:59,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:59,969 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 345 transitions. [2021-08-29 16:47:59,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-29 16:47:59,972 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:59,972 INFO L513 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] [2021-08-29 16:47:59,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-29 16:47:59,973 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:59,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:59,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1744930967, now seen corresponding path program 1 times [2021-08-29 16:47:59,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:59,974 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279734619] [2021-08-29 16:47:59,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:59,975 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:00,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:48:00,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:48:00,049 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279734619] [2021-08-29 16:48:00,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279734619] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:48:00,049 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:48:00,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 16:48:00,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439389294] [2021-08-29 16:48:00,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 16:48:00,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:48:00,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 16:48:00,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:48:00,052 INFO L87 Difference]: Start difference. First operand 204 states and 345 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:00,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:00,481 INFO L93 Difference]: Finished difference Result 553 states and 938 transitions. [2021-08-29 16:48:00,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 16:48:00,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-08-29 16:48:00,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:00,484 INFO L225 Difference]: With dead ends: 553 [2021-08-29 16:48:00,484 INFO L226 Difference]: Without dead ends: 359 [2021-08-29 16:48:00,485 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.48ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:48:00,495 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 355 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 283.46ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.08ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 380.57ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:00,497 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [355 Valid, 0 Invalid, 502 Unknown, 0 Unchecked, 4.08ms Time], IncrementalHoareTripleChecker [9 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 380.57ms Time] [2021-08-29 16:48:00,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-08-29 16:48:00,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 204. [2021-08-29 16:48:00,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.6847290640394088) internal successors, (342), 203 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:00,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 342 transitions. [2021-08-29 16:48:00,517 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 342 transitions. Word has length 35 [2021-08-29 16:48:00,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:00,517 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 342 transitions. [2021-08-29 16:48:00,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:00,517 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 342 transitions. [2021-08-29 16:48:00,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-29 16:48:00,518 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:00,518 INFO L513 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] [2021-08-29 16:48:00,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-29 16:48:00,518 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:00,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:00,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1806970581, now seen corresponding path program 1 times [2021-08-29 16:48:00,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:00,519 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637635178] [2021-08-29 16:48:00,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:00,520 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:00,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:48:00,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:48:00,567 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637635178] [2021-08-29 16:48:00,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637635178] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:48:00,567 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:48:00,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 16:48:00,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840776760] [2021-08-29 16:48:00,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 16:48:00,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:48:00,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 16:48:00,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:48:00,569 INFO L87 Difference]: Start difference. First operand 204 states and 342 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:00,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:00,931 INFO L93 Difference]: Finished difference Result 556 states and 934 transitions. [2021-08-29 16:48:00,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 16:48:00,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-08-29 16:48:00,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:00,934 INFO L225 Difference]: With dead ends: 556 [2021-08-29 16:48:00,934 INFO L226 Difference]: Without dead ends: 363 [2021-08-29 16:48:00,935 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.96ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:48:00,936 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 354 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 251.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.61ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 329.20ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:00,936 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 0 Invalid, 502 Unknown, 0 Unchecked, 2.61ms Time], IncrementalHoareTripleChecker [7 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 329.20ms Time] [2021-08-29 16:48:00,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-08-29 16:48:00,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 204. [2021-08-29 16:48:00,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.6699507389162562) internal successors, (339), 203 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:00,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 339 transitions. [2021-08-29 16:48:00,953 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 339 transitions. Word has length 35 [2021-08-29 16:48:00,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:00,953 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 339 transitions. [2021-08-29 16:48:00,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:00,954 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 339 transitions. [2021-08-29 16:48:00,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-29 16:48:00,954 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:00,954 INFO L513 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] [2021-08-29 16:48:00,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-29 16:48:00,955 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:00,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:00,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1947519191, now seen corresponding path program 1 times [2021-08-29 16:48:00,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:00,956 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831853992] [2021-08-29 16:48:00,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:00,956 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:00,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:48:00,983 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:48:00,983 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831853992] [2021-08-29 16:48:00,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831853992] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:48:00,983 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:48:00,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 16:48:00,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697385910] [2021-08-29 16:48:00,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 16:48:00,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:48:00,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 16:48:00,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:48:00,985 INFO L87 Difference]: Start difference. First operand 204 states and 339 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:01,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:01,348 INFO L93 Difference]: Finished difference Result 568 states and 945 transitions. [2021-08-29 16:48:01,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 16:48:01,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-08-29 16:48:01,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:01,351 INFO L225 Difference]: With dead ends: 568 [2021-08-29 16:48:01,351 INFO L226 Difference]: Without dead ends: 376 [2021-08-29 16:48:01,351 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.85ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:48:01,352 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 359 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 246.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.04ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 326.03ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:01,352 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [359 Valid, 0 Invalid, 508 Unknown, 0 Unchecked, 2.04ms Time], IncrementalHoareTripleChecker [7 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 326.03ms Time] [2021-08-29 16:48:01,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2021-08-29 16:48:01,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 210. [2021-08-29 16:48:01,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 1.6411483253588517) internal successors, (343), 209 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:01,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 343 transitions. [2021-08-29 16:48:01,376 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 343 transitions. Word has length 35 [2021-08-29 16:48:01,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:01,377 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 343 transitions. [2021-08-29 16:48:01,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:01,378 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 343 transitions. [2021-08-29 16:48:01,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-29 16:48:01,378 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:01,379 INFO L513 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] [2021-08-29 16:48:01,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-29 16:48:01,379 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:01,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:01,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1813505685, now seen corresponding path program 1 times [2021-08-29 16:48:01,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:01,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903554414] [2021-08-29 16:48:01,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:01,381 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:01,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:48:01,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:48:01,428 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903554414] [2021-08-29 16:48:01,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903554414] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:48:01,428 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:48:01,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 16:48:01,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767206372] [2021-08-29 16:48:01,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 16:48:01,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:48:01,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 16:48:01,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:48:01,429 INFO L87 Difference]: Start difference. First operand 210 states and 343 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:01,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:01,848 INFO L93 Difference]: Finished difference Result 713 states and 1165 transitions. [2021-08-29 16:48:01,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 16:48:01,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-08-29 16:48:01,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:01,850 INFO L225 Difference]: With dead ends: 713 [2021-08-29 16:48:01,850 INFO L226 Difference]: Without dead ends: 516 [2021-08-29 16:48:01,851 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.48ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:48:01,851 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 356 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 286.41ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.01ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 381.59ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:01,852 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [356 Valid, 0 Invalid, 602 Unknown, 0 Unchecked, 2.01ms Time], IncrementalHoareTripleChecker [8 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 381.59ms Time] [2021-08-29 16:48:01,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2021-08-29 16:48:01,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 341. [2021-08-29 16:48:01,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.6294117647058823) internal successors, (554), 340 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:01,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 554 transitions. [2021-08-29 16:48:01,878 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 554 transitions. Word has length 35 [2021-08-29 16:48:01,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:01,879 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 554 transitions. [2021-08-29 16:48:01,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:01,879 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 554 transitions. [2021-08-29 16:48:01,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-29 16:48:01,880 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:01,880 INFO L513 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] [2021-08-29 16:48:01,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-29 16:48:01,880 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:01,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:01,881 INFO L82 PathProgramCache]: Analyzing trace with hash 8067351, now seen corresponding path program 1 times [2021-08-29 16:48:01,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:01,881 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918447675] [2021-08-29 16:48:01,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:01,882 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:01,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:48:01,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:48:01,908 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918447675] [2021-08-29 16:48:01,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918447675] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:48:01,908 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:48:01,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:48:01,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065171039] [2021-08-29 16:48:01,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:48:01,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:48:01,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:48:01,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:01,911 INFO L87 Difference]: Start difference. First operand 341 states and 554 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:02,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:02,176 INFO L93 Difference]: Finished difference Result 812 states and 1325 transitions. [2021-08-29 16:48:02,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:48:02,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-08-29 16:48:02,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:02,179 INFO L225 Difference]: With dead ends: 812 [2021-08-29 16:48:02,179 INFO L226 Difference]: Without dead ends: 495 [2021-08-29 16:48:02,180 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.61ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:02,180 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 170 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 189.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.85ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 238.72ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:02,180 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 0 Invalid, 346 Unknown, 0 Unchecked, 0.85ms Time], IncrementalHoareTripleChecker [4 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 238.72ms Time] [2021-08-29 16:48:02,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2021-08-29 16:48:02,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2021-08-29 16:48:02,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 492 states have (on average 1.6260162601626016) internal successors, (800), 492 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:02,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 800 transitions. [2021-08-29 16:48:02,202 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 800 transitions. Word has length 35 [2021-08-29 16:48:02,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:02,202 INFO L470 AbstractCegarLoop]: Abstraction has 493 states and 800 transitions. [2021-08-29 16:48:02,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:02,202 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 800 transitions. [2021-08-29 16:48:02,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-29 16:48:02,203 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:02,203 INFO L513 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] [2021-08-29 16:48:02,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-29 16:48:02,203 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:02,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:02,204 INFO L82 PathProgramCache]: Analyzing trace with hash 2127880731, now seen corresponding path program 1 times [2021-08-29 16:48:02,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:02,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316371237] [2021-08-29 16:48:02,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:02,204 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:02,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:48:02,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:48:02,229 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316371237] [2021-08-29 16:48:02,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316371237] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:48:02,229 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:48:02,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 16:48:02,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162716106] [2021-08-29 16:48:02,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 16:48:02,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:48:02,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 16:48:02,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:48:02,230 INFO L87 Difference]: Start difference. First operand 493 states and 800 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:02,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:02,539 INFO L93 Difference]: Finished difference Result 1255 states and 2037 transitions. [2021-08-29 16:48:02,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 16:48:02,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-08-29 16:48:02,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:02,543 INFO L225 Difference]: With dead ends: 1255 [2021-08-29 16:48:02,543 INFO L226 Difference]: Without dead ends: 779 [2021-08-29 16:48:02,544 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.13ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:48:02,546 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 464 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 202.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.60ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 260.32ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:02,546 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [464 Valid, 0 Invalid, 356 Unknown, 0 Unchecked, 1.60ms Time], IncrementalHoareTripleChecker [10 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 260.32ms Time] [2021-08-29 16:48:02,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2021-08-29 16:48:02,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 493. [2021-08-29 16:48:02,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 492 states have (on average 1.6097560975609757) internal successors, (792), 492 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:02,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 792 transitions. [2021-08-29 16:48:02,571 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 792 transitions. Word has length 35 [2021-08-29 16:48:02,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:02,571 INFO L470 AbstractCegarLoop]: Abstraction has 493 states and 792 transitions. [2021-08-29 16:48:02,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:02,571 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 792 transitions. [2021-08-29 16:48:02,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-29 16:48:02,576 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:02,576 INFO L513 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] [2021-08-29 16:48:02,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-29 16:48:02,577 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:02,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:02,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1106812377, now seen corresponding path program 1 times [2021-08-29 16:48:02,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:02,578 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288894234] [2021-08-29 16:48:02,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:02,578 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:02,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:48:02,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:48:02,613 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288894234] [2021-08-29 16:48:02,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288894234] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:48:02,613 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:48:02,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 16:48:02,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125331391] [2021-08-29 16:48:02,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 16:48:02,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:48:02,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 16:48:02,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:48:02,615 INFO L87 Difference]: Start difference. First operand 493 states and 792 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:02,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:02,945 INFO L93 Difference]: Finished difference Result 1251 states and 2010 transitions. [2021-08-29 16:48:02,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 16:48:02,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-08-29 16:48:02,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:02,949 INFO L225 Difference]: With dead ends: 1251 [2021-08-29 16:48:02,949 INFO L226 Difference]: Without dead ends: 781 [2021-08-29 16:48:02,950 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.33ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:48:02,950 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 446 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 223.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.60ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 284.05ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:02,951 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [446 Valid, 0 Invalid, 354 Unknown, 0 Unchecked, 1.60ms Time], IncrementalHoareTripleChecker [12 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 284.05ms Time] [2021-08-29 16:48:02,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2021-08-29 16:48:02,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 493. [2021-08-29 16:48:02,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 492 states have (on average 1.5934959349593496) internal successors, (784), 492 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:02,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 784 transitions. [2021-08-29 16:48:02,973 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 784 transitions. Word has length 35 [2021-08-29 16:48:02,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:02,974 INFO L470 AbstractCegarLoop]: Abstraction has 493 states and 784 transitions. [2021-08-29 16:48:02,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:02,974 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 784 transitions. [2021-08-29 16:48:02,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-29 16:48:02,975 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:02,975 INFO L513 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] [2021-08-29 16:48:02,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-29 16:48:02,975 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:02,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:02,976 INFO L82 PathProgramCache]: Analyzing trace with hash 95695127, now seen corresponding path program 1 times [2021-08-29 16:48:02,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:02,976 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555226016] [2021-08-29 16:48:02,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:02,976 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:02,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:48:02,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:48:02,999 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555226016] [2021-08-29 16:48:02,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555226016] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:48:02,999 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:48:02,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 16:48:02,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681866403] [2021-08-29 16:48:03,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 16:48:03,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:48:03,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 16:48:03,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:48:03,001 INFO L87 Difference]: Start difference. First operand 493 states and 784 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:03,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:03,330 INFO L93 Difference]: Finished difference Result 1192 states and 1892 transitions. [2021-08-29 16:48:03,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 16:48:03,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-08-29 16:48:03,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:03,333 INFO L225 Difference]: With dead ends: 1192 [2021-08-29 16:48:03,334 INFO L226 Difference]: Without dead ends: 716 [2021-08-29 16:48:03,334 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.59ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:48:03,335 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 459 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 219.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.72ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 284.27ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:03,336 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 0 Invalid, 385 Unknown, 0 Unchecked, 1.72ms Time], IncrementalHoareTripleChecker [15 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 284.27ms Time] [2021-08-29 16:48:03,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2021-08-29 16:48:03,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 541. [2021-08-29 16:48:03,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 540 states have (on average 1.5574074074074074) internal successors, (841), 540 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:03,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 841 transitions. [2021-08-29 16:48:03,360 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 841 transitions. Word has length 35 [2021-08-29 16:48:03,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:03,360 INFO L470 AbstractCegarLoop]: Abstraction has 541 states and 841 transitions. [2021-08-29 16:48:03,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:03,361 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 841 transitions. [2021-08-29 16:48:03,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-29 16:48:03,361 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:03,361 INFO L513 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] [2021-08-29 16:48:03,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-29 16:48:03,361 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:03,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:03,362 INFO L82 PathProgramCache]: Analyzing trace with hash 353860565, now seen corresponding path program 1 times [2021-08-29 16:48:03,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:03,362 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708663860] [2021-08-29 16:48:03,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:03,362 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:03,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:48:03,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:48:03,398 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708663860] [2021-08-29 16:48:03,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708663860] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:48:03,398 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:48:03,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:48:03,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943067166] [2021-08-29 16:48:03,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:48:03,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:48:03,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:48:03,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:03,400 INFO L87 Difference]: Start difference. First operand 541 states and 841 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:03,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:03,671 INFO L93 Difference]: Finished difference Result 1288 states and 2008 transitions. [2021-08-29 16:48:03,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:48:03,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-08-29 16:48:03,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:03,674 INFO L225 Difference]: With dead ends: 1288 [2021-08-29 16:48:03,674 INFO L226 Difference]: Without dead ends: 761 [2021-08-29 16:48:03,675 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.55ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:03,675 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 114 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 182.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.75ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 234.66ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:03,676 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 0 Invalid, 328 Unknown, 0 Unchecked, 0.75ms Time], IncrementalHoareTripleChecker [8 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 234.66ms Time] [2021-08-29 16:48:03,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2021-08-29 16:48:03,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 758. [2021-08-29 16:48:03,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 757 states have (on average 1.5389696169088507) internal successors, (1165), 757 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:03,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1165 transitions. [2021-08-29 16:48:03,706 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1165 transitions. Word has length 35 [2021-08-29 16:48:03,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:03,707 INFO L470 AbstractCegarLoop]: Abstraction has 758 states and 1165 transitions. [2021-08-29 16:48:03,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:03,707 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1165 transitions. [2021-08-29 16:48:03,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-29 16:48:03,707 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:03,708 INFO L513 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] [2021-08-29 16:48:03,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-29 16:48:03,708 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:03,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:03,708 INFO L82 PathProgramCache]: Analyzing trace with hash -209495903, now seen corresponding path program 1 times [2021-08-29 16:48:03,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:03,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324345612] [2021-08-29 16:48:03,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:03,712 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:03,746 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:48:03,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:48:03,747 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324345612] [2021-08-29 16:48:03,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324345612] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:48:03,747 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:48:03,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:48:03,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412377050] [2021-08-29 16:48:03,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:48:03,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:48:03,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:48:03,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:03,749 INFO L87 Difference]: Start difference. First operand 758 states and 1165 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:04,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:04,055 INFO L93 Difference]: Finished difference Result 1864 states and 2903 transitions. [2021-08-29 16:48:04,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:48:04,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-08-29 16:48:04,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:04,059 INFO L225 Difference]: With dead ends: 1864 [2021-08-29 16:48:04,060 INFO L226 Difference]: Without dead ends: 1133 [2021-08-29 16:48:04,061 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.55ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:04,062 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 76 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 199.22ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.91ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 257.05ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:04,062 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 0 Invalid, 409 Unknown, 0 Unchecked, 0.91ms Time], IncrementalHoareTripleChecker [6 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 257.05ms Time] [2021-08-29 16:48:04,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2021-08-29 16:48:04,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1131. [2021-08-29 16:48:04,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 1130 states have (on average 1.5504424778761061) internal successors, (1752), 1130 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:04,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1752 transitions. [2021-08-29 16:48:04,112 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1752 transitions. Word has length 45 [2021-08-29 16:48:04,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:04,112 INFO L470 AbstractCegarLoop]: Abstraction has 1131 states and 1752 transitions. [2021-08-29 16:48:04,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:04,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1752 transitions. [2021-08-29 16:48:04,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-29 16:48:04,113 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:04,113 INFO L513 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] [2021-08-29 16:48:04,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-29 16:48:04,114 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:04,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:04,114 INFO L82 PathProgramCache]: Analyzing trace with hash 214150819, now seen corresponding path program 1 times [2021-08-29 16:48:04,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:04,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208604980] [2021-08-29 16:48:04,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:04,114 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:04,137 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-29 16:48:04,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:48:04,137 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208604980] [2021-08-29 16:48:04,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208604980] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:48:04,138 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:48:04,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:48:04,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997035924] [2021-08-29 16:48:04,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:48:04,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:48:04,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:48:04,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:04,139 INFO L87 Difference]: Start difference. First operand 1131 states and 1752 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:04,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:04,319 INFO L93 Difference]: Finished difference Result 2213 states and 3445 transitions. [2021-08-29 16:48:04,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:48:04,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-08-29 16:48:04,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:04,323 INFO L225 Difference]: With dead ends: 2213 [2021-08-29 16:48:04,324 INFO L226 Difference]: Without dead ends: 1109 [2021-08-29 16:48:04,326 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.40ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:04,327 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 172 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 102.59ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.46ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 132.70ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:04,327 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 0 Invalid, 177 Unknown, 0 Unchecked, 0.46ms Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 132.70ms Time] [2021-08-29 16:48:04,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2021-08-29 16:48:04,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109. [2021-08-29 16:48:04,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 1108 states have (on average 1.5568592057761732) internal successors, (1725), 1108 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:04,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1725 transitions. [2021-08-29 16:48:04,368 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1725 transitions. Word has length 45 [2021-08-29 16:48:04,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:04,368 INFO L470 AbstractCegarLoop]: Abstraction has 1109 states and 1725 transitions. [2021-08-29 16:48:04,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:04,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1725 transitions. [2021-08-29 16:48:04,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-29 16:48:04,369 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:04,370 INFO L513 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] [2021-08-29 16:48:04,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-29 16:48:04,370 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:04,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:04,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1700232685, now seen corresponding path program 1 times [2021-08-29 16:48:04,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:04,371 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977020947] [2021-08-29 16:48:04,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:04,371 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:04,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:48:04,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:48:04,400 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977020947] [2021-08-29 16:48:04,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977020947] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:48:04,400 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:48:04,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:48:04,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278104951] [2021-08-29 16:48:04,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:48:04,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:48:04,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:48:04,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:04,402 INFO L87 Difference]: Start difference. First operand 1109 states and 1725 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:04,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:04,691 INFO L93 Difference]: Finished difference Result 2813 states and 4432 transitions. [2021-08-29 16:48:04,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:48:04,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-08-29 16:48:04,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:04,700 INFO L225 Difference]: With dead ends: 2813 [2021-08-29 16:48:04,700 INFO L226 Difference]: Without dead ends: 1731 [2021-08-29 16:48:04,702 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.44ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:04,703 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 77 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 170.61ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.70ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 218.85ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:04,703 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 0 Invalid, 322 Unknown, 0 Unchecked, 0.70ms Time], IncrementalHoareTripleChecker [7 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 218.85ms Time] [2021-08-29 16:48:04,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2021-08-29 16:48:04,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1729. [2021-08-29 16:48:04,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1729 states, 1728 states have (on average 1.5688657407407407) internal successors, (2711), 1728 states have internal predecessors, (2711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:04,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 2711 transitions. [2021-08-29 16:48:04,784 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 2711 transitions. Word has length 46 [2021-08-29 16:48:04,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:04,785 INFO L470 AbstractCegarLoop]: Abstraction has 1729 states and 2711 transitions. [2021-08-29 16:48:04,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:04,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2711 transitions. [2021-08-29 16:48:04,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-08-29 16:48:04,787 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:04,787 INFO L513 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] [2021-08-29 16:48:04,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-29 16:48:04,787 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:04,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:04,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1601371510, now seen corresponding path program 1 times [2021-08-29 16:48:04,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:04,788 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619942425] [2021-08-29 16:48:04,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:04,788 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:04,820 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:48:04,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:48:04,821 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619942425] [2021-08-29 16:48:04,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619942425] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:48:04,822 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:48:04,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:48:04,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313221651] [2021-08-29 16:48:04,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:48:04,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:48:04,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:48:04,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:04,824 INFO L87 Difference]: Start difference. First operand 1729 states and 2711 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:05,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:05,176 INFO L93 Difference]: Finished difference Result 4644 states and 7373 transitions. [2021-08-29 16:48:05,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:48:05,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-08-29 16:48:05,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:05,185 INFO L225 Difference]: With dead ends: 4644 [2021-08-29 16:48:05,186 INFO L226 Difference]: Without dead ends: 2944 [2021-08-29 16:48:05,188 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.50ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:05,188 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 81 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 177.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.86ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 230.03ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:05,188 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 0 Invalid, 385 Unknown, 0 Unchecked, 0.86ms Time], IncrementalHoareTripleChecker [9 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 230.03ms Time] [2021-08-29 16:48:05,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2021-08-29 16:48:05,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 2942. [2021-08-29 16:48:05,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2942 states, 2941 states have (on average 1.5810948656919415) internal successors, (4650), 2941 states have internal predecessors, (4650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:05,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2942 states to 2942 states and 4650 transitions. [2021-08-29 16:48:05,327 INFO L78 Accepts]: Start accepts. Automaton has 2942 states and 4650 transitions. Word has length 47 [2021-08-29 16:48:05,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:05,327 INFO L470 AbstractCegarLoop]: Abstraction has 2942 states and 4650 transitions. [2021-08-29 16:48:05,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:05,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2942 states and 4650 transitions. [2021-08-29 16:48:05,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-08-29 16:48:05,329 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:05,329 INFO L513 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] [2021-08-29 16:48:05,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-29 16:48:05,330 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:05,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:05,331 INFO L82 PathProgramCache]: Analyzing trace with hash 2025018232, now seen corresponding path program 1 times [2021-08-29 16:48:05,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:05,331 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360515644] [2021-08-29 16:48:05,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:05,331 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:05,357 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-29 16:48:05,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:48:05,358 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360515644] [2021-08-29 16:48:05,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360515644] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:48:05,358 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:48:05,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:48:05,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521550909] [2021-08-29 16:48:05,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:48:05,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:48:05,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:48:05,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:05,360 INFO L87 Difference]: Start difference. First operand 2942 states and 4650 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:05,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:05,615 INFO L93 Difference]: Finished difference Result 5833 states and 9241 transitions. [2021-08-29 16:48:05,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:48:05,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-08-29 16:48:05,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:05,625 INFO L225 Difference]: With dead ends: 5833 [2021-08-29 16:48:05,625 INFO L226 Difference]: Without dead ends: 2920 [2021-08-29 16:48:05,629 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.39ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:05,630 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 169 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 86.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.47ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 110.01ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:05,630 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 0 Invalid, 176 Unknown, 0 Unchecked, 0.47ms Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 110.01ms Time] [2021-08-29 16:48:05,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2021-08-29 16:48:05,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 2920. [2021-08-29 16:48:05,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2920 states, 2919 states have (on average 1.5841041452552245) internal successors, (4624), 2919 states have internal predecessors, (4624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:05,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4624 transitions. [2021-08-29 16:48:05,781 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4624 transitions. Word has length 47 [2021-08-29 16:48:05,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:05,781 INFO L470 AbstractCegarLoop]: Abstraction has 2920 states and 4624 transitions. [2021-08-29 16:48:05,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:05,781 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4624 transitions. [2021-08-29 16:48:05,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-29 16:48:05,783 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:05,783 INFO L513 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] [2021-08-29 16:48:05,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-29 16:48:05,783 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:05,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:05,784 INFO L82 PathProgramCache]: Analyzing trace with hash -2129316584, now seen corresponding path program 1 times [2021-08-29 16:48:05,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:05,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824255713] [2021-08-29 16:48:05,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:05,784 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:05,814 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:48:05,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:48:05,815 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824255713] [2021-08-29 16:48:05,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824255713] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:48:05,815 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:48:05,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 16:48:05,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107501068] [2021-08-29 16:48:05,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 16:48:05,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:48:05,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 16:48:05,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:48:05,816 INFO L87 Difference]: Start difference. First operand 2920 states and 4624 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:06,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:06,234 INFO L93 Difference]: Finished difference Result 7421 states and 11813 transitions. [2021-08-29 16:48:06,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 16:48:06,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-08-29 16:48:06,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:06,248 INFO L225 Difference]: With dead ends: 7421 [2021-08-29 16:48:06,248 INFO L226 Difference]: Without dead ends: 3797 [2021-08-29 16:48:06,252 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.51ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:48:06,253 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 384 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 173.37ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.26ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 220.37ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:06,253 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 0 Invalid, 338 Unknown, 0 Unchecked, 1.26ms Time], IncrementalHoareTripleChecker [9 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 220.37ms Time] [2021-08-29 16:48:06,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3797 states. [2021-08-29 16:48:06,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3797 to 3797. [2021-08-29 16:48:06,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3797 states, 3796 states have (on average 1.577976817702845) internal successors, (5990), 3796 states have internal predecessors, (5990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:06,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3797 states to 3797 states and 5990 transitions. [2021-08-29 16:48:06,469 INFO L78 Accepts]: Start accepts. Automaton has 3797 states and 5990 transitions. Word has length 48 [2021-08-29 16:48:06,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:06,470 INFO L470 AbstractCegarLoop]: Abstraction has 3797 states and 5990 transitions. [2021-08-29 16:48:06,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:06,470 INFO L276 IsEmpty]: Start isEmpty. Operand 3797 states and 5990 transitions. [2021-08-29 16:48:06,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-08-29 16:48:06,472 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:06,472 INFO L513 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] [2021-08-29 16:48:06,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-29 16:48:06,472 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:06,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:06,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1211370450, now seen corresponding path program 1 times [2021-08-29 16:48:06,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:06,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106291359] [2021-08-29 16:48:06,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:06,474 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:06,518 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:48:06,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:48:06,519 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106291359] [2021-08-29 16:48:06,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106291359] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:48:06,519 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:48:06,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-29 16:48:06,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799303160] [2021-08-29 16:48:06,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 16:48:06,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:48:06,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 16:48:06,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:48:06,521 INFO L87 Difference]: Start difference. First operand 3797 states and 5990 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:07,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:07,177 INFO L93 Difference]: Finished difference Result 9692 states and 15178 transitions. [2021-08-29 16:48:07,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-29 16:48:07,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-08-29 16:48:07,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:07,211 INFO L225 Difference]: With dead ends: 9692 [2021-08-29 16:48:07,211 INFO L226 Difference]: Without dead ends: 5918 [2021-08-29 16:48:07,216 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 19.35ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-29 16:48:07,217 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 653 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 284.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.36ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 346.70ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:07,217 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [653 Valid, 0 Invalid, 545 Unknown, 0 Unchecked, 2.36ms Time], IncrementalHoareTripleChecker [13 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 346.70ms Time] [2021-08-29 16:48:07,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5918 states. [2021-08-29 16:48:07,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5918 to 4440. [2021-08-29 16:48:07,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4440 states, 4439 states have (on average 1.5424645190358188) internal successors, (6847), 4439 states have internal predecessors, (6847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:07,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4440 states to 4440 states and 6847 transitions. [2021-08-29 16:48:07,472 INFO L78 Accepts]: Start accepts. Automaton has 4440 states and 6847 transitions. Word has length 53 [2021-08-29 16:48:07,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:07,472 INFO L470 AbstractCegarLoop]: Abstraction has 4440 states and 6847 transitions. [2021-08-29 16:48:07,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:07,473 INFO L276 IsEmpty]: Start isEmpty. Operand 4440 states and 6847 transitions. [2021-08-29 16:48:07,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-29 16:48:07,475 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:07,475 INFO L513 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] [2021-08-29 16:48:07,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-29 16:48:07,475 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:07,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:07,476 INFO L82 PathProgramCache]: Analyzing trace with hash -826237841, now seen corresponding path program 1 times [2021-08-29 16:48:07,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:07,476 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300953045] [2021-08-29 16:48:07,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:07,476 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:07,506 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:48:07,506 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:48:07,506 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300953045] [2021-08-29 16:48:07,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300953045] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:48:07,506 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:48:07,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:48:07,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203712181] [2021-08-29 16:48:07,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:48:07,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:48:07,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:48:07,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:07,507 INFO L87 Difference]: Start difference. First operand 4440 states and 6847 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:07,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:07,952 INFO L93 Difference]: Finished difference Result 9203 states and 14160 transitions. [2021-08-29 16:48:07,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:48:07,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-29 16:48:07,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:07,962 INFO L225 Difference]: With dead ends: 9203 [2021-08-29 16:48:07,962 INFO L226 Difference]: Without dead ends: 4792 [2021-08-29 16:48:07,968 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.06ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:07,969 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 124 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 138.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.36ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 177.26ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:07,969 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 0 Invalid, 313 Unknown, 0 Unchecked, 0.36ms Time], IncrementalHoareTripleChecker [5 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 177.26ms Time] [2021-08-29 16:48:07,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4792 states. [2021-08-29 16:48:08,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4792 to 4760. [2021-08-29 16:48:08,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4760 states, 4759 states have (on average 1.4910695524269804) internal successors, (7096), 4759 states have internal predecessors, (7096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:08,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4760 states to 4760 states and 7096 transitions. [2021-08-29 16:48:08,299 INFO L78 Accepts]: Start accepts. Automaton has 4760 states and 7096 transitions. Word has length 85 [2021-08-29 16:48:08,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:08,300 INFO L470 AbstractCegarLoop]: Abstraction has 4760 states and 7096 transitions. [2021-08-29 16:48:08,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:08,301 INFO L276 IsEmpty]: Start isEmpty. Operand 4760 states and 7096 transitions. [2021-08-29 16:48:08,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-08-29 16:48:08,304 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:08,304 INFO L513 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] [2021-08-29 16:48:08,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-29 16:48:08,305 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:08,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:08,305 INFO L82 PathProgramCache]: Analyzing trace with hash -433884439, now seen corresponding path program 1 times [2021-08-29 16:48:08,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:08,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888393826] [2021-08-29 16:48:08,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:08,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:08,330 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:48:08,330 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:48:08,330 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888393826] [2021-08-29 16:48:08,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888393826] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:48:08,330 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:48:08,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:48:08,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779967615] [2021-08-29 16:48:08,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:48:08,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:48:08,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:48:08,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:08,332 INFO L87 Difference]: Start difference. First operand 4760 states and 7096 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:08,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:08,787 INFO L93 Difference]: Finished difference Result 10001 states and 14870 transitions. [2021-08-29 16:48:08,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:48:08,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-08-29 16:48:08,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:08,798 INFO L225 Difference]: With dead ends: 10001 [2021-08-29 16:48:08,798 INFO L226 Difference]: Without dead ends: 5282 [2021-08-29 16:48:08,807 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.54ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:08,808 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 122 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 158.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.44ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 201.25ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:08,808 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 0 Invalid, 312 Unknown, 0 Unchecked, 0.44ms Time], IncrementalHoareTripleChecker [5 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 201.25ms Time] [2021-08-29 16:48:08,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5282 states. [2021-08-29 16:48:09,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5282 to 5234. [2021-08-29 16:48:09,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5234 states, 5233 states have (on average 1.4406650105102237) internal successors, (7539), 5233 states have internal predecessors, (7539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:09,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5234 states to 5234 states and 7539 transitions. [2021-08-29 16:48:09,114 INFO L78 Accepts]: Start accepts. Automaton has 5234 states and 7539 transitions. Word has length 86 [2021-08-29 16:48:09,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:09,114 INFO L470 AbstractCegarLoop]: Abstraction has 5234 states and 7539 transitions. [2021-08-29 16:48:09,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:09,115 INFO L276 IsEmpty]: Start isEmpty. Operand 5234 states and 7539 transitions. [2021-08-29 16:48:09,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-08-29 16:48:09,119 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:09,119 INFO L513 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] [2021-08-29 16:48:09,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-29 16:48:09,119 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:09,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:09,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1869450223, now seen corresponding path program 1 times [2021-08-29 16:48:09,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:09,120 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815478172] [2021-08-29 16:48:09,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:09,120 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:09,145 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:48:09,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:48:09,145 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815478172] [2021-08-29 16:48:09,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815478172] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:48:09,145 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:48:09,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:48:09,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584160044] [2021-08-29 16:48:09,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:48:09,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:48:09,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:48:09,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:09,146 INFO L87 Difference]: Start difference. First operand 5234 states and 7539 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:09,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:09,562 INFO L93 Difference]: Finished difference Result 10775 states and 15529 transitions. [2021-08-29 16:48:09,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:48:09,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-08-29 16:48:09,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:09,598 INFO L225 Difference]: With dead ends: 10775 [2021-08-29 16:48:09,598 INFO L226 Difference]: Without dead ends: 5602 [2021-08-29 16:48:09,603 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.31ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:09,605 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 117 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 139.19ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.36ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 190.15ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:09,605 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 0 Invalid, 315 Unknown, 0 Unchecked, 0.36ms Time], IncrementalHoareTripleChecker [8 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 190.15ms Time] [2021-08-29 16:48:09,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5602 states. [2021-08-29 16:48:09,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5602 to 5024. [2021-08-29 16:48:09,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5024 states, 5023 states have (on average 1.3770654987059525) internal successors, (6917), 5023 states have internal predecessors, (6917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:09,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5024 states to 5024 states and 6917 transitions. [2021-08-29 16:48:09,865 INFO L78 Accepts]: Start accepts. Automaton has 5024 states and 6917 transitions. Word has length 87 [2021-08-29 16:48:09,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:09,866 INFO L470 AbstractCegarLoop]: Abstraction has 5024 states and 6917 transitions. [2021-08-29 16:48:09,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:09,866 INFO L276 IsEmpty]: Start isEmpty. Operand 5024 states and 6917 transitions. [2021-08-29 16:48:09,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-29 16:48:09,870 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:09,870 INFO L513 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] [2021-08-29 16:48:09,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-29 16:48:09,871 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:09,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:09,871 INFO L82 PathProgramCache]: Analyzing trace with hash -2059863225, now seen corresponding path program 1 times [2021-08-29 16:48:09,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:09,872 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726230977] [2021-08-29 16:48:09,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:09,872 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:09,905 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-29 16:48:09,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:48:09,905 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726230977] [2021-08-29 16:48:09,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726230977] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:48:09,905 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:48:09,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 16:48:09,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623511150] [2021-08-29 16:48:09,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 16:48:09,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:48:09,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 16:48:09,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:48:09,908 INFO L87 Difference]: Start difference. First operand 5024 states and 6917 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:10,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:10,546 INFO L93 Difference]: Finished difference Result 9412 states and 12909 transitions. [2021-08-29 16:48:10,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 16:48:10,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-29 16:48:10,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:10,554 INFO L225 Difference]: With dead ends: 9412 [2021-08-29 16:48:10,554 INFO L226 Difference]: Without dead ends: 4839 [2021-08-29 16:48:10,560 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.73ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:48:10,560 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 426 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 229.83ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.49ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 299.83ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:10,560 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [426 Valid, 0 Invalid, 438 Unknown, 0 Unchecked, 1.49ms Time], IncrementalHoareTripleChecker [20 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 299.83ms Time] [2021-08-29 16:48:10,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4839 states. [2021-08-29 16:48:10,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4839 to 4725. [2021-08-29 16:48:10,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4725 states, 4724 states have (on average 1.3334038950042337) internal successors, (6299), 4724 states have internal predecessors, (6299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:10,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 6299 transitions. [2021-08-29 16:48:10,852 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 6299 transitions. Word has length 88 [2021-08-29 16:48:10,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:10,853 INFO L470 AbstractCegarLoop]: Abstraction has 4725 states and 6299 transitions. [2021-08-29 16:48:10,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:10,853 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 6299 transitions. [2021-08-29 16:48:10,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-08-29 16:48:10,863 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:10,863 INFO L513 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] [2021-08-29 16:48:10,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-29 16:48:10,863 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:10,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:10,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1061949686, now seen corresponding path program 1 times [2021-08-29 16:48:10,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:10,864 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996813299] [2021-08-29 16:48:10,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:10,864 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:10,886 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-29 16:48:10,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:48:10,887 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996813299] [2021-08-29 16:48:10,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996813299] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:48:10,887 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:48:10,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:48:10,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610464390] [2021-08-29 16:48:10,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:48:10,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:48:10,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:48:10,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:10,888 INFO L87 Difference]: Start difference. First operand 4725 states and 6299 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:11,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:11,335 INFO L93 Difference]: Finished difference Result 9005 states and 11995 transitions. [2021-08-29 16:48:11,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:48:11,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2021-08-29 16:48:11,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:11,347 INFO L225 Difference]: With dead ends: 9005 [2021-08-29 16:48:11,347 INFO L226 Difference]: Without dead ends: 4671 [2021-08-29 16:48:11,351 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.43ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:11,352 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 126.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.50ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 162.38ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:11,352 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 301 Unknown, 0 Unchecked, 0.50ms Time], IncrementalHoareTripleChecker [4 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 162.38ms Time] [2021-08-29 16:48:11,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4671 states. [2021-08-29 16:48:11,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4671 to 4671. [2021-08-29 16:48:11,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4671 states, 4670 states have (on average 1.3261241970021413) internal successors, (6193), 4670 states have internal predecessors, (6193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:11,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4671 states to 4671 states and 6193 transitions. [2021-08-29 16:48:11,611 INFO L78 Accepts]: Start accepts. Automaton has 4671 states and 6193 transitions. Word has length 115 [2021-08-29 16:48:11,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:11,611 INFO L470 AbstractCegarLoop]: Abstraction has 4671 states and 6193 transitions. [2021-08-29 16:48:11,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:11,611 INFO L276 IsEmpty]: Start isEmpty. Operand 4671 states and 6193 transitions. [2021-08-29 16:48:11,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-08-29 16:48:11,620 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:11,620 INFO L513 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] [2021-08-29 16:48:11,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-29 16:48:11,620 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:11,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:11,621 INFO L82 PathProgramCache]: Analyzing trace with hash 314934891, now seen corresponding path program 1 times [2021-08-29 16:48:11,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:11,621 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417785601] [2021-08-29 16:48:11,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:11,621 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:11,656 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-29 16:48:11,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:48:11,656 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417785601] [2021-08-29 16:48:11,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417785601] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:48:11,657 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:48:11,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 16:48:11,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077011123] [2021-08-29 16:48:11,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 16:48:11,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:48:11,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 16:48:11,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:48:11,658 INFO L87 Difference]: Start difference. First operand 4671 states and 6193 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:12,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:12,096 INFO L93 Difference]: Finished difference Result 8293 states and 11017 transitions. [2021-08-29 16:48:12,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 16:48:12,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2021-08-29 16:48:12,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:12,105 INFO L225 Difference]: With dead ends: 8293 [2021-08-29 16:48:12,105 INFO L226 Difference]: Without dead ends: 4591 [2021-08-29 16:48:12,110 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.02ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:48:12,110 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 291 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 145.04ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.12ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 184.03ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:12,114 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [291 Valid, 0 Invalid, 328 Unknown, 0 Unchecked, 2.12ms Time], IncrementalHoareTripleChecker [5 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 184.03ms Time] [2021-08-29 16:48:12,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4591 states. [2021-08-29 16:48:12,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4591 to 4589. [2021-08-29 16:48:12,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4589 states, 4588 states have (on average 1.3016564952048824) internal successors, (5972), 4588 states have internal predecessors, (5972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:12,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4589 states to 4589 states and 5972 transitions. [2021-08-29 16:48:12,365 INFO L78 Accepts]: Start accepts. Automaton has 4589 states and 5972 transitions. Word has length 127 [2021-08-29 16:48:12,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:12,365 INFO L470 AbstractCegarLoop]: Abstraction has 4589 states and 5972 transitions. [2021-08-29 16:48:12,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:12,365 INFO L276 IsEmpty]: Start isEmpty. Operand 4589 states and 5972 transitions. [2021-08-29 16:48:12,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-08-29 16:48:12,372 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:12,373 INFO L513 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] [2021-08-29 16:48:12,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-29 16:48:12,373 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:12,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:12,373 INFO L82 PathProgramCache]: Analyzing trace with hash -146147841, now seen corresponding path program 1 times [2021-08-29 16:48:12,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:12,374 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576178922] [2021-08-29 16:48:12,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:12,374 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:12,398 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-08-29 16:48:12,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:48:12,399 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576178922] [2021-08-29 16:48:12,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576178922] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:48:12,399 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:48:12,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:48:12,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731689432] [2021-08-29 16:48:12,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:48:12,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:48:12,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:48:12,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:12,401 INFO L87 Difference]: Start difference. First operand 4589 states and 5972 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:12,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:12,782 INFO L93 Difference]: Finished difference Result 8787 states and 11424 transitions. [2021-08-29 16:48:12,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:48:12,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2021-08-29 16:48:12,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:12,788 INFO L225 Difference]: With dead ends: 8787 [2021-08-29 16:48:12,788 INFO L226 Difference]: Without dead ends: 4589 [2021-08-29 16:48:12,793 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.46ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:12,793 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 132.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.42ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 168.78ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:12,793 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 295 Unknown, 0 Unchecked, 0.42ms Time], IncrementalHoareTripleChecker [2 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 168.78ms Time] [2021-08-29 16:48:12,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4589 states. [2021-08-29 16:48:12,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4589 to 4549. [2021-08-29 16:48:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4549 states, 4548 states have (on average 1.2950747581354443) internal successors, (5890), 4548 states have internal predecessors, (5890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:13,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4549 states to 4549 states and 5890 transitions. [2021-08-29 16:48:13,003 INFO L78 Accepts]: Start accepts. Automaton has 4549 states and 5890 transitions. Word has length 133 [2021-08-29 16:48:13,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:13,004 INFO L470 AbstractCegarLoop]: Abstraction has 4549 states and 5890 transitions. [2021-08-29 16:48:13,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:13,004 INFO L276 IsEmpty]: Start isEmpty. Operand 4549 states and 5890 transitions. [2021-08-29 16:48:13,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-08-29 16:48:13,011 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:13,012 INFO L513 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] [2021-08-29 16:48:13,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-29 16:48:13,012 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:13,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:13,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1797709215, now seen corresponding path program 1 times [2021-08-29 16:48:13,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:13,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111100015] [2021-08-29 16:48:13,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:13,013 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:13,035 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-08-29 16:48:13,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:48:13,035 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111100015] [2021-08-29 16:48:13,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111100015] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:48:13,035 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:48:13,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:48:13,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262548440] [2021-08-29 16:48:13,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:48:13,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:48:13,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:48:13,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:13,037 INFO L87 Difference]: Start difference. First operand 4549 states and 5890 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:13,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:13,408 INFO L93 Difference]: Finished difference Result 8735 states and 11302 transitions. [2021-08-29 16:48:13,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:48:13,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2021-08-29 16:48:13,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:13,420 INFO L225 Difference]: With dead ends: 8735 [2021-08-29 16:48:13,420 INFO L226 Difference]: Without dead ends: 4558 [2021-08-29 16:48:13,425 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.37ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:13,426 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 115.04ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.40ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 147.88ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:13,426 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 294 Unknown, 0 Unchecked, 0.40ms Time], IncrementalHoareTripleChecker [2 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 147.88ms Time] [2021-08-29 16:48:13,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4558 states. [2021-08-29 16:48:13,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4558 to 4518. [2021-08-29 16:48:13,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4518 states, 4517 states have (on average 1.2880230241310604) internal successors, (5818), 4517 states have internal predecessors, (5818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:13,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4518 states to 4518 states and 5818 transitions. [2021-08-29 16:48:13,656 INFO L78 Accepts]: Start accepts. Automaton has 4518 states and 5818 transitions. Word has length 133 [2021-08-29 16:48:13,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:13,657 INFO L470 AbstractCegarLoop]: Abstraction has 4518 states and 5818 transitions. [2021-08-29 16:48:13,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:13,657 INFO L276 IsEmpty]: Start isEmpty. Operand 4518 states and 5818 transitions. [2021-08-29 16:48:13,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-08-29 16:48:13,666 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:13,666 INFO L513 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] [2021-08-29 16:48:13,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-29 16:48:13,666 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:13,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:13,667 INFO L82 PathProgramCache]: Analyzing trace with hash 282610594, now seen corresponding path program 1 times [2021-08-29 16:48:13,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:13,667 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967220779] [2021-08-29 16:48:13,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:13,667 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:13,693 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-08-29 16:48:13,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:48:13,693 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967220779] [2021-08-29 16:48:13,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967220779] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:48:13,693 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:48:13,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 16:48:13,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847049072] [2021-08-29 16:48:13,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 16:48:13,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:48:13,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 16:48:13,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:48:13,694 INFO L87 Difference]: Start difference. First operand 4518 states and 5818 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:14,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:14,071 INFO L93 Difference]: Finished difference Result 7327 states and 9468 transitions. [2021-08-29 16:48:14,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 16:48:14,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2021-08-29 16:48:14,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:14,076 INFO L225 Difference]: With dead ends: 7327 [2021-08-29 16:48:14,076 INFO L226 Difference]: Without dead ends: 3182 [2021-08-29 16:48:14,080 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.19ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:48:14,082 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 269 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 144.52ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.86ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 183.38ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:14,082 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 0 Invalid, 301 Unknown, 0 Unchecked, 0.86ms Time], IncrementalHoareTripleChecker [4 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 183.38ms Time] [2021-08-29 16:48:14,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3182 states. [2021-08-29 16:48:14,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3182 to 3180. [2021-08-29 16:48:14,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3180 states, 3179 states have (on average 1.2582573136206354) internal successors, (4000), 3179 states have internal predecessors, (4000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:14,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3180 states to 3180 states and 4000 transitions. [2021-08-29 16:48:14,301 INFO L78 Accepts]: Start accepts. Automaton has 3180 states and 4000 transitions. Word has length 136 [2021-08-29 16:48:14,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:14,301 INFO L470 AbstractCegarLoop]: Abstraction has 3180 states and 4000 transitions. [2021-08-29 16:48:14,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:14,302 INFO L276 IsEmpty]: Start isEmpty. Operand 3180 states and 4000 transitions. [2021-08-29 16:48:14,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-08-29 16:48:14,305 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:14,306 INFO L513 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] [2021-08-29 16:48:14,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-29 16:48:14,306 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:14,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:14,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1519116211, now seen corresponding path program 1 times [2021-08-29 16:48:14,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:14,307 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899335641] [2021-08-29 16:48:14,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:14,307 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:14,335 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-08-29 16:48:14,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:48:14,336 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899335641] [2021-08-29 16:48:14,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899335641] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:48:14,336 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:48:14,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 16:48:14,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058209903] [2021-08-29 16:48:14,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 16:48:14,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:48:14,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 16:48:14,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:48:14,337 INFO L87 Difference]: Start difference. First operand 3180 states and 4000 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:14,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:14,647 INFO L93 Difference]: Finished difference Result 5150 states and 6486 transitions. [2021-08-29 16:48:14,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 16:48:14,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2021-08-29 16:48:14,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:14,650 INFO L225 Difference]: With dead ends: 5150 [2021-08-29 16:48:14,650 INFO L226 Difference]: Without dead ends: 2043 [2021-08-29 16:48:14,653 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.84ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:48:14,654 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 272 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 128.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.75ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 168.81ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:14,654 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 0 Invalid, 288 Unknown, 0 Unchecked, 0.75ms Time], IncrementalHoareTripleChecker [4 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 168.81ms Time] [2021-08-29 16:48:14,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2021-08-29 16:48:14,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 2041. [2021-08-29 16:48:14,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2041 states, 2040 states have (on average 1.218627450980392) internal successors, (2486), 2040 states have internal predecessors, (2486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:14,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 2041 states and 2486 transitions. [2021-08-29 16:48:14,791 INFO L78 Accepts]: Start accepts. Automaton has 2041 states and 2486 transitions. Word has length 136 [2021-08-29 16:48:14,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:14,791 INFO L470 AbstractCegarLoop]: Abstraction has 2041 states and 2486 transitions. [2021-08-29 16:48:14,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:14,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 2486 transitions. [2021-08-29 16:48:14,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-08-29 16:48:14,793 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:14,793 INFO L513 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] [2021-08-29 16:48:14,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-29 16:48:14,794 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:14,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:14,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1947572035, now seen corresponding path program 1 times [2021-08-29 16:48:14,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:14,794 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636326796] [2021-08-29 16:48:14,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:14,795 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:14,827 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-29 16:48:14,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:48:14,827 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636326796] [2021-08-29 16:48:14,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636326796] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:48:14,828 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:48:14,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:48:14,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084272676] [2021-08-29 16:48:14,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:48:14,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:48:14,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:48:14,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:14,829 INFO L87 Difference]: Start difference. First operand 2041 states and 2486 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:15,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:15,084 INFO L93 Difference]: Finished difference Result 3699 states and 4535 transitions. [2021-08-29 16:48:15,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:48:15,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 175 [2021-08-29 16:48:15,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:15,087 INFO L225 Difference]: With dead ends: 3699 [2021-08-29 16:48:15,087 INFO L226 Difference]: Without dead ends: 1999 [2021-08-29 16:48:15,088 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.49ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:15,089 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 106.10ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.47ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 135.34ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:15,089 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 298 Unknown, 0 Unchecked, 0.47ms Time], IncrementalHoareTripleChecker [1 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 135.34ms Time] [2021-08-29 16:48:15,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2021-08-29 16:48:15,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1931. [2021-08-29 16:48:15,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1931 states, 1930 states have (on average 1.206217616580311) internal successors, (2328), 1930 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:15,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 2328 transitions. [2021-08-29 16:48:15,198 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 2328 transitions. Word has length 175 [2021-08-29 16:48:15,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:15,198 INFO L470 AbstractCegarLoop]: Abstraction has 1931 states and 2328 transitions. [2021-08-29 16:48:15,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:15,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2328 transitions. [2021-08-29 16:48:15,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2021-08-29 16:48:15,200 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:15,200 INFO L513 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] [2021-08-29 16:48:15,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-29 16:48:15,201 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:15,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:15,201 INFO L82 PathProgramCache]: Analyzing trace with hash 640476680, now seen corresponding path program 1 times [2021-08-29 16:48:15,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:15,201 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459737795] [2021-08-29 16:48:15,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:15,202 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:15,230 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-29 16:48:15,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:48:15,231 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459737795] [2021-08-29 16:48:15,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459737795] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:48:15,231 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:48:15,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:48:15,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586204652] [2021-08-29 16:48:15,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:48:15,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:48:15,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:48:15,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:15,232 INFO L87 Difference]: Start difference. First operand 1931 states and 2328 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:15,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:15,569 INFO L93 Difference]: Finished difference Result 4154 states and 5043 transitions. [2021-08-29 16:48:15,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:48:15,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 181 [2021-08-29 16:48:15,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:15,575 INFO L225 Difference]: With dead ends: 4154 [2021-08-29 16:48:15,575 INFO L226 Difference]: Without dead ends: 2560 [2021-08-29 16:48:15,577 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.51ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:15,578 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 137 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 140.30ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.43ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 183.31ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:15,578 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 0 Invalid, 290 Unknown, 0 Unchecked, 0.43ms Time], IncrementalHoareTripleChecker [4 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 183.31ms Time] [2021-08-29 16:48:15,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2021-08-29 16:48:15,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 2209. [2021-08-29 16:48:15,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2209 states, 2208 states have (on average 1.190217391304348) internal successors, (2628), 2208 states have internal predecessors, (2628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:15,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 2628 transitions. [2021-08-29 16:48:15,713 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 2628 transitions. Word has length 181 [2021-08-29 16:48:15,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:15,713 INFO L470 AbstractCegarLoop]: Abstraction has 2209 states and 2628 transitions. [2021-08-29 16:48:15,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:15,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 2628 transitions. [2021-08-29 16:48:15,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-08-29 16:48:15,715 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:15,715 INFO L513 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] [2021-08-29 16:48:15,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-29 16:48:15,716 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:15,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:15,716 INFO L82 PathProgramCache]: Analyzing trace with hash -646225786, now seen corresponding path program 1 times [2021-08-29 16:48:15,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:15,717 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758554467] [2021-08-29 16:48:15,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:15,718 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:15,745 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-08-29 16:48:15,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:48:15,745 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758554467] [2021-08-29 16:48:15,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758554467] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:48:15,745 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:48:15,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:48:15,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223346464] [2021-08-29 16:48:15,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:48:15,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:48:15,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:48:15,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:15,747 INFO L87 Difference]: Start difference. First operand 2209 states and 2628 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:15,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:15,980 INFO L93 Difference]: Finished difference Result 3746 states and 4490 transitions. [2021-08-29 16:48:15,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:48:15,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-08-29 16:48:15,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:15,983 INFO L225 Difference]: With dead ends: 3746 [2021-08-29 16:48:15,983 INFO L226 Difference]: Without dead ends: 1872 [2021-08-29 16:48:15,984 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.50ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:15,985 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 3 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 104.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.44ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 133.15ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:15,985 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 0 Invalid, 294 Unknown, 0 Unchecked, 0.44ms Time], IncrementalHoareTripleChecker [2 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 133.15ms Time] [2021-08-29 16:48:15,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2021-08-29 16:48:16,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1793. [2021-08-29 16:48:16,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1793 states, 1792 states have (on average 1.1729910714285714) internal successors, (2102), 1792 states have internal predecessors, (2102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:16,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2102 transitions. [2021-08-29 16:48:16,083 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2102 transitions. Word has length 184 [2021-08-29 16:48:16,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:16,084 INFO L470 AbstractCegarLoop]: Abstraction has 1793 states and 2102 transitions. [2021-08-29 16:48:16,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:16,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2102 transitions. [2021-08-29 16:48:16,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-08-29 16:48:16,085 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:16,085 INFO L513 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] [2021-08-29 16:48:16,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-29 16:48:16,085 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:16,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:16,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1772258692, now seen corresponding path program 1 times [2021-08-29 16:48:16,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:16,085 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584214060] [2021-08-29 16:48:16,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:16,086 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 16:48:16,112 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-29 16:48:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 16:48:16,184 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-29 16:48:16,184 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-08-29 16:48:16,185 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-08-29 16:48:16,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-29 16:48:16,195 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-29 16:48:16,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 04:48:16 BoogieIcfgContainer [2021-08-29 16:48:16,392 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-29 16:48:16,393 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-29 16:48:16,393 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-29 16:48:16,393 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-29 16:48:16,393 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 04:47:58" (3/4) ... [2021-08-29 16:48:16,395 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-29 16:48:16,556 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-29 16:48:16,557 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-29 16:48:16,557 INFO L158 Benchmark]: Toolchain (without parser) took 19018.73ms. Allocated memory was 60.8MB in the beginning and 1.6GB in the end (delta: 1.6GB). Free memory was 38.8MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 180.5MB. Max. memory is 16.1GB. [2021-08-29 16:48:16,557 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 60.8MB. Free memory is still 41.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-08-29 16:48:16,558 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.50ms. Allocated memory is still 60.8MB. Free memory was 38.6MB in the beginning and 40.3MB in the end (delta: -1.7MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2021-08-29 16:48:16,558 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.80ms. Allocated memory is still 60.8MB. Free memory was 40.1MB in the beginning and 37.9MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-08-29 16:48:16,558 INFO L158 Benchmark]: Boogie Preprocessor took 52.85ms. Allocated memory is still 60.8MB. Free memory was 37.9MB in the beginning and 35.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-29 16:48:16,558 INFO L158 Benchmark]: RCFGBuilder took 307.50ms. Allocated memory is still 60.8MB. Free memory was 35.8MB in the beginning and 35.4MB in the end (delta: 423.1kB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2021-08-29 16:48:16,565 INFO L158 Benchmark]: TraceAbstraction took 18126.60ms. Allocated memory was 60.8MB in the beginning and 1.6GB in the end (delta: 1.6GB). Free memory was 34.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 139.0MB. Max. memory is 16.1GB. [2021-08-29 16:48:16,565 INFO L158 Benchmark]: Witness Printer took 163.85ms. Allocated memory is still 1.6GB. Free memory was 1.5GB in the beginning and 1.4GB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2021-08-29 16:48:16,567 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.19ms. Allocated memory is still 60.8MB. Free memory is still 41.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.50ms. Allocated memory is still 60.8MB. Free memory was 38.6MB in the beginning and 40.3MB in the end (delta: -1.7MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.80ms. Allocated memory is still 60.8MB. Free memory was 40.1MB in the beginning and 37.9MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.85ms. Allocated memory is still 60.8MB. Free memory was 37.9MB in the beginning and 35.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 307.50ms. Allocated memory is still 60.8MB. Free memory was 35.8MB in the beginning and 35.4MB in the end (delta: 423.1kB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. * TraceAbstraction took 18126.60ms. Allocated memory was 60.8MB in the beginning and 1.6GB in the end (delta: 1.6GB). Free memory was 34.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 139.0MB. Max. memory is 16.1GB. * Witness Printer took 163.85ms. Allocated memory is still 1.6GB. Free memory was 1.5GB in the beginning and 1.4GB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L20] int c ; [L21] int c_t ; [L22] int c_req_up ; [L23] int p_in ; [L24] int p_out ; [L25] int wl_st ; [L26] int c1_st ; [L27] int c2_st ; [L28] int wb_st ; [L29] int r_st ; [L30] int wl_i ; [L31] int c1_i ; [L32] int c2_i ; [L33] int wb_i ; [L34] int r_i ; [L35] int wl_pc ; [L36] int c1_pc ; [L37] int c2_pc ; [L38] int wb_pc ; [L39] int e_e ; [L40] int e_f ; [L41] int e_g ; [L42] int e_c ; [L43] int e_p_in ; [L44] int e_wl ; [L50] int d ; [L51] int data ; [L52] int processed ; [L53] static int t_b ; VAL [c=0, c1_i=0, c1_pc=0, c1_st=0, c2_i=0, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=0, e_e=0, e_f=0, e_g=0, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=0, wb_pc=0, wb_st=0, wl_i=0, wl_pc=0, wl_st=0] [L681] int __retres1 ; [L685] e_wl = 2 [L686] e_c = e_wl [L687] e_g = e_c [L688] e_f = e_g [L689] e_e = e_f [L690] wl_pc = 0 [L691] c1_pc = 0 [L692] c2_pc = 0 [L693] wb_pc = 0 [L694] wb_i = 1 [L695] c2_i = wb_i [L696] c1_i = c2_i [L697] wl_i = c1_i [L698] r_i = 0 [L699] c_req_up = 0 [L700] d = 0 [L701] c = 0 [L392] int kernel_st ; [L395] kernel_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L396] COND FALSE !((int )c_req_up == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L407] COND TRUE (int )wl_i == 1 [L408] wl_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L412] COND TRUE (int )c1_i == 1 [L413] c1_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L417] COND TRUE (int )c2_i == 1 [L418] c2_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L422] COND TRUE (int )wb_i == 1 [L423] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L427] COND FALSE !((int )r_i == 1) [L430] r_st = 2 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L432] COND FALSE !((int )e_f == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L437] COND FALSE !((int )e_g == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L442] COND FALSE !((int )e_e == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L447] COND FALSE !((int )e_c == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L452] COND FALSE !((int )e_wl == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L457] COND FALSE !((int )wl_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L465] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L475] COND FALSE !((int )c1_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L484] COND FALSE !((int )c2_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L493] COND FALSE !((int )wb_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L502] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L507] COND FALSE !((int )e_e == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L512] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L517] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L522] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L527] COND FALSE !((int )e_wl == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L533] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L536] kernel_st = 1 [L278] int tmp ; [L279] int tmp___0 ; [L280] int tmp___1 ; [L281] int tmp___2 ; [L282] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L288] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L309] COND TRUE (int )wl_st == 0 [L311] tmp = __VERIFIER_nondet_int() [L313] COND TRUE \read(tmp) [L315] wl_st = 1 [L55] int t ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L58] COND TRUE (int )wl_pc == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L72] wl_st = 2 [L73] wl_pc = 1 [L74] e_wl = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L324] COND TRUE (int )c1_st == 0 [L326] tmp___0 = __VERIFIER_nondet_int() [L328] COND TRUE \read(tmp___0) [L330] c1_st = 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L129] COND TRUE (int )c1_pc == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L140] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L142] c1_st = 2 [L143] c1_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L339] COND TRUE (int )c2_st == 0 [L341] tmp___1 = __VERIFIER_nondet_int() [L343] COND TRUE \read(tmp___1) [L345] c2_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L174] COND TRUE (int )c2_pc == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L185] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L187] c2_st = 2 [L188] c2_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L354] COND TRUE (int )wb_st == 0 [L356] tmp___2 = __VERIFIER_nondet_int() [L358] COND TRUE \read(tmp___2) [L360] wb_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L219] COND TRUE (int )wb_pc == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L230] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L232] wb_st = 2 [L233] wb_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L369] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L288] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L291] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L294] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L297] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L300] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L539] kernel_st = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L540] COND FALSE !((int )c_req_up == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L551] kernel_st = 3 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L552] COND FALSE !((int )e_f == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L557] COND FALSE !((int )e_g == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L562] COND FALSE !((int )e_e == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L567] COND FALSE !((int )e_c == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L572] COND TRUE (int )e_wl == 0 [L573] e_wl = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L577] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L578] COND TRUE (int )e_wl == 1 [L579] wl_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L595] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L596] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L604] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L605] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L613] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L614] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L622] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L627] COND FALSE !((int )e_e == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L632] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L637] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L642] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L647] COND TRUE (int )e_wl == 1 [L648] e_wl = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L652] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L533] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L536] kernel_st = 1 [L278] int tmp ; [L279] int tmp___0 ; [L280] int tmp___1 ; [L281] int tmp___2 ; [L282] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L288] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L309] COND TRUE (int )wl_st == 0 [L311] tmp = __VERIFIER_nondet_int() [L313] COND TRUE \read(tmp) [L315] wl_st = 1 [L55] int t ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L58] COND FALSE !((int )wl_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L61] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L64] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L79] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L81] t = d [L82] data = d [L83] processed = 0 [L84] e_f = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L85] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L86] COND TRUE (int )e_f == 1 [L87] c1_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L94] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L95] COND TRUE (int )e_f == 1 [L96] c2_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L103] e_f = 2 [L104] wl_st = 2 [L105] wl_pc = 2 [L106] t_b = t VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L324] COND TRUE (int )c1_st == 0 [L326] tmp___0 = __VERIFIER_nondet_int() [L328] COND TRUE \read(tmp___0) [L330] c1_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L129] COND FALSE !((int )c1_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L132] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L147] COND TRUE ! processed [L148] data += 1 [L149] e_g = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L150] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L151] COND TRUE (int )e_g == 1 [L152] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L159] e_g = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L140] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L142] c1_st = 2 [L143] c1_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L339] COND TRUE (int )c2_st == 0 [L341] tmp___1 = __VERIFIER_nondet_int() [L343] COND TRUE \read(tmp___1) [L345] c2_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L174] COND FALSE !((int )c2_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L177] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L192] COND TRUE ! processed [L193] data += 1 [L194] e_g = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L195] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L196] COND TRUE (int )e_g == 1 [L197] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L204] e_g = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L185] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L187] c2_st = 2 [L188] c2_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L354] COND TRUE (int )wb_st == 0 [L356] tmp___2 = __VERIFIER_nondet_int() [L358] COND TRUE \read(tmp___2) [L360] wb_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L219] COND FALSE !((int )wb_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L222] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L237] c_t = data [L238] c_req_up = 1 [L239] processed = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L230] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L232] wb_st = 2 [L233] wb_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L369] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L288] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L291] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L294] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L297] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L300] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L539] kernel_st = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L540] COND TRUE (int )c_req_up == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L541] COND TRUE c != c_t [L542] c = c_t [L543] e_c = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L547] c_req_up = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L551] kernel_st = 3 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L552] COND FALSE !((int )e_f == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L557] COND FALSE !((int )e_g == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L562] COND FALSE !((int )e_e == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L567] COND TRUE (int )e_c == 0 [L568] e_c = 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L572] COND FALSE !((int )e_wl == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L577] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L585] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L586] COND FALSE !((int )e_e == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L595] COND TRUE (int )c1_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L596] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L604] COND TRUE (int )c2_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L605] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L613] COND TRUE (int )wb_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L614] COND FALSE !((int )e_g == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L622] COND TRUE (int )e_c == 1 [L623] r_st = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L627] COND FALSE !((int )e_e == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L632] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L637] COND FALSE !((int )e_g == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L642] COND TRUE (int )e_c == 1 [L643] e_c = 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L647] COND FALSE !((int )e_wl == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L652] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L655] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L658] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L661] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L664] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L533] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L536] kernel_st = 1 [L278] int tmp ; [L279] int tmp___0 ; [L280] int tmp___1 ; [L281] int tmp___2 ; [L282] int tmp___3 ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L286] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L288] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L291] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L294] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L297] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L300] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L309] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L324] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L339] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L354] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L369] COND TRUE (int )r_st == 0 [L371] tmp___3 = __VERIFIER_nondet_int() [L373] COND TRUE \read(tmp___3) [L375] r_st = 1 [L251] d = c [L252] e_e = 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L253] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L261] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L262] COND TRUE (int )e_e == 1 [L263] wl_st = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L271] e_e = 2 [L272] r_st = 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L286] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L288] COND TRUE (int )wl_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L309] COND TRUE (int )wl_st == 0 [L311] tmp = __VERIFIER_nondet_int() [L313] COND TRUE \read(tmp) [L315] wl_st = 1 [L55] int t ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L58] COND FALSE !((int )wl_pc == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L61] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L110] t = t_b VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L111] COND FALSE !(d == t + 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L15] reach_error() VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17886.84ms, OverallIterations: 33, TraceHistogramMax: 6, EmptinessCheckTime: 101.82ms, AutomataDifference: 12164.30ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 10.80ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7478 SdHoareTripleChecker+Valid, 7510.14ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7478 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 5769.99ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3842 mSDsCounter, 203 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10903 IncrementalHoareTripleChecker+Invalid, 11106 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 203 mSolverCounterUnsat, 0 mSDtfsCounter, 10903 mSolverCounterSat, 44.34ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 145.85ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5234occurred in iteration=21, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 4042.51ms AutomataMinimizationTime, 32 MinimizatonAttempts, 4252 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 78.15ms SsaConstructionTime, 266.48ms SatisfiabilityAnalysisTime, 835.43ms InterpolantComputationTime, 2601 NumberOfCodeBlocks, 2601 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2385 ConstructedInterpolants, 0 QuantifiedInterpolants, 3897 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 PerfectInterpolantSequences, 704/704 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-29 16:48:16,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...