./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i -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 1b7eb90186eb2f5804d582daa800e24f20cc36e3f07dd8983b72b6a43dcf9225 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:05:38,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:05:38,128 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:05:38,178 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:05:38,179 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:05:38,180 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:05:38,183 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:05:38,185 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:05:38,187 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:05:38,191 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:05:38,192 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:05:38,194 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:05:38,194 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:05:38,196 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:05:38,197 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:05:38,203 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:05:38,204 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:05:38,206 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:05:38,207 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:05:38,213 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:05:38,215 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:05:38,216 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:05:38,217 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:05:38,218 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:05:38,219 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:05:38,226 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:05:38,226 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:05:38,226 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:05:38,228 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:05:38,228 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:05:38,229 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:05:38,229 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:05:38,231 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:05:38,232 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:05:38,232 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:05:38,233 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:05:38,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:05:38,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:05:38,235 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:05:38,235 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:05:38,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:05:38,238 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:05:38,240 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 10:05:38,268 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:05:38,268 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:05:38,269 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:05:38,269 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:05:38,270 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:05:38,270 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:05:38,271 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:05:38,271 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:05:38,271 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:05:38,272 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:05:38,272 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 10:05:38,272 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:05:38,272 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 10:05:38,273 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:05:38,273 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:05:38,273 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:05:38,273 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:05:38,273 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 10:05:38,273 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:05:38,274 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:05:38,274 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:05:38,274 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:05:38,274 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:05:38,274 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:05:38,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:05:38,275 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:05:38,275 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:05:38,275 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:05:38,276 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:05:38,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:05:38,276 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:05:38,276 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:05:38,276 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:05:38,277 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 -> 1b7eb90186eb2f5804d582daa800e24f20cc36e3f07dd8983b72b6a43dcf9225 [2022-07-12 10:05:38,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:05:38,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:05:38,530 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:05:38,532 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:05:38,532 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:05:38,533 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i [2022-07-12 10:05:38,600 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b92e4799/d150ac410bb0498bbc1f367559472d1d/FLAG063e6978a [2022-07-12 10:05:39,081 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:05:39,082 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i [2022-07-12 10:05:39,099 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b92e4799/d150ac410bb0498bbc1f367559472d1d/FLAG063e6978a [2022-07-12 10:05:39,429 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b92e4799/d150ac410bb0498bbc1f367559472d1d [2022-07-12 10:05:39,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:05:39,433 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:05:39,435 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:05:39,435 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:05:39,441 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:05:39,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:05:39" (1/1) ... [2022-07-12 10:05:39,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52fa0414 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:39, skipping insertion in model container [2022-07-12 10:05:39,444 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:05:39" (1/1) ... [2022-07-12 10:05:39,450 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:05:39,489 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:05:39,635 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i[1009,1022] [2022-07-12 10:05:39,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:05:39,865 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:05:39,876 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i[1009,1022] [2022-07-12 10:05:39,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:05:39,940 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:05:39,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:39 WrapperNode [2022-07-12 10:05:39,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:05:39,942 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:05:39,942 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:05:39,942 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:05:39,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:39" (1/1) ... [2022-07-12 10:05:39,963 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:39" (1/1) ... [2022-07-12 10:05:39,987 INFO L137 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 179 [2022-07-12 10:05:39,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:05:39,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:05:39,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:05:39,989 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:05:39,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:39" (1/1) ... [2022-07-12 10:05:39,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:39" (1/1) ... [2022-07-12 10:05:40,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:39" (1/1) ... [2022-07-12 10:05:40,005 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:39" (1/1) ... [2022-07-12 10:05:40,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:39" (1/1) ... [2022-07-12 10:05:40,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:39" (1/1) ... [2022-07-12 10:05:40,035 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:39" (1/1) ... [2022-07-12 10:05:40,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:05:40,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:05:40,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:05:40,056 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:05:40,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:39" (1/1) ... [2022-07-12 10:05:40,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:05:40,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:05:40,117 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) [2022-07-12 10:05:40,140 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 [2022-07-12 10:05:40,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:05:40,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-12 10:05:40,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:05:40,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:05:40,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:05:40,163 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-12 10:05:40,164 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-12 10:05:40,164 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-12 10:05:40,165 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-12 10:05:40,165 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-12 10:05:40,165 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-12 10:05:40,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:05:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-12 10:05:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:05:40,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:05:40,168 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-12 10:05:40,361 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:05:40,362 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:05:40,844 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:05:41,206 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:05:41,207 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 10:05:41,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:05:41 BoogieIcfgContainer [2022-07-12 10:05:41,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:05:41,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:05:41,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:05:41,215 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:05:41,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:05:39" (1/3) ... [2022-07-12 10:05:41,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95499ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:05:41, skipping insertion in model container [2022-07-12 10:05:41,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:39" (2/3) ... [2022-07-12 10:05:41,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95499ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:05:41, skipping insertion in model container [2022-07-12 10:05:41,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:05:41" (3/3) ... [2022-07-12 10:05:41,218 INFO L111 eAbstractionObserver]: Analyzing ICFG mix024_power.opt_pso.opt_rmo.opt.i [2022-07-12 10:05:41,223 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-12 10:05:41,231 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:05:41,231 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-12 10:05:41,232 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-12 10:05:41,297 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-12 10:05:41,343 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 120 transitions, 255 flow [2022-07-12 10:05:41,401 INFO L129 PetriNetUnfolder]: 2/117 cut-off events. [2022-07-12 10:05:41,402 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-12 10:05:41,405 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2022-07-12 10:05:41,405 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 120 transitions, 255 flow [2022-07-12 10:05:41,410 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 117 transitions, 243 flow [2022-07-12 10:05:41,428 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:05:41,436 INFO L357 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, mAutomataTypeConcurrency=PETRI_NET, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@347d7d1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@81c16f8 [2022-07-12 10:05:41,436 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-12 10:05:41,453 INFO L129 PetriNetUnfolder]: 0/65 cut-off events. [2022-07-12 10:05:41,453 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-12 10:05:41,454 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:41,454 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:05:41,455 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:05:41,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:41,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1057251517, now seen corresponding path program 1 times [2022-07-12 10:05:41,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:41,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788932728] [2022-07-12 10:05:41,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:41,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:41,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:05:41,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:41,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788932728] [2022-07-12 10:05:41,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788932728] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:41,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:41,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 10:05:41,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541823365] [2022-07-12 10:05:41,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:41,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:05:41,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:41,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:05:41,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:05:41,834 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 120 [2022-07-12 10:05:41,839 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 117 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 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) [2022-07-12 10:05:41,840 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:41,840 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 120 [2022-07-12 10:05:41,841 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:42,019 INFO L129 PetriNetUnfolder]: 37/298 cut-off events. [2022-07-12 10:05:42,020 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-07-12 10:05:42,022 INFO L84 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 298 events. 37/298 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1161 event pairs, 19 based on Foata normal form. 10/289 useless extension candidates. Maximal degree in co-relation 336. Up to 51 conditions per place. [2022-07-12 10:05:42,026 INFO L132 encePairwiseOnDemand]: 115/120 looper letters, 11 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2022-07-12 10:05:42,026 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 117 transitions, 272 flow [2022-07-12 10:05:42,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:05:42,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:05:42,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2022-07-12 10:05:42,043 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9416666666666667 [2022-07-12 10:05:42,044 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2022-07-12 10:05:42,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2022-07-12 10:05:42,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:42,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2022-07-12 10:05:42,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 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) [2022-07-12 10:05:42,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 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) [2022-07-12 10:05:42,058 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 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) [2022-07-12 10:05:42,059 INFO L186 Difference]: Start difference. First operand has 125 places, 117 transitions, 243 flow. Second operand 3 states and 339 transitions. [2022-07-12 10:05:42,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 117 transitions, 272 flow [2022-07-12 10:05:42,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 117 transitions, 268 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-12 10:05:42,066 INFO L242 Difference]: Finished difference. Result has 122 places, 113 transitions, 236 flow [2022-07-12 10:05:42,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=122, PETRI_TRANSITIONS=113} [2022-07-12 10:05:42,072 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, -3 predicate places. [2022-07-12 10:05:42,073 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 113 transitions, 236 flow [2022-07-12 10:05:42,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 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) [2022-07-12 10:05:42,073 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:42,074 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:05:42,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:05:42,074 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:05:42,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:42,075 INFO L85 PathProgramCache]: Analyzing trace with hash -233584859, now seen corresponding path program 1 times [2022-07-12 10:05:42,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:42,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479046604] [2022-07-12 10:05:42,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:42,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:42,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:05:42,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:42,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479046604] [2022-07-12 10:05:42,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479046604] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:42,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:42,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:05:42,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430852844] [2022-07-12 10:05:42,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:42,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:05:42,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:42,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:05:42,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:05:42,398 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120 [2022-07-12 10:05:42,399 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 113 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 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) [2022-07-12 10:05:42,399 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:42,403 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120 [2022-07-12 10:05:42,403 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:43,418 INFO L129 PetriNetUnfolder]: 1698/4149 cut-off events. [2022-07-12 10:05:43,418 INFO L130 PetriNetUnfolder]: For 162/162 co-relation queries the response was YES. [2022-07-12 10:05:43,430 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6936 conditions, 4149 events. 1698/4149 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 34259 event pairs, 232 based on Foata normal form. 0/4044 useless extension candidates. Maximal degree in co-relation 6877. Up to 950 conditions per place. [2022-07-12 10:05:43,442 INFO L132 encePairwiseOnDemand]: 108/120 looper letters, 32 selfloop transitions, 8 changer transitions 84/201 dead transitions. [2022-07-12 10:05:43,443 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 201 transitions, 652 flow [2022-07-12 10:05:43,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:05:43,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-12 10:05:43,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1299 transitions. [2022-07-12 10:05:43,448 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8326923076923077 [2022-07-12 10:05:43,448 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1299 transitions. [2022-07-12 10:05:43,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1299 transitions. [2022-07-12 10:05:43,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:43,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1299 transitions. [2022-07-12 10:05:43,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 99.92307692307692) internal successors, (1299), 13 states have internal predecessors, (1299), 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) [2022-07-12 10:05:43,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 120.0) internal successors, (1680), 14 states have internal predecessors, (1680), 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) [2022-07-12 10:05:43,458 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 120.0) internal successors, (1680), 14 states have internal predecessors, (1680), 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) [2022-07-12 10:05:43,458 INFO L186 Difference]: Start difference. First operand has 122 places, 113 transitions, 236 flow. Second operand 13 states and 1299 transitions. [2022-07-12 10:05:43,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 201 transitions, 652 flow [2022-07-12 10:05:43,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 201 transitions, 634 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-12 10:05:43,462 INFO L242 Difference]: Finished difference. Result has 144 places, 105 transitions, 302 flow [2022-07-12 10:05:43,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=302, PETRI_PLACES=144, PETRI_TRANSITIONS=105} [2022-07-12 10:05:43,464 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, 19 predicate places. [2022-07-12 10:05:43,464 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 105 transitions, 302 flow [2022-07-12 10:05:43,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 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) [2022-07-12 10:05:43,465 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:43,465 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:05:43,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 10:05:43,465 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:05:43,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:43,466 INFO L85 PathProgramCache]: Analyzing trace with hash 2138764519, now seen corresponding path program 1 times [2022-07-12 10:05:43,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:43,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179754778] [2022-07-12 10:05:43,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:43,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:43,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:05:43,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:43,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179754778] [2022-07-12 10:05:43,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179754778] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:43,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:43,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:05:43,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581156125] [2022-07-12 10:05:43,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:43,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:05:43,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:43,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:05:43,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:05:43,596 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 120 [2022-07-12 10:05:43,598 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 105 transitions, 302 flow. Second operand has 6 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 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) [2022-07-12 10:05:43,598 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:43,598 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 120 [2022-07-12 10:05:43,599 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:44,122 INFO L129 PetriNetUnfolder]: 722/1652 cut-off events. [2022-07-12 10:05:44,122 INFO L130 PetriNetUnfolder]: For 3220/3304 co-relation queries the response was YES. [2022-07-12 10:05:44,131 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4902 conditions, 1652 events. 722/1652 cut-off events. For 3220/3304 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 10943 event pairs, 339 based on Foata normal form. 73/1626 useless extension candidates. Maximal degree in co-relation 4831. Up to 558 conditions per place. [2022-07-12 10:05:44,138 INFO L132 encePairwiseOnDemand]: 114/120 looper letters, 21 selfloop transitions, 3 changer transitions 37/148 dead transitions. [2022-07-12 10:05:44,139 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 148 transitions, 614 flow [2022-07-12 10:05:44,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:05:44,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:05:44,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 946 transitions. [2022-07-12 10:05:44,143 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8759259259259259 [2022-07-12 10:05:44,143 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 946 transitions. [2022-07-12 10:05:44,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 946 transitions. [2022-07-12 10:05:44,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:44,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 946 transitions. [2022-07-12 10:05:44,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 105.11111111111111) internal successors, (946), 9 states have internal predecessors, (946), 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) [2022-07-12 10:05:44,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 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) [2022-07-12 10:05:44,151 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 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) [2022-07-12 10:05:44,152 INFO L186 Difference]: Start difference. First operand has 144 places, 105 transitions, 302 flow. Second operand 9 states and 946 transitions. [2022-07-12 10:05:44,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 148 transitions, 614 flow [2022-07-12 10:05:44,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 148 transitions, 584 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-07-12 10:05:44,172 INFO L242 Difference]: Finished difference. Result has 134 places, 105 transitions, 311 flow [2022-07-12 10:05:44,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=311, PETRI_PLACES=134, PETRI_TRANSITIONS=105} [2022-07-12 10:05:44,174 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, 9 predicate places. [2022-07-12 10:05:44,174 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 105 transitions, 311 flow [2022-07-12 10:05:44,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 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) [2022-07-12 10:05:44,175 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:44,175 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:05:44,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 10:05:44,176 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:05:44,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:44,177 INFO L85 PathProgramCache]: Analyzing trace with hash -408494551, now seen corresponding path program 1 times [2022-07-12 10:05:44,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:44,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997168125] [2022-07-12 10:05:44,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:44,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:44,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:05:44,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:44,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997168125] [2022-07-12 10:05:44,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997168125] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:44,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:44,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:05:44,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404931649] [2022-07-12 10:05:44,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:44,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:05:44,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:44,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:05:44,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:05:44,371 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 120 [2022-07-12 10:05:44,372 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 105 transitions, 311 flow. Second operand has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 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) [2022-07-12 10:05:44,372 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:44,372 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 120 [2022-07-12 10:05:44,372 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:45,194 INFO L129 PetriNetUnfolder]: 1734/3601 cut-off events. [2022-07-12 10:05:45,195 INFO L130 PetriNetUnfolder]: For 3695/4821 co-relation queries the response was YES. [2022-07-12 10:05:45,209 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8445 conditions, 3601 events. 1734/3601 cut-off events. For 3695/4821 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 27484 event pairs, 218 based on Foata normal form. 61/3427 useless extension candidates. Maximal degree in co-relation 8369. Up to 996 conditions per place. [2022-07-12 10:05:45,220 INFO L132 encePairwiseOnDemand]: 110/120 looper letters, 43 selfloop transitions, 9 changer transitions 35/172 dead transitions. [2022-07-12 10:05:45,220 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 172 transitions, 707 flow [2022-07-12 10:05:45,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:05:45,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-12 10:05:45,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1051 transitions. [2022-07-12 10:05:45,224 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8758333333333334 [2022-07-12 10:05:45,224 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1051 transitions. [2022-07-12 10:05:45,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1051 transitions. [2022-07-12 10:05:45,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:45,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1051 transitions. [2022-07-12 10:05:45,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 105.1) internal successors, (1051), 10 states have internal predecessors, (1051), 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) [2022-07-12 10:05:45,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 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) [2022-07-12 10:05:45,233 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 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) [2022-07-12 10:05:45,233 INFO L186 Difference]: Start difference. First operand has 134 places, 105 transitions, 311 flow. Second operand 10 states and 1051 transitions. [2022-07-12 10:05:45,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 172 transitions, 707 flow [2022-07-12 10:05:45,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 172 transitions, 683 flow, removed 9 selfloop flow, removed 11 redundant places. [2022-07-12 10:05:45,241 INFO L242 Difference]: Finished difference. Result has 133 places, 112 transitions, 368 flow [2022-07-12 10:05:45,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=368, PETRI_PLACES=133, PETRI_TRANSITIONS=112} [2022-07-12 10:05:45,242 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, 8 predicate places. [2022-07-12 10:05:45,242 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 112 transitions, 368 flow [2022-07-12 10:05:45,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 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) [2022-07-12 10:05:45,242 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:45,243 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:05:45,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 10:05:45,243 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:05:45,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:45,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1833589534, now seen corresponding path program 1 times [2022-07-12 10:05:45,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:45,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946988830] [2022-07-12 10:05:45,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:45,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:45,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:05:45,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:45,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946988830] [2022-07-12 10:05:45,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946988830] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:45,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:45,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:05:45,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363930054] [2022-07-12 10:05:45,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:45,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:05:45,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:45,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:05:45,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:05:45,346 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 120 [2022-07-12 10:05:45,347 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 112 transitions, 368 flow. Second operand has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 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) [2022-07-12 10:05:45,347 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:45,347 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 120 [2022-07-12 10:05:45,347 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:45,987 INFO L129 PetriNetUnfolder]: 1003/2375 cut-off events. [2022-07-12 10:05:45,988 INFO L130 PetriNetUnfolder]: For 4120/4985 co-relation queries the response was YES. [2022-07-12 10:05:46,023 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7327 conditions, 2375 events. 1003/2375 cut-off events. For 4120/4985 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 18651 event pairs, 77 based on Foata normal form. 119/2384 useless extension candidates. Maximal degree in co-relation 7252. Up to 521 conditions per place. [2022-07-12 10:05:46,029 INFO L132 encePairwiseOnDemand]: 110/120 looper letters, 57 selfloop transitions, 20 changer transitions 34/196 dead transitions. [2022-07-12 10:05:46,030 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 196 transitions, 1036 flow [2022-07-12 10:05:46,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:05:46,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-12 10:05:46,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1363 transitions. [2022-07-12 10:05:46,034 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8737179487179487 [2022-07-12 10:05:46,034 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1363 transitions. [2022-07-12 10:05:46,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1363 transitions. [2022-07-12 10:05:46,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:46,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1363 transitions. [2022-07-12 10:05:46,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 104.84615384615384) internal successors, (1363), 13 states have internal predecessors, (1363), 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) [2022-07-12 10:05:46,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 120.0) internal successors, (1680), 14 states have internal predecessors, (1680), 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) [2022-07-12 10:05:46,041 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 120.0) internal successors, (1680), 14 states have internal predecessors, (1680), 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) [2022-07-12 10:05:46,042 INFO L186 Difference]: Start difference. First operand has 133 places, 112 transitions, 368 flow. Second operand 13 states and 1363 transitions. [2022-07-12 10:05:46,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 196 transitions, 1036 flow [2022-07-12 10:05:46,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 196 transitions, 1026 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-07-12 10:05:46,055 INFO L242 Difference]: Finished difference. Result has 146 places, 127 transitions, 556 flow [2022-07-12 10:05:46,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=556, PETRI_PLACES=146, PETRI_TRANSITIONS=127} [2022-07-12 10:05:46,056 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, 21 predicate places. [2022-07-12 10:05:46,056 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 127 transitions, 556 flow [2022-07-12 10:05:46,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 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) [2022-07-12 10:05:46,057 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:46,057 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:05:46,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 10:05:46,058 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:05:46,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:46,058 INFO L85 PathProgramCache]: Analyzing trace with hash 362127265, now seen corresponding path program 1 times [2022-07-12 10:05:46,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:46,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065982201] [2022-07-12 10:05:46,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:46,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:46,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:05:46,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:46,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065982201] [2022-07-12 10:05:46,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065982201] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:46,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:46,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:05:46,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580113489] [2022-07-12 10:05:46,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:46,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:05:46,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:46,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:05:46,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:05:46,241 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 120 [2022-07-12 10:05:46,242 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 127 transitions, 556 flow. Second operand has 8 states, 8 states have (on average 98.875) internal successors, (791), 8 states have internal predecessors, (791), 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) [2022-07-12 10:05:46,242 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:46,242 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 120 [2022-07-12 10:05:46,242 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:46,929 INFO L129 PetriNetUnfolder]: 897/2058 cut-off events. [2022-07-12 10:05:46,930 INFO L130 PetriNetUnfolder]: For 5940/6763 co-relation queries the response was YES. [2022-07-12 10:05:46,942 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7386 conditions, 2058 events. 897/2058 cut-off events. For 5940/6763 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 16003 event pairs, 80 based on Foata normal form. 86/2018 useless extension candidates. Maximal degree in co-relation 7305. Up to 429 conditions per place. [2022-07-12 10:05:46,948 INFO L132 encePairwiseOnDemand]: 110/120 looper letters, 43 selfloop transitions, 24 changer transitions 39/191 dead transitions. [2022-07-12 10:05:46,948 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 191 transitions, 1116 flow [2022-07-12 10:05:46,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 10:05:46,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-12 10:05:46,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1643 transitions. [2022-07-12 10:05:46,953 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8557291666666667 [2022-07-12 10:05:46,953 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1643 transitions. [2022-07-12 10:05:46,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1643 transitions. [2022-07-12 10:05:46,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:46,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1643 transitions. [2022-07-12 10:05:46,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 102.6875) internal successors, (1643), 16 states have internal predecessors, (1643), 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) [2022-07-12 10:05:46,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 120.0) internal successors, (2040), 17 states have internal predecessors, (2040), 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) [2022-07-12 10:05:46,963 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 120.0) internal successors, (2040), 17 states have internal predecessors, (2040), 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) [2022-07-12 10:05:46,963 INFO L186 Difference]: Start difference. First operand has 146 places, 127 transitions, 556 flow. Second operand 16 states and 1643 transitions. [2022-07-12 10:05:46,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 191 transitions, 1116 flow [2022-07-12 10:05:46,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 191 transitions, 1040 flow, removed 31 selfloop flow, removed 5 redundant places. [2022-07-12 10:05:46,998 INFO L242 Difference]: Finished difference. Result has 163 places, 128 transitions, 574 flow [2022-07-12 10:05:46,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=574, PETRI_PLACES=163, PETRI_TRANSITIONS=128} [2022-07-12 10:05:47,000 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, 38 predicate places. [2022-07-12 10:05:47,000 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 128 transitions, 574 flow [2022-07-12 10:05:47,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.875) internal successors, (791), 8 states have internal predecessors, (791), 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) [2022-07-12 10:05:47,000 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:47,001 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:05:47,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 10:05:47,001 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:05:47,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:47,002 INFO L85 PathProgramCache]: Analyzing trace with hash -614032836, now seen corresponding path program 1 times [2022-07-12 10:05:47,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:47,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804795930] [2022-07-12 10:05:47,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:47,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:47,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:05:47,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:47,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804795930] [2022-07-12 10:05:47,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804795930] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:47,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:47,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:05:47,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897295146] [2022-07-12 10:05:47,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:47,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:05:47,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:47,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:05:47,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:05:47,209 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 120 [2022-07-12 10:05:47,210 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 128 transitions, 574 flow. Second operand has 7 states, 7 states have (on average 99.57142857142857) internal successors, (697), 7 states have internal predecessors, (697), 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) [2022-07-12 10:05:47,210 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:47,210 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 120 [2022-07-12 10:05:47,210 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:47,530 INFO L129 PetriNetUnfolder]: 266/1590 cut-off events. [2022-07-12 10:05:47,530 INFO L130 PetriNetUnfolder]: For 4380/4678 co-relation queries the response was YES. [2022-07-12 10:05:47,542 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4906 conditions, 1590 events. 266/1590 cut-off events. For 4380/4678 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 15927 event pairs, 24 based on Foata normal form. 1/1477 useless extension candidates. Maximal degree in co-relation 4822. Up to 217 conditions per place. [2022-07-12 10:05:47,546 INFO L132 encePairwiseOnDemand]: 114/120 looper letters, 22 selfloop transitions, 1 changer transitions 14/145 dead transitions. [2022-07-12 10:05:47,546 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 145 transitions, 712 flow [2022-07-12 10:05:47,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:05:47,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-12 10:05:47,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 713 transitions. [2022-07-12 10:05:47,548 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8488095238095238 [2022-07-12 10:05:47,548 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 713 transitions. [2022-07-12 10:05:47,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 713 transitions. [2022-07-12 10:05:47,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:47,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 713 transitions. [2022-07-12 10:05:47,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.85714285714286) internal successors, (713), 7 states have internal predecessors, (713), 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) [2022-07-12 10:05:47,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 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) [2022-07-12 10:05:47,553 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 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) [2022-07-12 10:05:47,553 INFO L186 Difference]: Start difference. First operand has 163 places, 128 transitions, 574 flow. Second operand 7 states and 713 transitions. [2022-07-12 10:05:47,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 145 transitions, 712 flow [2022-07-12 10:05:47,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 145 transitions, 605 flow, removed 34 selfloop flow, removed 15 redundant places. [2022-07-12 10:05:47,598 INFO L242 Difference]: Finished difference. Result has 156 places, 128 transitions, 494 flow [2022-07-12 10:05:47,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=494, PETRI_PLACES=156, PETRI_TRANSITIONS=128} [2022-07-12 10:05:47,599 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, 31 predicate places. [2022-07-12 10:05:47,600 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 128 transitions, 494 flow [2022-07-12 10:05:47,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.57142857142857) internal successors, (697), 7 states have internal predecessors, (697), 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) [2022-07-12 10:05:47,601 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:47,601 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:05:47,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 10:05:47,601 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:05:47,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:47,602 INFO L85 PathProgramCache]: Analyzing trace with hash 573088824, now seen corresponding path program 2 times [2022-07-12 10:05:47,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:47,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165375672] [2022-07-12 10:05:47,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:47,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:47,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:05:47,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:47,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165375672] [2022-07-12 10:05:47,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165375672] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:47,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:47,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 10:05:47,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542239396] [2022-07-12 10:05:47,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:47,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:05:47,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:47,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:05:47,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:05:47,875 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 120 [2022-07-12 10:05:47,876 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 128 transitions, 494 flow. Second operand has 10 states, 10 states have (on average 96.1) internal successors, (961), 10 states have internal predecessors, (961), 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) [2022-07-12 10:05:47,876 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:47,876 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 120 [2022-07-12 10:05:47,877 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:48,229 INFO L129 PetriNetUnfolder]: 207/1430 cut-off events. [2022-07-12 10:05:48,229 INFO L130 PetriNetUnfolder]: For 1664/1707 co-relation queries the response was YES. [2022-07-12 10:05:48,237 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3615 conditions, 1430 events. 207/1430 cut-off events. For 1664/1707 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 14164 event pairs, 5 based on Foata normal form. 4/1354 useless extension candidates. Maximal degree in co-relation 3589. Up to 178 conditions per place. [2022-07-12 10:05:48,240 INFO L132 encePairwiseOnDemand]: 111/120 looper letters, 21 selfloop transitions, 5 changer transitions 12/144 dead transitions. [2022-07-12 10:05:48,241 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 144 transitions, 624 flow [2022-07-12 10:05:48,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:05:48,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-12 10:05:48,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 977 transitions. [2022-07-12 10:05:48,244 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8141666666666667 [2022-07-12 10:05:48,244 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 977 transitions. [2022-07-12 10:05:48,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 977 transitions. [2022-07-12 10:05:48,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:48,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 977 transitions. [2022-07-12 10:05:48,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.7) internal successors, (977), 10 states have internal predecessors, (977), 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) [2022-07-12 10:05:48,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 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) [2022-07-12 10:05:48,250 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 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) [2022-07-12 10:05:48,250 INFO L186 Difference]: Start difference. First operand has 156 places, 128 transitions, 494 flow. Second operand 10 states and 977 transitions. [2022-07-12 10:05:48,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 144 transitions, 624 flow [2022-07-12 10:05:48,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 144 transitions, 598 flow, removed 9 selfloop flow, removed 7 redundant places. [2022-07-12 10:05:48,275 INFO L242 Difference]: Finished difference. Result has 161 places, 129 transitions, 505 flow [2022-07-12 10:05:48,276 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=505, PETRI_PLACES=161, PETRI_TRANSITIONS=129} [2022-07-12 10:05:48,276 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, 36 predicate places. [2022-07-12 10:05:48,277 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 129 transitions, 505 flow [2022-07-12 10:05:48,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 96.1) internal successors, (961), 10 states have internal predecessors, (961), 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) [2022-07-12 10:05:48,277 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:48,277 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:05:48,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 10:05:48,278 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:05:48,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:48,279 INFO L85 PathProgramCache]: Analyzing trace with hash 391574014, now seen corresponding path program 3 times [2022-07-12 10:05:48,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:48,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061106927] [2022-07-12 10:05:48,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:48,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:05:48,323 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 10:05:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:05:48,422 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 10:05:48,422 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 10:05:48,423 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-07-12 10:05:48,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-07-12 10:05:48,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-07-12 10:05:48,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-07-12 10:05:48,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-07-12 10:05:48,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-07-12 10:05:48,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 10:05:48,427 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2022-07-12 10:05:48,433 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-12 10:05:48,433 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 10:05:48,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 10:05:48 BasicIcfg [2022-07-12 10:05:48,613 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 10:05:48,613 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 10:05:48,614 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 10:05:48,614 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 10:05:48,614 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:05:41" (3/4) ... [2022-07-12 10:05:48,616 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 10:05:48,749 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 10:05:48,750 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 10:05:48,751 INFO L158 Benchmark]: Toolchain (without parser) took 9317.83ms. Allocated memory was 96.5MB in the beginning and 555.7MB in the end (delta: 459.3MB). Free memory was 63.4MB in the beginning and 131.6MB in the end (delta: -68.2MB). Peak memory consumption was 390.2MB. Max. memory is 16.1GB. [2022-07-12 10:05:48,751 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 96.5MB. Free memory was 51.4MB in the beginning and 51.4MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 10:05:48,752 INFO L158 Benchmark]: CACSL2BoogieTranslator took 505.93ms. Allocated memory is still 96.5MB. Free memory was 63.2MB in the beginning and 58.4MB in the end (delta: 4.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 10:05:48,752 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.11ms. Allocated memory is still 96.5MB. Free memory was 58.4MB in the beginning and 55.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 10:05:48,752 INFO L158 Benchmark]: Boogie Preprocessor took 66.97ms. Allocated memory is still 96.5MB. Free memory was 55.8MB in the beginning and 53.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 10:05:48,753 INFO L158 Benchmark]: RCFGBuilder took 1153.75ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 53.7MB in the beginning and 84.9MB in the end (delta: -31.3MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. [2022-07-12 10:05:48,753 INFO L158 Benchmark]: TraceAbstraction took 7401.04ms. Allocated memory was 117.4MB in the beginning and 555.7MB in the end (delta: 438.3MB). Free memory was 84.9MB in the beginning and 168.3MB in the end (delta: -83.4MB). Peak memory consumption was 354.8MB. Max. memory is 16.1GB. [2022-07-12 10:05:48,753 INFO L158 Benchmark]: Witness Printer took 136.55ms. Allocated memory is still 555.7MB. Free memory was 168.3MB in the beginning and 131.6MB in the end (delta: 36.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-07-12 10:05:48,755 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.12ms. Allocated memory is still 96.5MB. Free memory was 51.4MB in the beginning and 51.4MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 505.93ms. Allocated memory is still 96.5MB. Free memory was 63.2MB in the beginning and 58.4MB in the end (delta: 4.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.11ms. Allocated memory is still 96.5MB. Free memory was 58.4MB in the beginning and 55.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.97ms. Allocated memory is still 96.5MB. Free memory was 55.8MB in the beginning and 53.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1153.75ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 53.7MB in the beginning and 84.9MB in the end (delta: -31.3MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7401.04ms. Allocated memory was 117.4MB in the beginning and 555.7MB in the end (delta: 438.3MB). Free memory was 84.9MB in the beginning and 168.3MB in the end (delta: -83.4MB). Peak memory consumption was 354.8MB. Max. memory is 16.1GB. * Witness Printer took 136.55ms. Allocated memory is still 555.7MB. Free memory was 168.3MB in the beginning and 131.6MB in the end (delta: 36.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L716] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0] [L718] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L720] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L721] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L722] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L724] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L726] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L727] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L728] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L729] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L730] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L731] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L732] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L733] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L734] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L735] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L736] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L737] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L738] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L739] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L740] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L741] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L742] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L744] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L844] 0 pthread_t t636; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t636={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] FCALL, FORK 0 pthread_create(&t636, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t636, ((void *)0), P0, ((void *)0))=7, t636={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L846] 0 pthread_t t637; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t636={5:0}, t637={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] FCALL, FORK 0 pthread_create(&t637, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t637, ((void *)0), P1, ((void *)0))=8, t636={5:0}, t637={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 1 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L848] 0 pthread_t t638; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t636={5:0}, t637={6:0}, t638={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L849] FCALL, FORK 0 pthread_create(&t638, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t638, ((void *)0), P2, ((void *)0))=9, t636={5:0}, t637={6:0}, t638={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 3 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L816] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L756] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] 1 y$mem_tmp = y [L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L763] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L764] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L764] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0) [L764] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L764] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L765] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1) [L765] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L765] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L766] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used) [L766] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L766] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L767] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L767] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L768] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L768] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1) [L768] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L768] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L769] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L769] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L769] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L769] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 __unbuffered_p0_EBX = y [L771] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L771] 1 y = y$flush_delayed ? y$mem_tmp : y [L772] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L799] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t636={5:0}, t637={6:0}, t638={3:0}, weak$$choice0=1, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L862] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t636={5:0}, t637={6:0}, t638={3:0}, weak$$choice0=1, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L864] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 149 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 455 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 455 mSDsluCounter, 363 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 687 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 904 IncrementalHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 75 mSDtfsCounter, 904 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=574occurred in iteration=6, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 753 NumberOfCodeBlocks, 753 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 651 ConstructedInterpolants, 0 QuantifiedInterpolants, 2557 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-12 10:05:48,808 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE