./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.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/rfi000_power.oepc_pso.oepc_rmo.oepc.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 be50e7e5241b29f4a9e868e4f8ec6ed8a757d2cee90daca598ed21c4a5ee9d77 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:08:19,283 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:08:19,285 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:08:19,330 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:08:19,330 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:08:19,332 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:08:19,333 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:08:19,334 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:08:19,336 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:08:19,336 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:08:19,337 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:08:19,338 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:08:19,338 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:08:19,339 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:08:19,340 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:08:19,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:08:19,341 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:08:19,342 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:08:19,343 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:08:19,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:08:19,347 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:08:19,349 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:08:19,350 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:08:19,351 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:08:19,352 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:08:19,363 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:08:19,363 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:08:19,363 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:08:19,365 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:08:19,365 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:08:19,366 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:08:19,366 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:08:19,368 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:08:19,368 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:08:19,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:08:19,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:08:19,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:08:19,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:08:19,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:08:19,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:08:19,372 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:08:19,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:08:19,375 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:08:19,391 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:08:19,392 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:08:19,392 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:08:19,392 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:08:19,393 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:08:19,393 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:08:19,393 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:08:19,394 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:08:19,394 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:08:19,394 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:08:19,394 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 10:08:19,394 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:08:19,394 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 10:08:19,395 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:08:19,395 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:08:19,395 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:08:19,395 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:08:19,395 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 10:08:19,395 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:08:19,396 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:08:19,396 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:08:19,396 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:08:19,396 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:08:19,396 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:08:19,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:08:19,397 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:08:19,397 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:08:19,397 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:08:19,397 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:08:19,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:08:19,398 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:08:19,398 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:08:19,398 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:08:19,398 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 -> be50e7e5241b29f4a9e868e4f8ec6ed8a757d2cee90daca598ed21c4a5ee9d77 [2022-07-12 10:08:19,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:08:19,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:08:19,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:08:19,659 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:08:19,660 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:08:19,661 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i [2022-07-12 10:08:19,726 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1ff22925/7401135d3a014de4a55fb21dc204025b/FLAG3b6cc9247 [2022-07-12 10:08:20,166 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:08:20,167 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i [2022-07-12 10:08:20,199 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1ff22925/7401135d3a014de4a55fb21dc204025b/FLAG3b6cc9247 [2022-07-12 10:08:20,536 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1ff22925/7401135d3a014de4a55fb21dc204025b [2022-07-12 10:08:20,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:08:20,540 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:08:20,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:08:20,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:08:20,545 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:08:20,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:08:20" (1/1) ... [2022-07-12 10:08:20,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dd2eab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:08:20, skipping insertion in model container [2022-07-12 10:08:20,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:08:20" (1/1) ... [2022-07-12 10:08:20,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:08:20,615 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:08:20,778 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/rfi000_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-07-12 10:08:20,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:08:20,980 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:08:20,993 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/rfi000_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-07-12 10:08:21,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:08:21,117 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:08:21,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:08:21 WrapperNode [2022-07-12 10:08:21,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:08:21,120 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:08:21,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:08:21,120 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:08:21,126 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:08:21" (1/1) ... [2022-07-12 10:08:21,160 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:08:21" (1/1) ... [2022-07-12 10:08:21,202 INFO L137 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 260 [2022-07-12 10:08:21,206 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:08:21,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:08:21,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:08:21,207 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:08:21,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:08:21" (1/1) ... [2022-07-12 10:08:21,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:08:21" (1/1) ... [2022-07-12 10:08:21,228 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:08:21" (1/1) ... [2022-07-12 10:08:21,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:08:21" (1/1) ... [2022-07-12 10:08:21,246 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:08:21" (1/1) ... [2022-07-12 10:08:21,263 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:08:21" (1/1) ... [2022-07-12 10:08:21,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:08:21" (1/1) ... [2022-07-12 10:08:21,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:08:21,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:08:21,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:08:21,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:08:21,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:08:21" (1/1) ... [2022-07-12 10:08:21,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:08:21,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:08:21,322 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:08:21,328 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:08:21,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:08:21,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-12 10:08:21,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:08:21,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:08:21,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:08:21,360 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-12 10:08:21,361 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-12 10:08:21,361 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-12 10:08:21,361 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-12 10:08:21,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:08:21,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-12 10:08:21,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:08:21,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:08:21,363 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:08:21,473 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:08:21,475 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:08:22,195 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:08:22,675 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:08:22,675 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 10:08:22,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:08:22 BoogieIcfgContainer [2022-07-12 10:08:22,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:08:22,682 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:08:22,682 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:08:22,685 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:08:22,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:08:20" (1/3) ... [2022-07-12 10:08:22,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a12f8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:08:22, skipping insertion in model container [2022-07-12 10:08:22,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:08:21" (2/3) ... [2022-07-12 10:08:22,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a12f8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:08:22, skipping insertion in model container [2022-07-12 10:08:22,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:08:22" (3/3) ... [2022-07-12 10:08:22,689 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi000_power.oepc_pso.oepc_rmo.oepc.i [2022-07-12 10:08:22,694 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-12 10:08:22,702 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:08:22,703 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-12 10:08:22,703 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-12 10:08:22,773 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-12 10:08:22,820 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 97 transitions, 204 flow [2022-07-12 10:08:22,864 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2022-07-12 10:08:22,865 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-12 10:08:22,869 INFO L84 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2022-07-12 10:08:22,870 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 97 transitions, 204 flow [2022-07-12 10:08:22,875 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 95 transitions, 196 flow [2022-07-12 10:08:22,894 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:08:22,901 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@24f00cd1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@64db532c [2022-07-12 10:08:22,902 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-07-12 10:08:22,919 INFO L129 PetriNetUnfolder]: 0/44 cut-off events. [2022-07-12 10:08:22,920 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-12 10:08:22,920 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:08:22,921 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] [2022-07-12 10:08:22,921 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-12 10:08:22,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:08:22,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1008367873, now seen corresponding path program 1 times [2022-07-12 10:08:22,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:08:22,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920698426] [2022-07-12 10:08:22,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:08:22,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:08:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:08:23,158 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:08:23,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:08:23,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920698426] [2022-07-12 10:08:23,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920698426] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:08:23,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:08:23,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 10:08:23,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991366652] [2022-07-12 10:08:23,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:08:23,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:08:23,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:08:23,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:08:23,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:08:23,200 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 97 [2022-07-12 10:08:23,205 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 95 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 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:08:23,205 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:08:23,206 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 97 [2022-07-12 10:08:23,207 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:08:23,411 INFO L129 PetriNetUnfolder]: 42/262 cut-off events. [2022-07-12 10:08:23,412 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-12 10:08:23,413 INFO L84 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 262 events. 42/262 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 975 event pairs, 6 based on Foata normal form. 12/259 useless extension candidates. Maximal degree in co-relation 308. Up to 63 conditions per place. [2022-07-12 10:08:23,416 INFO L132 encePairwiseOnDemand]: 92/97 looper letters, 14 selfloop transitions, 2 changer transitions 0/97 dead transitions. [2022-07-12 10:08:23,416 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 97 transitions, 235 flow [2022-07-12 10:08:23,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:08:23,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:08:23,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2022-07-12 10:08:23,429 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9278350515463918 [2022-07-12 10:08:23,429 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 270 transitions. [2022-07-12 10:08:23,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 270 transitions. [2022-07-12 10:08:23,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:08:23,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 270 transitions. [2022-07-12 10:08:23,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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:08:23,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 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:08:23,442 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 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:08:23,449 INFO L186 Difference]: Start difference. First operand has 100 places, 95 transitions, 196 flow. Second operand 3 states and 270 transitions. [2022-07-12 10:08:23,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 97 transitions, 235 flow [2022-07-12 10:08:23,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 97 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-12 10:08:23,461 INFO L242 Difference]: Finished difference. Result has 98 places, 91 transitions, 190 flow [2022-07-12 10:08:23,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=98, PETRI_TRANSITIONS=91} [2022-07-12 10:08:23,467 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -2 predicate places. [2022-07-12 10:08:23,469 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 91 transitions, 190 flow [2022-07-12 10:08:23,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 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:08:23,470 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:08:23,471 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] [2022-07-12 10:08:23,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:08:23,471 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-12 10:08:23,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:08:23,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1520759035, now seen corresponding path program 1 times [2022-07-12 10:08:23,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:08:23,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777041960] [2022-07-12 10:08:23,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:08:23,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:08:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:08:23,680 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:08:23,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:08:23,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777041960] [2022-07-12 10:08:23,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777041960] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:08:23,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:08:23,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:08:23,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115385759] [2022-07-12 10:08:23,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:08:23,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:08:23,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:08:23,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:08:23,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:08:23,685 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 97 [2022-07-12 10:08:23,686 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 91 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 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:08:23,686 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:08:23,687 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 97 [2022-07-12 10:08:23,687 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:08:24,113 INFO L129 PetriNetUnfolder]: 173/622 cut-off events. [2022-07-12 10:08:24,113 INFO L130 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-07-12 10:08:24,118 INFO L84 FinitePrefix]: Finished finitePrefix Result has 997 conditions, 622 events. 173/622 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3497 event pairs, 40 based on Foata normal form. 0/600 useless extension candidates. Maximal degree in co-relation 948. Up to 166 conditions per place. [2022-07-12 10:08:24,121 INFO L132 encePairwiseOnDemand]: 91/97 looper letters, 16 selfloop transitions, 2 changer transitions 40/124 dead transitions. [2022-07-12 10:08:24,122 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 124 transitions, 368 flow [2022-07-12 10:08:24,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:08:24,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:08:24,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 744 transitions. [2022-07-12 10:08:24,131 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.852233676975945 [2022-07-12 10:08:24,132 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 744 transitions. [2022-07-12 10:08:24,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 744 transitions. [2022-07-12 10:08:24,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:08:24,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 744 transitions. [2022-07-12 10:08:24,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 82.66666666666667) internal successors, (744), 9 states have internal predecessors, (744), 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:08:24,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 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:08:24,142 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 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:08:24,142 INFO L186 Difference]: Start difference. First operand has 98 places, 91 transitions, 190 flow. Second operand 9 states and 744 transitions. [2022-07-12 10:08:24,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 124 transitions, 368 flow [2022-07-12 10:08:24,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 124 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-12 10:08:24,145 INFO L242 Difference]: Finished difference. Result has 111 places, 81 transitions, 186 flow [2022-07-12 10:08:24,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=186, PETRI_PLACES=111, PETRI_TRANSITIONS=81} [2022-07-12 10:08:24,147 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 11 predicate places. [2022-07-12 10:08:24,147 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 81 transitions, 186 flow [2022-07-12 10:08:24,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 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:08:24,148 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:08:24,148 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] [2022-07-12 10:08:24,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 10:08:24,148 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-12 10:08:24,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:08:24,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1429753225, now seen corresponding path program 1 times [2022-07-12 10:08:24,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:08:24,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123531540] [2022-07-12 10:08:24,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:08:24,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:08:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:08:24,445 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:08:24,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:08:24,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123531540] [2022-07-12 10:08:24,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123531540] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:08:24,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:08:24,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:08:24,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314684649] [2022-07-12 10:08:24,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:08:24,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:08:24,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:08:24,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:08:24,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:08:24,451 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 97 [2022-07-12 10:08:24,452 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 81 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 78.83333333333333) internal successors, (473), 6 states have internal predecessors, (473), 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:08:24,452 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:08:24,452 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 97 [2022-07-12 10:08:24,452 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:08:24,738 INFO L129 PetriNetUnfolder]: 102/312 cut-off events. [2022-07-12 10:08:24,738 INFO L130 PetriNetUnfolder]: For 88/88 co-relation queries the response was YES. [2022-07-12 10:08:24,740 INFO L84 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 312 events. 102/312 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1231 event pairs, 26 based on Foata normal form. 9/308 useless extension candidates. Maximal degree in co-relation 567. Up to 92 conditions per place. [2022-07-12 10:08:24,741 INFO L132 encePairwiseOnDemand]: 91/97 looper letters, 16 selfloop transitions, 2 changer transitions 25/109 dead transitions. [2022-07-12 10:08:24,755 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 109 transitions, 346 flow [2022-07-12 10:08:24,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:08:24,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:08:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 738 transitions. [2022-07-12 10:08:24,758 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.845360824742268 [2022-07-12 10:08:24,758 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 738 transitions. [2022-07-12 10:08:24,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 738 transitions. [2022-07-12 10:08:24,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:08:24,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 738 transitions. [2022-07-12 10:08:24,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 82.0) internal successors, (738), 9 states have internal predecessors, (738), 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:08:24,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 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:08:24,763 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 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:08:24,763 INFO L186 Difference]: Start difference. First operand has 111 places, 81 transitions, 186 flow. Second operand 9 states and 738 transitions. [2022-07-12 10:08:24,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 109 transitions, 346 flow [2022-07-12 10:08:24,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 109 transitions, 314 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-07-12 10:08:24,769 INFO L242 Difference]: Finished difference. Result has 102 places, 81 transitions, 190 flow [2022-07-12 10:08:24,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=190, PETRI_PLACES=102, PETRI_TRANSITIONS=81} [2022-07-12 10:08:24,784 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 2 predicate places. [2022-07-12 10:08:24,784 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 81 transitions, 190 flow [2022-07-12 10:08:24,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.83333333333333) internal successors, (473), 6 states have internal predecessors, (473), 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:08:24,785 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:08:24,785 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] [2022-07-12 10:08:24,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 10:08:24,786 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-12 10:08:24,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:08:24,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1124563492, now seen corresponding path program 1 times [2022-07-12 10:08:24,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:08:24,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082328324] [2022-07-12 10:08:24,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:08:24,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:08:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:08:25,386 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:08:25,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:08:25,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082328324] [2022-07-12 10:08:25,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082328324] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:08:25,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:08:25,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-12 10:08:25,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890736155] [2022-07-12 10:08:25,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:08:25,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 10:08:25,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:08:25,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 10:08:25,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-07-12 10:08:25,396 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 97 [2022-07-12 10:08:25,398 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 81 transitions, 190 flow. Second operand has 16 states, 16 states have (on average 69.3125) internal successors, (1109), 16 states have internal predecessors, (1109), 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:08:25,398 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:08:25,399 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 97 [2022-07-12 10:08:25,399 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:08:25,850 INFO L129 PetriNetUnfolder]: 76/272 cut-off events. [2022-07-12 10:08:25,851 INFO L130 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2022-07-12 10:08:25,852 INFO L84 FinitePrefix]: Finished finitePrefix Result has 533 conditions, 272 events. 76/272 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 984 event pairs, 38 based on Foata normal form. 6/262 useless extension candidates. Maximal degree in co-relation 494. Up to 91 conditions per place. [2022-07-12 10:08:25,853 INFO L132 encePairwiseOnDemand]: 84/97 looper letters, 22 selfloop transitions, 10 changer transitions 19/108 dead transitions. [2022-07-12 10:08:25,853 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 108 transitions, 372 flow [2022-07-12 10:08:25,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 10:08:25,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-12 10:08:25,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1141 transitions. [2022-07-12 10:08:25,859 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7351804123711341 [2022-07-12 10:08:25,859 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1141 transitions. [2022-07-12 10:08:25,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1141 transitions. [2022-07-12 10:08:25,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:08:25,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1141 transitions. [2022-07-12 10:08:25,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 71.3125) internal successors, (1141), 16 states have internal predecessors, (1141), 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:08:25,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 97.0) internal successors, (1649), 17 states have internal predecessors, (1649), 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:08:25,870 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 97.0) internal successors, (1649), 17 states have internal predecessors, (1649), 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:08:25,870 INFO L186 Difference]: Start difference. First operand has 102 places, 81 transitions, 190 flow. Second operand 16 states and 1141 transitions. [2022-07-12 10:08:25,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 108 transitions, 372 flow [2022-07-12 10:08:25,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 108 transitions, 338 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-07-12 10:08:25,877 INFO L242 Difference]: Finished difference. Result has 111 places, 83 transitions, 219 flow [2022-07-12 10:08:25,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=219, PETRI_PLACES=111, PETRI_TRANSITIONS=83} [2022-07-12 10:08:25,880 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 11 predicate places. [2022-07-12 10:08:25,880 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 83 transitions, 219 flow [2022-07-12 10:08:25,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 69.3125) internal successors, (1109), 16 states have internal predecessors, (1109), 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:08:25,886 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:08:25,886 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] [2022-07-12 10:08:25,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 10:08:25,887 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-12 10:08:25,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:08:25,887 INFO L85 PathProgramCache]: Analyzing trace with hash -247407870, now seen corresponding path program 1 times [2022-07-12 10:08:25,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:08:25,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054287451] [2022-07-12 10:08:25,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:08:25,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:08:25,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:08:26,288 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:08:26,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:08:26,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054287451] [2022-07-12 10:08:26,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054287451] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:08:26,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:08:26,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 10:08:26,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422232341] [2022-07-12 10:08:26,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:08:26,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 10:08:26,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:08:26,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 10:08:26,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-12 10:08:26,292 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 97 [2022-07-12 10:08:26,293 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 83 transitions, 219 flow. Second operand has 13 states, 13 states have (on average 70.61538461538461) internal successors, (918), 13 states have internal predecessors, (918), 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:08:26,293 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:08:26,293 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 97 [2022-07-12 10:08:26,293 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:08:26,902 INFO L129 PetriNetUnfolder]: 102/379 cut-off events. [2022-07-12 10:08:26,902 INFO L130 PetriNetUnfolder]: For 148/148 co-relation queries the response was YES. [2022-07-12 10:08:26,904 INFO L84 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 379 events. 102/379 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1786 event pairs, 10 based on Foata normal form. 10/364 useless extension candidates. Maximal degree in co-relation 744. Up to 94 conditions per place. [2022-07-12 10:08:26,906 INFO L132 encePairwiseOnDemand]: 86/97 looper letters, 29 selfloop transitions, 9 changer transitions 26/122 dead transitions. [2022-07-12 10:08:26,907 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 122 transitions, 467 flow [2022-07-12 10:08:26,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 10:08:26,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-07-12 10:08:26,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1239 transitions. [2022-07-12 10:08:26,911 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7513644633110976 [2022-07-12 10:08:26,911 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1239 transitions. [2022-07-12 10:08:26,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1239 transitions. [2022-07-12 10:08:26,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:08:26,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1239 transitions. [2022-07-12 10:08:26,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 72.88235294117646) internal successors, (1239), 17 states have internal predecessors, (1239), 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:08:26,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 97.0) internal successors, (1746), 18 states have internal predecessors, (1746), 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:08:26,922 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 97.0) internal successors, (1746), 18 states have internal predecessors, (1746), 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:08:26,922 INFO L186 Difference]: Start difference. First operand has 111 places, 83 transitions, 219 flow. Second operand 17 states and 1239 transitions. [2022-07-12 10:08:26,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 122 transitions, 467 flow [2022-07-12 10:08:26,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 122 transitions, 416 flow, removed 18 selfloop flow, removed 13 redundant places. [2022-07-12 10:08:26,931 INFO L242 Difference]: Finished difference. Result has 120 places, 86 transitions, 253 flow [2022-07-12 10:08:26,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=253, PETRI_PLACES=120, PETRI_TRANSITIONS=86} [2022-07-12 10:08:26,934 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 20 predicate places. [2022-07-12 10:08:26,934 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 86 transitions, 253 flow [2022-07-12 10:08:26,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 70.61538461538461) internal successors, (918), 13 states have internal predecessors, (918), 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:08:26,935 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:08:26,935 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] [2022-07-12 10:08:26,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 10:08:26,936 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-12 10:08:26,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:08:26,937 INFO L85 PathProgramCache]: Analyzing trace with hash -224614746, now seen corresponding path program 2 times [2022-07-12 10:08:26,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:08:26,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003887659] [2022-07-12 10:08:26,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:08:26,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:08:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:08:27,189 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:08:27,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:08:27,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003887659] [2022-07-12 10:08:27,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003887659] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:08:27,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:08:27,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 10:08:27,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31136748] [2022-07-12 10:08:27,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:08:27,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 10:08:27,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:08:27,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 10:08:27,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:08:27,192 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 97 [2022-07-12 10:08:27,193 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 86 transitions, 253 flow. Second operand has 11 states, 11 states have (on average 73.63636363636364) internal successors, (810), 11 states have internal predecessors, (810), 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:08:27,194 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:08:27,194 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 97 [2022-07-12 10:08:27,194 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:08:27,711 INFO L129 PetriNetUnfolder]: 103/371 cut-off events. [2022-07-12 10:08:27,711 INFO L130 PetriNetUnfolder]: For 343/345 co-relation queries the response was YES. [2022-07-12 10:08:27,713 INFO L84 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 371 events. 103/371 cut-off events. For 343/345 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1738 event pairs, 8 based on Foata normal form. 7/356 useless extension candidates. Maximal degree in co-relation 824. Up to 138 conditions per place. [2022-07-12 10:08:27,715 INFO L132 encePairwiseOnDemand]: 84/97 looper letters, 27 selfloop transitions, 21 changer transitions 30/139 dead transitions. [2022-07-12 10:08:27,715 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 139 transitions, 628 flow [2022-07-12 10:08:27,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 10:08:27,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-07-12 10:08:27,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1372 transitions. [2022-07-12 10:08:27,719 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7857961053837342 [2022-07-12 10:08:27,719 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1372 transitions. [2022-07-12 10:08:27,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1372 transitions. [2022-07-12 10:08:27,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:08:27,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1372 transitions. [2022-07-12 10:08:27,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 76.22222222222223) internal successors, (1372), 18 states have internal predecessors, (1372), 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:08:27,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 97.0) internal successors, (1843), 19 states have internal predecessors, (1843), 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:08:27,727 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 97.0) internal successors, (1843), 19 states have internal predecessors, (1843), 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:08:27,727 INFO L186 Difference]: Start difference. First operand has 120 places, 86 transitions, 253 flow. Second operand 18 states and 1372 transitions. [2022-07-12 10:08:27,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 139 transitions, 628 flow [2022-07-12 10:08:27,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 139 transitions, 559 flow, removed 28 selfloop flow, removed 14 redundant places. [2022-07-12 10:08:27,732 INFO L242 Difference]: Finished difference. Result has 128 places, 102 transitions, 391 flow [2022-07-12 10:08:27,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=391, PETRI_PLACES=128, PETRI_TRANSITIONS=102} [2022-07-12 10:08:27,733 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 28 predicate places. [2022-07-12 10:08:27,734 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 102 transitions, 391 flow [2022-07-12 10:08:27,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 73.63636363636364) internal successors, (810), 11 states have internal predecessors, (810), 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:08:27,734 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:08:27,735 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] [2022-07-12 10:08:27,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 10:08:27,735 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-12 10:08:27,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:08:27,736 INFO L85 PathProgramCache]: Analyzing trace with hash 2141147442, now seen corresponding path program 3 times [2022-07-12 10:08:27,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:08:27,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762355431] [2022-07-12 10:08:27,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:08:27,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:08:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:08:28,003 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:08:28,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:08:28,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762355431] [2022-07-12 10:08:28,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762355431] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:08:28,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:08:28,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 10:08:28,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760561627] [2022-07-12 10:08:28,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:08:28,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 10:08:28,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:08:28,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 10:08:28,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-12 10:08:28,015 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 97 [2022-07-12 10:08:28,016 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 102 transitions, 391 flow. Second operand has 12 states, 12 states have (on average 73.5) internal successors, (882), 12 states have internal predecessors, (882), 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:08:28,016 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:08:28,016 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 97 [2022-07-12 10:08:28,016 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:08:28,364 INFO L129 PetriNetUnfolder]: 83/339 cut-off events. [2022-07-12 10:08:28,365 INFO L130 PetriNetUnfolder]: For 558/968 co-relation queries the response was YES. [2022-07-12 10:08:28,367 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1010 conditions, 339 events. 83/339 cut-off events. For 558/968 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1569 event pairs, 9 based on Foata normal form. 12/329 useless extension candidates. Maximal degree in co-relation 962. Up to 132 conditions per place. [2022-07-12 10:08:28,368 INFO L132 encePairwiseOnDemand]: 86/97 looper letters, 32 selfloop transitions, 20 changer transitions 20/133 dead transitions. [2022-07-12 10:08:28,369 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 133 transitions, 724 flow [2022-07-12 10:08:28,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:08:28,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-12 10:08:28,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 988 transitions. [2022-07-12 10:08:28,372 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7835051546391752 [2022-07-12 10:08:28,372 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 988 transitions. [2022-07-12 10:08:28,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 988 transitions. [2022-07-12 10:08:28,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:08:28,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 988 transitions. [2022-07-12 10:08:28,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 76.0) internal successors, (988), 13 states have internal predecessors, (988), 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:08:28,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 97.0) internal successors, (1358), 14 states have internal predecessors, (1358), 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:08:28,378 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 97.0) internal successors, (1358), 14 states have internal predecessors, (1358), 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:08:28,378 INFO L186 Difference]: Start difference. First operand has 128 places, 102 transitions, 391 flow. Second operand 13 states and 988 transitions. [2022-07-12 10:08:28,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 133 transitions, 724 flow [2022-07-12 10:08:28,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 133 transitions, 675 flow, removed 24 selfloop flow, removed 10 redundant places. [2022-07-12 10:08:28,383 INFO L242 Difference]: Finished difference. Result has 129 places, 108 transitions, 501 flow [2022-07-12 10:08:28,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=501, PETRI_PLACES=129, PETRI_TRANSITIONS=108} [2022-07-12 10:08:28,385 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 29 predicate places. [2022-07-12 10:08:28,385 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 108 transitions, 501 flow [2022-07-12 10:08:28,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 73.5) internal successors, (882), 12 states have internal predecessors, (882), 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:08:28,386 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:08:28,386 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] [2022-07-12 10:08:28,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 10:08:28,386 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-12 10:08:28,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:08:28,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1950639594, now seen corresponding path program 1 times [2022-07-12 10:08:28,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:08:28,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72073299] [2022-07-12 10:08:28,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:08:28,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:08:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:08:28,937 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:08:28,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:08:28,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72073299] [2022-07-12 10:08:28,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72073299] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:08:28,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:08:28,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-12 10:08:28,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702144308] [2022-07-12 10:08:28,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:08:28,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 10:08:28,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:08:28,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 10:08:28,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-07-12 10:08:28,941 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 97 [2022-07-12 10:08:28,942 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 108 transitions, 501 flow. Second operand has 18 states, 18 states have (on average 65.38888888888889) internal successors, (1177), 18 states have internal predecessors, (1177), 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:08:28,943 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:08:28,943 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 97 [2022-07-12 10:08:28,943 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:08:29,992 INFO L129 PetriNetUnfolder]: 258/703 cut-off events. [2022-07-12 10:08:29,992 INFO L130 PetriNetUnfolder]: For 2107/2214 co-relation queries the response was YES. [2022-07-12 10:08:29,995 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2393 conditions, 703 events. 258/703 cut-off events. For 2107/2214 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4027 event pairs, 45 based on Foata normal form. 8/695 useless extension candidates. Maximal degree in co-relation 2311. Up to 214 conditions per place. [2022-07-12 10:08:29,998 INFO L132 encePairwiseOnDemand]: 80/97 looper letters, 63 selfloop transitions, 34 changer transitions 42/192 dead transitions. [2022-07-12 10:08:29,999 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 192 transitions, 1303 flow [2022-07-12 10:08:29,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 10:08:29,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-07-12 10:08:30,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1783 transitions. [2022-07-12 10:08:30,004 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7069785884218874 [2022-07-12 10:08:30,004 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 1783 transitions. [2022-07-12 10:08:30,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 1783 transitions. [2022-07-12 10:08:30,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:08:30,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1783 transitions. [2022-07-12 10:08:30,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 68.57692307692308) internal successors, (1783), 26 states have internal predecessors, (1783), 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:08:30,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 97.0) internal successors, (2619), 27 states have internal predecessors, (2619), 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:08:30,014 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 97.0) internal successors, (2619), 27 states have internal predecessors, (2619), 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:08:30,015 INFO L186 Difference]: Start difference. First operand has 129 places, 108 transitions, 501 flow. Second operand 26 states and 1783 transitions. [2022-07-12 10:08:30,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 192 transitions, 1303 flow [2022-07-12 10:08:30,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 192 transitions, 1252 flow, removed 17 selfloop flow, removed 6 redundant places. [2022-07-12 10:08:30,025 INFO L242 Difference]: Finished difference. Result has 160 places, 124 transitions, 752 flow [2022-07-12 10:08:30,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=752, PETRI_PLACES=160, PETRI_TRANSITIONS=124} [2022-07-12 10:08:30,026 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 60 predicate places. [2022-07-12 10:08:30,026 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 124 transitions, 752 flow [2022-07-12 10:08:30,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 65.38888888888889) internal successors, (1177), 18 states have internal predecessors, (1177), 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:08:30,027 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:08:30,027 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] [2022-07-12 10:08:30,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 10:08:30,027 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-12 10:08:30,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:08:30,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1888389302, now seen corresponding path program 2 times [2022-07-12 10:08:30,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:08:30,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746053126] [2022-07-12 10:08:30,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:08:30,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:08:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:08:30,469 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:08:30,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:08:30,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746053126] [2022-07-12 10:08:30,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746053126] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:08:30,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:08:30,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 10:08:30,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834987995] [2022-07-12 10:08:30,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:08:30,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 10:08:30,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:08:30,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 10:08:30,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-07-12 10:08:30,473 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 97 [2022-07-12 10:08:30,474 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 124 transitions, 752 flow. Second operand has 15 states, 15 states have (on average 70.46666666666667) internal successors, (1057), 15 states have internal predecessors, (1057), 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:08:30,474 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:08:30,474 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 97 [2022-07-12 10:08:30,474 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:08:30,959 INFO L129 PetriNetUnfolder]: 97/406 cut-off events. [2022-07-12 10:08:30,960 INFO L130 PetriNetUnfolder]: For 3774/4637 co-relation queries the response was YES. [2022-07-12 10:08:30,963 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1860 conditions, 406 events. 97/406 cut-off events. For 3774/4637 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2066 event pairs, 11 based on Foata normal form. 24/407 useless extension candidates. Maximal degree in co-relation 1785. Up to 143 conditions per place. [2022-07-12 10:08:30,965 INFO L132 encePairwiseOnDemand]: 83/97 looper letters, 41 selfloop transitions, 38 changer transitions 0/144 dead transitions. [2022-07-12 10:08:30,966 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 144 transitions, 1197 flow [2022-07-12 10:08:30,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 10:08:30,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-07-12 10:08:30,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1221 transitions. [2022-07-12 10:08:30,969 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7404487568223166 [2022-07-12 10:08:30,969 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1221 transitions. [2022-07-12 10:08:30,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1221 transitions. [2022-07-12 10:08:30,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:08:30,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1221 transitions. [2022-07-12 10:08:30,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 71.82352941176471) internal successors, (1221), 17 states have internal predecessors, (1221), 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:08:30,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 97.0) internal successors, (1746), 18 states have internal predecessors, (1746), 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:08:30,981 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 97.0) internal successors, (1746), 18 states have internal predecessors, (1746), 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:08:30,982 INFO L186 Difference]: Start difference. First operand has 160 places, 124 transitions, 752 flow. Second operand 17 states and 1221 transitions. [2022-07-12 10:08:30,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 144 transitions, 1197 flow [2022-07-12 10:08:30,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 144 transitions, 1037 flow, removed 76 selfloop flow, removed 13 redundant places. [2022-07-12 10:08:30,998 INFO L242 Difference]: Finished difference. Result has 154 places, 136 transitions, 950 flow [2022-07-12 10:08:30,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=950, PETRI_PLACES=154, PETRI_TRANSITIONS=136} [2022-07-12 10:08:30,999 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 54 predicate places. [2022-07-12 10:08:30,999 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 136 transitions, 950 flow [2022-07-12 10:08:31,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 70.46666666666667) internal successors, (1057), 15 states have internal predecessors, (1057), 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:08:31,000 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:08:31,000 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] [2022-07-12 10:08:31,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 10:08:31,001 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-12 10:08:31,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:08:31,001 INFO L85 PathProgramCache]: Analyzing trace with hash 2056705642, now seen corresponding path program 3 times [2022-07-12 10:08:31,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:08:31,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847949789] [2022-07-12 10:08:31,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:08:31,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:08:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:08:31,493 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:08:31,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:08:31,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847949789] [2022-07-12 10:08:31,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847949789] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:08:31,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:08:31,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-12 10:08:31,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994193530] [2022-07-12 10:08:31,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:08:31,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 10:08:31,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:08:31,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 10:08:31,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-07-12 10:08:31,496 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 97 [2022-07-12 10:08:31,497 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 136 transitions, 950 flow. Second operand has 17 states, 17 states have (on average 65.47058823529412) internal successors, (1113), 17 states have internal predecessors, (1113), 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:08:31,497 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:08:31,497 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 97 [2022-07-12 10:08:31,497 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:08:32,333 INFO L129 PetriNetUnfolder]: 275/797 cut-off events. [2022-07-12 10:08:32,333 INFO L130 PetriNetUnfolder]: For 3867/4006 co-relation queries the response was YES. [2022-07-12 10:08:32,338 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3176 conditions, 797 events. 275/797 cut-off events. For 3867/4006 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4949 event pairs, 41 based on Foata normal form. 11/791 useless extension candidates. Maximal degree in co-relation 3081. Up to 250 conditions per place. [2022-07-12 10:08:32,341 INFO L132 encePairwiseOnDemand]: 80/97 looper letters, 61 selfloop transitions, 38 changer transitions 60/212 dead transitions. [2022-07-12 10:08:32,342 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 212 transitions, 1986 flow [2022-07-12 10:08:32,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 10:08:32,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-07-12 10:08:32,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1576 transitions. [2022-07-12 10:08:32,345 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7064096817570596 [2022-07-12 10:08:32,345 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1576 transitions. [2022-07-12 10:08:32,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1576 transitions. [2022-07-12 10:08:32,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:08:32,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1576 transitions. [2022-07-12 10:08:32,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 68.52173913043478) internal successors, (1576), 23 states have internal predecessors, (1576), 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:08:32,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 97.0) internal successors, (2328), 24 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:08:32,353 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 97.0) internal successors, (2328), 24 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:08:32,353 INFO L186 Difference]: Start difference. First operand has 154 places, 136 transitions, 950 flow. Second operand 23 states and 1576 transitions. [2022-07-12 10:08:32,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 212 transitions, 1986 flow [2022-07-12 10:08:32,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 212 transitions, 1800 flow, removed 78 selfloop flow, removed 7 redundant places. [2022-07-12 10:08:32,370 INFO L242 Difference]: Finished difference. Result has 183 places, 131 transitions, 945 flow [2022-07-12 10:08:32,371 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=945, PETRI_PLACES=183, PETRI_TRANSITIONS=131} [2022-07-12 10:08:32,372 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 83 predicate places. [2022-07-12 10:08:32,372 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 131 transitions, 945 flow [2022-07-12 10:08:32,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 65.47058823529412) internal successors, (1113), 17 states have internal predecessors, (1113), 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:08:32,373 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:08:32,373 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] [2022-07-12 10:08:32,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 10:08:32,373 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-12 10:08:32,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:08:32,374 INFO L85 PathProgramCache]: Analyzing trace with hash -60857311, now seen corresponding path program 1 times [2022-07-12 10:08:32,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:08:32,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531295389] [2022-07-12 10:08:32,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:08:32,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:08:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:08:32,483 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:08:32,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:08:32,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531295389] [2022-07-12 10:08:32,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531295389] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:08:32,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:08:32,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:08:32,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380031915] [2022-07-12 10:08:32,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:08:32,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:08:32,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:08:32,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:08:32,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:08:32,487 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 97 [2022-07-12 10:08:32,487 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 131 transitions, 945 flow. Second operand has 6 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 states have internal predecessors, (466), 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:08:32,487 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:08:32,487 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 97 [2022-07-12 10:08:32,488 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:08:32,690 INFO L129 PetriNetUnfolder]: 138/476 cut-off events. [2022-07-12 10:08:32,690 INFO L130 PetriNetUnfolder]: For 3165/4228 co-relation queries the response was YES. [2022-07-12 10:08:32,693 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2054 conditions, 476 events. 138/476 cut-off events. For 3165/4228 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2504 event pairs, 32 based on Foata normal form. 21/455 useless extension candidates. Maximal degree in co-relation 1963. Up to 132 conditions per place. [2022-07-12 10:08:32,695 INFO L132 encePairwiseOnDemand]: 91/97 looper letters, 19 selfloop transitions, 2 changer transitions 68/155 dead transitions. [2022-07-12 10:08:32,695 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 155 transitions, 1354 flow [2022-07-12 10:08:32,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 10:08:32,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-07-12 10:08:32,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 482 transitions. [2022-07-12 10:08:32,697 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8281786941580757 [2022-07-12 10:08:32,697 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 482 transitions. [2022-07-12 10:08:32,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 482 transitions. [2022-07-12 10:08:32,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:08:32,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 482 transitions. [2022-07-12 10:08:32,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 80.33333333333333) internal successors, (482), 6 states have internal predecessors, (482), 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:08:32,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 97.0) internal successors, (679), 7 states have internal predecessors, (679), 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:08:32,700 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 97.0) internal successors, (679), 7 states have internal predecessors, (679), 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:08:32,700 INFO L186 Difference]: Start difference. First operand has 183 places, 131 transitions, 945 flow. Second operand 6 states and 482 transitions. [2022-07-12 10:08:32,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 155 transitions, 1354 flow [2022-07-12 10:08:32,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 155 transitions, 1246 flow, removed 40 selfloop flow, removed 20 redundant places. [2022-07-12 10:08:32,715 INFO L242 Difference]: Finished difference. Result has 154 places, 85 transitions, 324 flow [2022-07-12 10:08:32,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=857, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=324, PETRI_PLACES=154, PETRI_TRANSITIONS=85} [2022-07-12 10:08:32,716 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 54 predicate places. [2022-07-12 10:08:32,716 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 85 transitions, 324 flow [2022-07-12 10:08:32,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 states have internal predecessors, (466), 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:08:32,717 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:08:32,717 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] [2022-07-12 10:08:32,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 10:08:32,717 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-12 10:08:32,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:08:32,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1917074277, now seen corresponding path program 2 times [2022-07-12 10:08:32,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:08:32,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283551946] [2022-07-12 10:08:32,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:08:32,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:08:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:08:32,826 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:08:32,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:08:32,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283551946] [2022-07-12 10:08:32,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283551946] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:08:32,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:08:32,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:08:32,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256143727] [2022-07-12 10:08:32,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:08:32,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:08:32,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:08:32,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:08:32,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:08:32,829 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 97 [2022-07-12 10:08:32,829 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 85 transitions, 324 flow. Second operand has 6 states, 6 states have (on average 76.5) internal successors, (459), 6 states have internal predecessors, (459), 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:08:32,829 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:08:32,829 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 97 [2022-07-12 10:08:32,830 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:08:33,049 INFO L129 PetriNetUnfolder]: 121/418 cut-off events. [2022-07-12 10:08:33,050 INFO L130 PetriNetUnfolder]: For 1489/1493 co-relation queries the response was YES. [2022-07-12 10:08:33,052 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1313 conditions, 418 events. 121/418 cut-off events. For 1489/1493 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1913 event pairs, 10 based on Foata normal form. 4/413 useless extension candidates. Maximal degree in co-relation 1277. Up to 74 conditions per place. [2022-07-12 10:08:33,054 INFO L132 encePairwiseOnDemand]: 88/97 looper letters, 21 selfloop transitions, 5 changer transitions 36/124 dead transitions. [2022-07-12 10:08:33,054 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 124 transitions, 736 flow [2022-07-12 10:08:33,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:08:33,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-12 10:08:33,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 804 transitions. [2022-07-12 10:08:33,056 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8288659793814434 [2022-07-12 10:08:33,056 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 804 transitions. [2022-07-12 10:08:33,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 804 transitions. [2022-07-12 10:08:33,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:08:33,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 804 transitions. [2022-07-12 10:08:33,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 80.4) internal successors, (804), 10 states have internal predecessors, (804), 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:08:33,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 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:08:33,060 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 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:08:33,060 INFO L186 Difference]: Start difference. First operand has 154 places, 85 transitions, 324 flow. Second operand 10 states and 804 transitions. [2022-07-12 10:08:33,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 124 transitions, 736 flow [2022-07-12 10:08:33,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 124 transitions, 592 flow, removed 29 selfloop flow, removed 29 redundant places. [2022-07-12 10:08:33,065 INFO L242 Difference]: Finished difference. Result has 119 places, 82 transitions, 262 flow [2022-07-12 10:08:33,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=262, PETRI_PLACES=119, PETRI_TRANSITIONS=82} [2022-07-12 10:08:33,066 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 19 predicate places. [2022-07-12 10:08:33,066 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 82 transitions, 262 flow [2022-07-12 10:08:33,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.5) internal successors, (459), 6 states have internal predecessors, (459), 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:08:33,066 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:08:33,067 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] [2022-07-12 10:08:33,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 10:08:33,067 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-12 10:08:33,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:08:33,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1462217935, now seen corresponding path program 1 times [2022-07-12 10:08:33,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:08:33,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020612028] [2022-07-12 10:08:33,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:08:33,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:08:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:08:33,162 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:08:33,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:08:33,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020612028] [2022-07-12 10:08:33,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020612028] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:08:33,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:08:33,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:08:33,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49657887] [2022-07-12 10:08:33,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:08:33,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:08:33,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:08:33,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:08:33,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:08:33,165 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 97 [2022-07-12 10:08:33,166 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 82 transitions, 262 flow. Second operand has 7 states, 7 states have (on average 76.28571428571429) internal successors, (534), 7 states have internal predecessors, (534), 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:08:33,166 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:08:33,166 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 97 [2022-07-12 10:08:33,166 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:08:33,310 INFO L129 PetriNetUnfolder]: 20/147 cut-off events. [2022-07-12 10:08:33,310 INFO L130 PetriNetUnfolder]: For 210/210 co-relation queries the response was YES. [2022-07-12 10:08:33,311 INFO L84 FinitePrefix]: Finished finitePrefix Result has 399 conditions, 147 events. 20/147 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 301 event pairs, 2 based on Foata normal form. 6/152 useless extension candidates. Maximal degree in co-relation 374. Up to 14 conditions per place. [2022-07-12 10:08:33,312 INFO L132 encePairwiseOnDemand]: 89/97 looper letters, 15 selfloop transitions, 7 changer transitions 15/99 dead transitions. [2022-07-12 10:08:33,312 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 99 transitions, 445 flow [2022-07-12 10:08:33,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:08:33,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-12 10:08:33,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 779 transitions. [2022-07-12 10:08:33,314 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8030927835051547 [2022-07-12 10:08:33,314 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 779 transitions. [2022-07-12 10:08:33,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 779 transitions. [2022-07-12 10:08:33,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:08:33,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 779 transitions. [2022-07-12 10:08:33,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 77.9) internal successors, (779), 10 states have internal predecessors, (779), 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:08:33,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 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:08:33,318 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 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:08:33,318 INFO L186 Difference]: Start difference. First operand has 119 places, 82 transitions, 262 flow. Second operand 10 states and 779 transitions. [2022-07-12 10:08:33,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 99 transitions, 445 flow [2022-07-12 10:08:33,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 99 transitions, 325 flow, removed 49 selfloop flow, removed 18 redundant places. [2022-07-12 10:08:33,322 INFO L242 Difference]: Finished difference. Result has 110 places, 82 transitions, 232 flow [2022-07-12 10:08:33,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=232, PETRI_PLACES=110, PETRI_TRANSITIONS=82} [2022-07-12 10:08:33,322 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 10 predicate places. [2022-07-12 10:08:33,322 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 82 transitions, 232 flow [2022-07-12 10:08:33,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.28571428571429) internal successors, (534), 7 states have internal predecessors, (534), 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:08:33,323 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:08:33,323 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] [2022-07-12 10:08:33,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 10:08:33,324 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-12 10:08:33,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:08:33,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1917164416, now seen corresponding path program 1 times [2022-07-12 10:08:33,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:08:33,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103757753] [2022-07-12 10:08:33,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:08:33,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:08:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:08:33,382 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 10:08:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:08:33,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 10:08:33,508 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 10:08:33,509 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-07-12 10:08:33,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-07-12 10:08:33,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-07-12 10:08:33,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-07-12 10:08:33,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-07-12 10:08:33,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 10:08:33,512 INFO L356 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1] [2022-07-12 10:08:33,519 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-12 10:08:33,519 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 10:08:33,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 10:08:33 BasicIcfg [2022-07-12 10:08:33,642 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 10:08:33,642 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 10:08:33,642 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 10:08:33,642 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 10:08:33,643 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:08:22" (3/4) ... [2022-07-12 10:08:33,644 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 10:08:33,749 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 10:08:33,749 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 10:08:33,750 INFO L158 Benchmark]: Toolchain (without parser) took 13210.55ms. Allocated memory was 117.4MB in the beginning and 297.8MB in the end (delta: 180.4MB). Free memory was 81.7MB in the beginning and 253.3MB in the end (delta: -171.6MB). Peak memory consumption was 175.0MB. Max. memory is 16.1GB. [2022-07-12 10:08:33,750 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 90.2MB. Free memory was 59.6MB in the beginning and 59.6MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 10:08:33,751 INFO L158 Benchmark]: CACSL2BoogieTranslator took 576.66ms. Allocated memory is still 117.4MB. Free memory was 81.4MB in the beginning and 78.2MB in the end (delta: 3.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 10:08:33,751 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.26ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 75.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 10:08:33,751 INFO L158 Benchmark]: Boogie Preprocessor took 64.04ms. Allocated memory is still 117.4MB. Free memory was 75.3MB in the beginning and 72.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 10:08:33,752 INFO L158 Benchmark]: RCFGBuilder took 1406.84ms. Allocated memory was 117.4MB in the beginning and 148.9MB in the end (delta: 31.5MB). Free memory was 72.6MB in the beginning and 106.9MB in the end (delta: -34.3MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. [2022-07-12 10:08:33,752 INFO L158 Benchmark]: TraceAbstraction took 10959.75ms. Allocated memory was 148.9MB in the beginning and 297.8MB in the end (delta: 148.9MB). Free memory was 106.9MB in the beginning and 107.1MB in the end (delta: -182.7kB). Peak memory consumption was 147.7MB. Max. memory is 16.1GB. [2022-07-12 10:08:33,752 INFO L158 Benchmark]: Witness Printer took 107.54ms. Allocated memory is still 297.8MB. Free memory was 107.1MB in the beginning and 253.3MB in the end (delta: -146.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-12 10:08:33,754 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.22ms. Allocated memory is still 90.2MB. Free memory was 59.6MB in the beginning and 59.6MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 576.66ms. Allocated memory is still 117.4MB. Free memory was 81.4MB in the beginning and 78.2MB in the end (delta: 3.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.26ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 75.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.04ms. Allocated memory is still 117.4MB. Free memory was 75.3MB in the beginning and 72.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1406.84ms. Allocated memory was 117.4MB in the beginning and 148.9MB in the end (delta: 31.5MB). Free memory was 72.6MB in the beginning and 106.9MB in the end (delta: -34.3MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10959.75ms. Allocated memory was 148.9MB in the beginning and 297.8MB in the end (delta: 148.9MB). Free memory was 106.9MB in the beginning and 107.1MB in the end (delta: -182.7kB). Peak memory consumption was 147.7MB. Max. memory is 16.1GB. * Witness Printer took 107.54ms. Allocated memory is still 297.8MB. Free memory was 107.1MB in the beginning and 253.3MB in the end (delta: -146.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L712] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L713] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L714] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L716] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L718] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L719] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L720] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L721] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L722] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L723] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L728] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L729] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L730] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L731] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L732] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L733] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L734] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L826] 0 pthread_t t1585; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1585={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L827] FCALL, FORK 0 pthread_create(&t1585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1585, ((void *)0), P0, ((void *)0))=-1, t1585={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L828] 0 pthread_t t1586; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1585={5:0}, t1586={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=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L829] FCALL, FORK 0 pthread_create(&t1586, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1586, ((void *)0), P1, ((void *)0))=0, t1585={5:0}, t1586={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=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 2 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EAX = y [L784] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 2 y$flush_delayed = weak$$choice2 [L791] 2 y$mem_tmp = y [L792] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L792] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L793] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L793] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0) [L793] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L793] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L794] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L794] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L794] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L794] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L795] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L795] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L795] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L795] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L796] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L796] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L796] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L796] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L797] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L797] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2) [L797] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L797] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L798] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L798] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L798] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L798] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L799] 2 __unbuffered_p1_EBX = y [L800] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L800] 2 y = y$flush_delayed ? y$mem_tmp : y [L801] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L752] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L754] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L756] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L804] 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) [L804] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L804] 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) [L804] 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) [L805] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L805] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L806] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L806] 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 [L807] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L807] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L808] 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 [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1585={5:0}, t1586={3:0}, weak$$choice0=7, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 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) [L835] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L835] 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) [L835] 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) [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] 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 [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L839] 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 [L842] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L843] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L844] 0 y$flush_delayed = weak$$choice2 [L845] 0 y$mem_tmp = y [L846] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L846] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L847] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L847] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L848] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L848] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L849] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L849] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L850] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L851] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L852] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L854] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L854] 0 y = y$flush_delayed ? y$mem_tmp : y [L855] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1585={5:0}, t1586={3:0}, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L857] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: 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: 827]: 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: 829]: 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 5 procedures, 117 locations, 5 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: 10.7s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 580 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 580 mSDsluCounter, 763 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1037 mSDsCounter, 358 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2200 IncrementalHoareTripleChecker+Invalid, 2558 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 358 mSolverCounterUnsat, 116 mSDtfsCounter, 2200 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 236 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=950occurred in iteration=9, InterpolantAutomatonStates: 177, 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.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 968 NumberOfCodeBlocks, 968 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 879 ConstructedInterpolants, 0 QuantifiedInterpolants, 6436 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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:08:33,789 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