./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe002_power.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d 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 ../../../trunk/examples/svcomp/pthread-wmm/safe002_power.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 7a9379df521a7077d18fd2276dc35da388f77854d23421e689a681d711c31769 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 16:54:39,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:54:39,884 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:54:39,922 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:54:39,923 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:54:39,925 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:54:39,927 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:54:39,929 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:54:39,931 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:54:39,934 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:54:39,934 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:54:39,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:54:39,936 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:54:39,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:54:39,939 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:54:39,942 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:54:39,943 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:54:39,944 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:54:39,945 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:54:39,947 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:54:39,948 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:54:39,949 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:54:39,950 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:54:39,950 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:54:39,956 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:54:39,956 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:54:39,956 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:54:39,957 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:54:39,958 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:54:39,958 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:54:39,958 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:54:39,962 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:54:39,963 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:54:39,964 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:54:39,964 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:54:39,965 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:54:39,966 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:54:39,966 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:54:39,966 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:54:39,966 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:54:39,967 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:54:39,968 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 16:54:39,991 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:54:39,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:54:39,992 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:54:39,992 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:54:39,993 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:54:39,993 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:54:39,993 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:54:39,993 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:54:39,994 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:54:39,994 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:54:39,994 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:54:39,995 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:54:39,995 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:54:39,995 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:54:39,995 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:54:39,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:54:39,995 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:54:39,995 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:54:39,996 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:54:39,996 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:54:39,996 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:54:39,996 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:54:39,996 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:54:39,997 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:54:39,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:54:39,997 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:54:39,997 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:54:39,997 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:54:39,997 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:54:39,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:54:39,998 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:54:39,998 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:54:39,998 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:54:39,998 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:54:39,998 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:54:39,998 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 7a9379df521a7077d18fd2276dc35da388f77854d23421e689a681d711c31769 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 16:54:40,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:54:40,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:54:40,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:54:40,288 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:54:40,288 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:54:40,289 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_power.oepc.i [2023-08-30 16:54:41,326 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:54:41,526 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:54:41,527 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_power.oepc.i [2023-08-30 16:54:41,537 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bafb22c39/52eeb1128023478888c64e26262680b6/FLAG4179a28c0 [2023-08-30 16:54:41,880 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bafb22c39/52eeb1128023478888c64e26262680b6 [2023-08-30 16:54:41,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:54:41,882 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:54:41,883 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:54:41,883 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:54:41,887 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:54:41,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:54:41" (1/1) ... [2023-08-30 16:54:41,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f6f1586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:41, skipping insertion in model container [2023-08-30 16:54:41,888 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:54:41" (1/1) ... [2023-08-30 16:54:41,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:54:41,943 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:54:42,065 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_power.oepc.i[995,1008] [2023-08-30 16:54:42,262 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:54:42,271 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:54:42,278 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_power.oepc.i[995,1008] [2023-08-30 16:54:42,322 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:54:42,353 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:54:42,355 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:54:42,359 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:54:42,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:42 WrapperNode [2023-08-30 16:54:42,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:54:42,360 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:54:42,361 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:54:42,361 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:54:42,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:42" (1/1) ... [2023-08-30 16:54:42,377 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:42" (1/1) ... [2023-08-30 16:54:42,397 INFO L138 Inliner]: procedures = 176, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 170 [2023-08-30 16:54:42,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:54:42,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:54:42,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:54:42,398 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:54:42,403 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:42" (1/1) ... [2023-08-30 16:54:42,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:42" (1/1) ... [2023-08-30 16:54:42,407 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:42" (1/1) ... [2023-08-30 16:54:42,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:42" (1/1) ... [2023-08-30 16:54:42,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:42" (1/1) ... [2023-08-30 16:54:42,438 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:42" (1/1) ... [2023-08-30 16:54:42,440 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:42" (1/1) ... [2023-08-30 16:54:42,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:42" (1/1) ... [2023-08-30 16:54:42,444 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:54:42,445 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:54:42,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:54:42,455 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:54:42,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:42" (1/1) ... [2023-08-30 16:54:42,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:54:42,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:54:42,479 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) [2023-08-30 16:54:42,481 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 [2023-08-30 16:54:42,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 16:54:42,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:54:42,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:54:42,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:54:42,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:54:42,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:54:42,521 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:54:42,521 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:54:42,521 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:54:42,521 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:54:42,521 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 16:54:42,521 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 16:54:42,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:54:42,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:54:42,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:54:42,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:54:42,523 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 16:54:42,628 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:54:42,629 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:54:43,003 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:54:43,355 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:54:43,355 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:54:43,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:54:43 BoogieIcfgContainer [2023-08-30 16:54:43,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:54:43,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:54:43,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:54:43,360 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:54:43,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:54:41" (1/3) ... [2023-08-30 16:54:43,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e092fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:54:43, skipping insertion in model container [2023-08-30 16:54:43,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:42" (2/3) ... [2023-08-30 16:54:43,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e092fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:54:43, skipping insertion in model container [2023-08-30 16:54:43,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:54:43" (3/3) ... [2023-08-30 16:54:43,362 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_power.oepc.i [2023-08-30 16:54:43,367 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:54:43,373 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:54:43,373 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-30 16:54:43,374 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:54:43,427 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:54:43,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2023-08-30 16:54:43,526 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2023-08-30 16:54:43,526 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:54:43,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2023-08-30 16:54:43,530 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2023-08-30 16:54:43,534 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 110 transitions, 229 flow [2023-08-30 16:54:43,537 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:54:43,547 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 110 transitions, 229 flow [2023-08-30 16:54:43,550 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 110 transitions, 229 flow [2023-08-30 16:54:43,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 110 transitions, 229 flow [2023-08-30 16:54:43,585 INFO L130 PetriNetUnfolder]: 1/110 cut-off events. [2023-08-30 16:54:43,586 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:54:43,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 1/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 41 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2023-08-30 16:54:43,588 INFO L119 LiptonReduction]: Number of co-enabled transitions 1212 [2023-08-30 16:54:50,102 INFO L134 LiptonReduction]: Checked pairs total: 3151 [2023-08-30 16:54:50,103 INFO L136 LiptonReduction]: Total number of compositions: 93 [2023-08-30 16:54:50,112 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:54:50,117 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1a18719, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:54:50,117 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-30 16:54:50,122 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2023-08-30 16:54:50,123 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:54:50,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:50,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:50,124 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 16:54:50,128 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:50,128 INFO L85 PathProgramCache]: Analyzing trace with hash -86757538, now seen corresponding path program 1 times [2023-08-30 16:54:50,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:50,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172658679] [2023-08-30 16:54:50,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:50,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:50,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:50,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:54:50,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:50,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172658679] [2023-08-30 16:54:50,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172658679] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:50,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:50,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:54:50,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055338274] [2023-08-30 16:54:50,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:50,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:54:50,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:50,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:54:50,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:54:50,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 218 [2023-08-30 16:54:50,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 49 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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) [2023-08-30 16:54:50,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:50,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 218 [2023-08-30 16:54:50,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:50,888 INFO L130 PetriNetUnfolder]: 367/600 cut-off events. [2023-08-30 16:54:50,889 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2023-08-30 16:54:50,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1211 conditions, 600 events. 367/600 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2491 event pairs, 175 based on Foata normal form. 16/612 useless extension candidates. Maximal degree in co-relation 1200. Up to 453 conditions per place. [2023-08-30 16:54:50,896 INFO L137 encePairwiseOnDemand]: 215/218 looper letters, 27 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2023-08-30 16:54:50,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 32 transitions, 137 flow [2023-08-30 16:54:50,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:54:50,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:54:50,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2023-08-30 16:54:50,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5642201834862385 [2023-08-30 16:54:50,912 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2023-08-30 16:54:50,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2023-08-30 16:54:50,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:50,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2023-08-30 16:54:50,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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) [2023-08-30 16:54:50,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 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) [2023-08-30 16:54:50,923 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 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) [2023-08-30 16:54:50,924 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 49 flow. Second operand 3 states and 369 transitions. [2023-08-30 16:54:50,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 32 transitions, 137 flow [2023-08-30 16:54:50,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 32 transitions, 132 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 16:54:50,927 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 54 flow [2023-08-30 16:54:50,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-08-30 16:54:50,932 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2023-08-30 16:54:50,932 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2023-08-30 16:54:50,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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) [2023-08-30 16:54:50,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:50,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:50,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:54:50,936 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 16:54:50,942 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:50,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1605482852, now seen corresponding path program 1 times [2023-08-30 16:54:50,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:50,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440183785] [2023-08-30 16:54:50,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:50,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:51,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:54:51,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:51,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440183785] [2023-08-30 16:54:51,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440183785] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:51,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:51,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:54:51,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631658047] [2023-08-30 16:54:51,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:51,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:54:51,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:51,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:54:51,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:54:51,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 218 [2023-08-30 16:54:51,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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) [2023-08-30 16:54:51,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:51,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 218 [2023-08-30 16:54:51,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:51,482 INFO L130 PetriNetUnfolder]: 349/591 cut-off events. [2023-08-30 16:54:51,482 INFO L131 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2023-08-30 16:54:51,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1316 conditions, 591 events. 349/591 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2606 event pairs, 94 based on Foata normal form. 8/595 useless extension candidates. Maximal degree in co-relation 1305. Up to 404 conditions per place. [2023-08-30 16:54:51,485 INFO L137 encePairwiseOnDemand]: 215/218 looper letters, 22 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2023-08-30 16:54:51,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 27 transitions, 119 flow [2023-08-30 16:54:51,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:54:51,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:54:51,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-08-30 16:54:51,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5519877675840978 [2023-08-30 16:54:51,487 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-08-30 16:54:51,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-08-30 16:54:51,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:51,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-08-30 16:54:51,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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) [2023-08-30 16:54:51,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 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) [2023-08-30 16:54:51,490 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 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) [2023-08-30 16:54:51,490 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 3 states and 361 transitions. [2023-08-30 16:54:51,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 27 transitions, 119 flow [2023-08-30 16:54:51,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 27 transitions, 113 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:54:51,491 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 58 flow [2023-08-30 16:54:51,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2023-08-30 16:54:51,491 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2023-08-30 16:54:51,492 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 58 flow [2023-08-30 16:54:51,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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) [2023-08-30 16:54:51,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:51,492 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:51,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:54:51,493 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 16:54:51,493 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:51,493 INFO L85 PathProgramCache]: Analyzing trace with hash -456148395, now seen corresponding path program 1 times [2023-08-30 16:54:51,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:51,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750658395] [2023-08-30 16:54:51,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:51,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:52,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:54:52,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:52,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750658395] [2023-08-30 16:54:52,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750658395] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:52,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:52,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:54:52,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192662824] [2023-08-30 16:54:52,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:52,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:54:52,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:52,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:54:52,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:54:52,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 218 [2023-08-30 16:54:52,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 58 flow. Second operand has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 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) [2023-08-30 16:54:52,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:52,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 218 [2023-08-30 16:54:52,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:52,977 INFO L130 PetriNetUnfolder]: 630/966 cut-off events. [2023-08-30 16:54:52,978 INFO L131 PetriNetUnfolder]: For 141/141 co-relation queries the response was YES. [2023-08-30 16:54:52,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2243 conditions, 966 events. 630/966 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4038 event pairs, 435 based on Foata normal form. 10/976 useless extension candidates. Maximal degree in co-relation 2231. Up to 853 conditions per place. [2023-08-30 16:54:52,982 INFO L137 encePairwiseOnDemand]: 210/218 looper letters, 21 selfloop transitions, 7 changer transitions 0/29 dead transitions. [2023-08-30 16:54:52,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 133 flow [2023-08-30 16:54:52,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:54:52,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:54:52,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 449 transitions. [2023-08-30 16:54:52,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5149082568807339 [2023-08-30 16:54:52,984 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 449 transitions. [2023-08-30 16:54:52,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 449 transitions. [2023-08-30 16:54:52,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:52,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 449 transitions. [2023-08-30 16:54:52,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 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) [2023-08-30 16:54:52,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 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) [2023-08-30 16:54:52,987 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 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) [2023-08-30 16:54:52,988 INFO L175 Difference]: Start difference. First operand has 31 places, 20 transitions, 58 flow. Second operand 4 states and 449 transitions. [2023-08-30 16:54:52,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 133 flow [2023-08-30 16:54:52,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 129 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:54:52,990 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 93 flow [2023-08-30 16:54:52,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=93, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2023-08-30 16:54:52,991 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2023-08-30 16:54:52,993 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 93 flow [2023-08-30 16:54:52,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 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) [2023-08-30 16:54:52,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:52,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:52,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:54:52,994 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 16:54:52,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:52,994 INFO L85 PathProgramCache]: Analyzing trace with hash -456194895, now seen corresponding path program 2 times [2023-08-30 16:54:52,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:52,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214040942] [2023-08-30 16:54:52,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:52,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:53,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:54:53,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:53,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214040942] [2023-08-30 16:54:53,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214040942] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:53,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:53,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:54:53,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540928093] [2023-08-30 16:54:53,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:53,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:54:53,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:53,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:54:53,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:54:53,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 218 [2023-08-30 16:54:53,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 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) [2023-08-30 16:54:53,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:53,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 218 [2023-08-30 16:54:53,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:54,159 INFO L130 PetriNetUnfolder]: 707/1101 cut-off events. [2023-08-30 16:54:54,159 INFO L131 PetriNetUnfolder]: For 433/433 co-relation queries the response was YES. [2023-08-30 16:54:54,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3050 conditions, 1101 events. 707/1101 cut-off events. For 433/433 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4987 event pairs, 437 based on Foata normal form. 10/1111 useless extension candidates. Maximal degree in co-relation 3037. Up to 964 conditions per place. [2023-08-30 16:54:54,165 INFO L137 encePairwiseOnDemand]: 210/218 looper letters, 26 selfloop transitions, 10 changer transitions 0/37 dead transitions. [2023-08-30 16:54:54,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 213 flow [2023-08-30 16:54:54,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:54:54,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:54:54,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 454 transitions. [2023-08-30 16:54:54,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5206422018348624 [2023-08-30 16:54:54,170 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 454 transitions. [2023-08-30 16:54:54,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 454 transitions. [2023-08-30 16:54:54,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:54,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 454 transitions. [2023-08-30 16:54:54,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 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) [2023-08-30 16:54:54,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 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) [2023-08-30 16:54:54,173 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 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) [2023-08-30 16:54:54,173 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 93 flow. Second operand 4 states and 454 transitions. [2023-08-30 16:54:54,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 213 flow [2023-08-30 16:54:54,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 37 transitions, 201 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:54:54,176 INFO L231 Difference]: Finished difference. Result has 35 places, 32 transitions, 165 flow [2023-08-30 16:54:54,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=165, PETRI_PLACES=35, PETRI_TRANSITIONS=32} [2023-08-30 16:54:54,177 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2023-08-30 16:54:54,177 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 32 transitions, 165 flow [2023-08-30 16:54:54,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 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) [2023-08-30 16:54:54,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:54,178 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:54,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:54:54,178 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 16:54:54,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:54,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1771080445, now seen corresponding path program 3 times [2023-08-30 16:54:54,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:54,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057653399] [2023-08-30 16:54:54,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:54,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:55,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:54:55,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:55,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057653399] [2023-08-30 16:54:55,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057653399] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:55,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:55,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:54:55,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923526542] [2023-08-30 16:54:55,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:55,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:54:55,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:55,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:54:55,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:54:55,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 218 [2023-08-30 16:54:55,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 165 flow. Second operand has 6 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 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) [2023-08-30 16:54:55,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:55,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 218 [2023-08-30 16:54:55,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:55,926 INFO L130 PetriNetUnfolder]: 936/1477 cut-off events. [2023-08-30 16:54:55,926 INFO L131 PetriNetUnfolder]: For 1203/1203 co-relation queries the response was YES. [2023-08-30 16:54:55,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4539 conditions, 1477 events. 936/1477 cut-off events. For 1203/1203 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7454 event pairs, 218 based on Foata normal form. 34/1511 useless extension candidates. Maximal degree in co-relation 4524. Up to 726 conditions per place. [2023-08-30 16:54:55,933 INFO L137 encePairwiseOnDemand]: 211/218 looper letters, 35 selfloop transitions, 16 changer transitions 0/52 dead transitions. [2023-08-30 16:54:55,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 52 transitions, 341 flow [2023-08-30 16:54:55,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:54:55,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:54:55,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2023-08-30 16:54:55,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5192660550458715 [2023-08-30 16:54:55,935 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 566 transitions. [2023-08-30 16:54:55,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 566 transitions. [2023-08-30 16:54:55,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:55,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 566 transitions. [2023-08-30 16:54:55,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 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) [2023-08-30 16:54:55,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 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) [2023-08-30 16:54:55,939 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 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) [2023-08-30 16:54:55,939 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 165 flow. Second operand 5 states and 566 transitions. [2023-08-30 16:54:55,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 52 transitions, 341 flow [2023-08-30 16:54:55,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 52 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:54:55,941 INFO L231 Difference]: Finished difference. Result has 39 places, 36 transitions, 235 flow [2023-08-30 16:54:55,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=235, PETRI_PLACES=39, PETRI_TRANSITIONS=36} [2023-08-30 16:54:55,942 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2023-08-30 16:54:55,942 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 235 flow [2023-08-30 16:54:55,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 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) [2023-08-30 16:54:55,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:55,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:55,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:54:55,943 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 16:54:55,943 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:55,943 INFO L85 PathProgramCache]: Analyzing trace with hash 929523126, now seen corresponding path program 1 times [2023-08-30 16:54:55,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:55,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147818228] [2023-08-30 16:54:55,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:55,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:56,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:54:56,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:56,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147818228] [2023-08-30 16:54:56,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147818228] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:56,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:56,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:54:56,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188203399] [2023-08-30 16:54:56,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:56,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:54:56,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:56,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:54:56,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:54:56,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 218 [2023-08-30 16:54:56,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 235 flow. Second operand has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 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) [2023-08-30 16:54:56,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:56,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 218 [2023-08-30 16:54:56,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:56,776 INFO L130 PetriNetUnfolder]: 1134/1808 cut-off events. [2023-08-30 16:54:56,777 INFO L131 PetriNetUnfolder]: For 2654/2654 co-relation queries the response was YES. [2023-08-30 16:54:56,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5917 conditions, 1808 events. 1134/1808 cut-off events. For 2654/2654 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 9493 event pairs, 246 based on Foata normal form. 30/1838 useless extension candidates. Maximal degree in co-relation 5899. Up to 900 conditions per place. [2023-08-30 16:54:56,783 INFO L137 encePairwiseOnDemand]: 211/218 looper letters, 44 selfloop transitions, 5 changer transitions 21/71 dead transitions. [2023-08-30 16:54:56,783 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 71 transitions, 554 flow [2023-08-30 16:54:56,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:54:56,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:54:56,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 563 transitions. [2023-08-30 16:54:56,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5165137614678899 [2023-08-30 16:54:56,785 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 563 transitions. [2023-08-30 16:54:56,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 563 transitions. [2023-08-30 16:54:56,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:56,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 563 transitions. [2023-08-30 16:54:56,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 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) [2023-08-30 16:54:56,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 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) [2023-08-30 16:54:56,788 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 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) [2023-08-30 16:54:56,788 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 235 flow. Second operand 5 states and 563 transitions. [2023-08-30 16:54:56,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 71 transitions, 554 flow [2023-08-30 16:54:56,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 71 transitions, 553 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:54:56,794 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 266 flow [2023-08-30 16:54:56,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=266, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2023-08-30 16:54:56,796 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2023-08-30 16:54:56,796 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 266 flow [2023-08-30 16:54:56,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 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) [2023-08-30 16:54:56,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:56,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:56,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:54:56,797 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 16:54:56,797 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:56,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1255700394, now seen corresponding path program 2 times [2023-08-30 16:54:56,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:56,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870388446] [2023-08-30 16:54:56,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:56,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:57,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:54:57,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:57,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870388446] [2023-08-30 16:54:57,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870388446] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:57,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:57,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:54:57,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076767818] [2023-08-30 16:54:57,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:57,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:54:57,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:57,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:54:57,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:54:57,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 218 [2023-08-30 16:54:57,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 266 flow. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 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) [2023-08-30 16:54:57,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:57,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 218 [2023-08-30 16:54:57,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:57,269 INFO L130 PetriNetUnfolder]: 411/738 cut-off events. [2023-08-30 16:54:57,269 INFO L131 PetriNetUnfolder]: For 2359/2441 co-relation queries the response was YES. [2023-08-30 16:54:57,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2783 conditions, 738 events. 411/738 cut-off events. For 2359/2441 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3619 event pairs, 65 based on Foata normal form. 93/827 useless extension candidates. Maximal degree in co-relation 2761. Up to 440 conditions per place. [2023-08-30 16:54:57,273 INFO L137 encePairwiseOnDemand]: 212/218 looper letters, 56 selfloop transitions, 7 changer transitions 5/77 dead transitions. [2023-08-30 16:54:57,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 77 transitions, 619 flow [2023-08-30 16:54:57,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:54:57,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:54:57,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2023-08-30 16:54:57,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5394495412844037 [2023-08-30 16:54:57,275 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 588 transitions. [2023-08-30 16:54:57,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 588 transitions. [2023-08-30 16:54:57,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:57,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 588 transitions. [2023-08-30 16:54:57,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 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) [2023-08-30 16:54:57,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 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) [2023-08-30 16:54:57,278 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 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) [2023-08-30 16:54:57,278 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 266 flow. Second operand 5 states and 588 transitions. [2023-08-30 16:54:57,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 77 transitions, 619 flow [2023-08-30 16:54:57,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 77 transitions, 598 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 16:54:57,282 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 307 flow [2023-08-30 16:54:57,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=307, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-08-30 16:54:57,282 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 19 predicate places. [2023-08-30 16:54:57,283 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 307 flow [2023-08-30 16:54:57,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 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) [2023-08-30 16:54:57,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:57,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:57,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:54:57,283 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 16:54:57,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:57,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1168169104, now seen corresponding path program 1 times [2023-08-30 16:54:57,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:57,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920259751] [2023-08-30 16:54:57,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:57,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:58,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:54:58,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:58,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920259751] [2023-08-30 16:54:58,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920259751] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:58,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:58,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:54:58,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82315981] [2023-08-30 16:54:58,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:58,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:54:58,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:58,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:54:58,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:54:58,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 218 [2023-08-30 16:54:58,344 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 307 flow. Second operand has 6 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 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) [2023-08-30 16:54:58,344 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:58,344 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 218 [2023-08-30 16:54:58,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:58,564 INFO L130 PetriNetUnfolder]: 429/759 cut-off events. [2023-08-30 16:54:58,564 INFO L131 PetriNetUnfolder]: For 2485/2485 co-relation queries the response was YES. [2023-08-30 16:54:58,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3485 conditions, 759 events. 429/759 cut-off events. For 2485/2485 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3577 event pairs, 60 based on Foata normal form. 15/774 useless extension candidates. Maximal degree in co-relation 3460. Up to 475 conditions per place. [2023-08-30 16:54:58,568 INFO L137 encePairwiseOnDemand]: 213/218 looper letters, 43 selfloop transitions, 5 changer transitions 16/65 dead transitions. [2023-08-30 16:54:58,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 65 transitions, 584 flow [2023-08-30 16:54:58,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:54:58,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:54:58,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 447 transitions. [2023-08-30 16:54:58,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5126146788990825 [2023-08-30 16:54:58,570 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 447 transitions. [2023-08-30 16:54:58,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 447 transitions. [2023-08-30 16:54:58,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:58,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 447 transitions. [2023-08-30 16:54:58,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 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) [2023-08-30 16:54:58,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 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) [2023-08-30 16:54:58,572 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 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) [2023-08-30 16:54:58,572 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 307 flow. Second operand 4 states and 447 transitions. [2023-08-30 16:54:58,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 65 transitions, 584 flow [2023-08-30 16:54:58,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 65 transitions, 577 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:54:58,576 INFO L231 Difference]: Finished difference. Result has 53 places, 36 transitions, 285 flow [2023-08-30 16:54:58,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=285, PETRI_PLACES=53, PETRI_TRANSITIONS=36} [2023-08-30 16:54:58,578 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 23 predicate places. [2023-08-30 16:54:58,578 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 36 transitions, 285 flow [2023-08-30 16:54:58,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 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) [2023-08-30 16:54:58,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:58,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:58,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:54:58,579 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 16:54:58,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:58,584 INFO L85 PathProgramCache]: Analyzing trace with hash -845507112, now seen corresponding path program 1 times [2023-08-30 16:54:58,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:58,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974765772] [2023-08-30 16:54:58,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:58,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:58,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:54:58,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:58,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974765772] [2023-08-30 16:54:58,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974765772] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:58,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:58,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:54:58,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537643560] [2023-08-30 16:54:58,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:58,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:54:58,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:58,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:54:58,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:54:58,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 218 [2023-08-30 16:54:58,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 36 transitions, 285 flow. Second operand has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 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) [2023-08-30 16:54:58,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:58,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 218 [2023-08-30 16:54:58,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:58,976 INFO L130 PetriNetUnfolder]: 205/395 cut-off events. [2023-08-30 16:54:58,976 INFO L131 PetriNetUnfolder]: For 1743/1779 co-relation queries the response was YES. [2023-08-30 16:54:58,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1720 conditions, 395 events. 205/395 cut-off events. For 1743/1779 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1683 event pairs, 17 based on Foata normal form. 50/442 useless extension candidates. Maximal degree in co-relation 1692. Up to 152 conditions per place. [2023-08-30 16:54:58,979 INFO L137 encePairwiseOnDemand]: 212/218 looper letters, 53 selfloop transitions, 10 changer transitions 9/78 dead transitions. [2023-08-30 16:54:58,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 78 transitions, 702 flow [2023-08-30 16:54:58,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:54:58,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:54:58,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 704 transitions. [2023-08-30 16:54:58,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5382262996941896 [2023-08-30 16:54:58,981 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 704 transitions. [2023-08-30 16:54:58,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 704 transitions. [2023-08-30 16:54:58,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:58,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 704 transitions. [2023-08-30 16:54:58,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 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) [2023-08-30 16:54:58,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 218.0) internal successors, (1526), 7 states have internal predecessors, (1526), 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) [2023-08-30 16:54:58,984 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 218.0) internal successors, (1526), 7 states have internal predecessors, (1526), 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) [2023-08-30 16:54:58,985 INFO L175 Difference]: Start difference. First operand has 53 places, 36 transitions, 285 flow. Second operand 6 states and 704 transitions. [2023-08-30 16:54:58,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 78 transitions, 702 flow [2023-08-30 16:54:58,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 78 transitions, 633 flow, removed 6 selfloop flow, removed 8 redundant places. [2023-08-30 16:54:58,988 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 299 flow [2023-08-30 16:54:58,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=299, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2023-08-30 16:54:58,989 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2023-08-30 16:54:58,989 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 299 flow [2023-08-30 16:54:58,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 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) [2023-08-30 16:54:58,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:58,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:58,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:54:58,990 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 16:54:58,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:58,990 INFO L85 PathProgramCache]: Analyzing trace with hash 414658474, now seen corresponding path program 1 times [2023-08-30 16:54:58,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:58,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353594861] [2023-08-30 16:54:58,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:58,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:59,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:54:59,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:59,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353594861] [2023-08-30 16:54:59,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353594861] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:59,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:59,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:54:59,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926344714] [2023-08-30 16:54:59,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:59,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:54:59,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:59,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:54:59,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:54:59,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 218 [2023-08-30 16:54:59,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 299 flow. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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) [2023-08-30 16:54:59,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:59,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 218 [2023-08-30 16:54:59,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:59,463 INFO L130 PetriNetUnfolder]: 359/706 cut-off events. [2023-08-30 16:54:59,463 INFO L131 PetriNetUnfolder]: For 2539/2558 co-relation queries the response was YES. [2023-08-30 16:54:59,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3200 conditions, 706 events. 359/706 cut-off events. For 2539/2558 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3538 event pairs, 77 based on Foata normal form. 11/717 useless extension candidates. Maximal degree in co-relation 3174. Up to 368 conditions per place. [2023-08-30 16:54:59,466 INFO L137 encePairwiseOnDemand]: 215/218 looper letters, 53 selfloop transitions, 2 changer transitions 10/70 dead transitions. [2023-08-30 16:54:59,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 70 transitions, 654 flow [2023-08-30 16:54:59,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:54:59,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:54:59,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2023-08-30 16:54:59,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5401376146788991 [2023-08-30 16:54:59,468 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 471 transitions. [2023-08-30 16:54:59,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 471 transitions. [2023-08-30 16:54:59,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:59,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 471 transitions. [2023-08-30 16:54:59,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 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) [2023-08-30 16:54:59,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 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) [2023-08-30 16:54:59,471 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 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) [2023-08-30 16:54:59,471 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 299 flow. Second operand 4 states and 471 transitions. [2023-08-30 16:54:59,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 70 transitions, 654 flow [2023-08-30 16:54:59,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 70 transitions, 600 flow, removed 23 selfloop flow, removed 1 redundant places. [2023-08-30 16:54:59,478 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 286 flow [2023-08-30 16:54:59,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=286, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2023-08-30 16:54:59,479 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 25 predicate places. [2023-08-30 16:54:59,479 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 286 flow [2023-08-30 16:54:59,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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) [2023-08-30 16:54:59,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:59,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:59,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:54:59,480 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 16:54:59,480 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:59,480 INFO L85 PathProgramCache]: Analyzing trace with hash 676704394, now seen corresponding path program 2 times [2023-08-30 16:54:59,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:59,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486365190] [2023-08-30 16:54:59,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:59,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:54:59,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:59,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486365190] [2023-08-30 16:54:59,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486365190] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:59,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:59,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:54:59,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161211461] [2023-08-30 16:54:59,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:59,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:54:59,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:59,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:54:59,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:54:59,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 218 [2023-08-30 16:54:59,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 286 flow. Second operand has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 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) [2023-08-30 16:54:59,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:59,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 218 [2023-08-30 16:54:59,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:59,974 INFO L130 PetriNetUnfolder]: 273/549 cut-off events. [2023-08-30 16:54:59,974 INFO L131 PetriNetUnfolder]: For 1848/1875 co-relation queries the response was YES. [2023-08-30 16:54:59,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2292 conditions, 549 events. 273/549 cut-off events. For 1848/1875 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2808 event pairs, 38 based on Foata normal form. 30/571 useless extension candidates. Maximal degree in co-relation 2264. Up to 156 conditions per place. [2023-08-30 16:54:59,977 INFO L137 encePairwiseOnDemand]: 212/218 looper letters, 39 selfloop transitions, 14 changer transitions 20/77 dead transitions. [2023-08-30 16:54:59,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 77 transitions, 662 flow [2023-08-30 16:54:59,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:54:59,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:54:59,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 920 transitions. [2023-08-30 16:54:59,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5275229357798165 [2023-08-30 16:54:59,980 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 920 transitions. [2023-08-30 16:54:59,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 920 transitions. [2023-08-30 16:54:59,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:59,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 920 transitions. [2023-08-30 16:54:59,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 115.0) internal successors, (920), 8 states have internal predecessors, (920), 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) [2023-08-30 16:54:59,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 218.0) internal successors, (1962), 9 states have internal predecessors, (1962), 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) [2023-08-30 16:54:59,984 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 218.0) internal successors, (1962), 9 states have internal predecessors, (1962), 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) [2023-08-30 16:54:59,985 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 286 flow. Second operand 8 states and 920 transitions. [2023-08-30 16:54:59,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 77 transitions, 662 flow [2023-08-30 16:54:59,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 77 transitions, 586 flow, removed 18 selfloop flow, removed 4 redundant places. [2023-08-30 16:54:59,990 INFO L231 Difference]: Finished difference. Result has 61 places, 36 transitions, 260 flow [2023-08-30 16:54:59,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=260, PETRI_PLACES=61, PETRI_TRANSITIONS=36} [2023-08-30 16:54:59,991 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 31 predicate places. [2023-08-30 16:54:59,991 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 36 transitions, 260 flow [2023-08-30 16:54:59,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 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) [2023-08-30 16:54:59,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:59,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:59,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 16:54:59,992 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 16:54:59,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:59,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1176839813, now seen corresponding path program 1 times [2023-08-30 16:54:59,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:59,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350106939] [2023-08-30 16:54:59,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:59,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:55:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:55:00,089 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:55:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:55:00,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:55:00,202 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:55:00,203 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-30 16:55:00,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-08-30 16:55:00,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-08-30 16:55:00,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-08-30 16:55:00,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 16:55:00,205 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1] [2023-08-30 16:55:00,208 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:55:00,208 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:55:00,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:55:00 BasicIcfg [2023-08-30 16:55:00,279 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:55:00,280 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:55:00,280 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:55:00,280 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:55:00,280 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:54:43" (3/4) ... [2023-08-30 16:55:00,281 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:55:00,348 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:55:00,348 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:55:00,349 INFO L158 Benchmark]: Toolchain (without parser) took 18466.39ms. Allocated memory was 75.5MB in the beginning and 673.2MB in the end (delta: 597.7MB). Free memory was 51.1MB in the beginning and 440.6MB in the end (delta: -389.5MB). Peak memory consumption was 208.5MB. Max. memory is 16.1GB. [2023-08-30 16:55:00,349 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 62.9MB. Free memory was 39.6MB in the beginning and 39.6MB in the end (delta: 42.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:55:00,349 INFO L158 Benchmark]: CACSL2BoogieTranslator took 476.86ms. Allocated memory is still 75.5MB. Free memory was 50.9MB in the beginning and 43.1MB in the end (delta: 7.8MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2023-08-30 16:55:00,349 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.10ms. Allocated memory is still 75.5MB. Free memory was 43.1MB in the beginning and 40.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:55:00,350 INFO L158 Benchmark]: Boogie Preprocessor took 46.19ms. Allocated memory is still 75.5MB. Free memory was 40.3MB in the beginning and 37.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:55:00,350 INFO L158 Benchmark]: RCFGBuilder took 912.01ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 37.7MB in the beginning and 50.2MB in the end (delta: -12.6MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2023-08-30 16:55:00,350 INFO L158 Benchmark]: TraceAbstraction took 16921.41ms. Allocated memory was 92.3MB in the beginning and 673.2MB in the end (delta: 580.9MB). Free memory was 49.7MB in the beginning and 456.3MB in the end (delta: -406.7MB). Peak memory consumption was 176.0MB. Max. memory is 16.1GB. [2023-08-30 16:55:00,350 INFO L158 Benchmark]: Witness Printer took 68.75ms. Allocated memory is still 673.2MB. Free memory was 456.3MB in the beginning and 440.6MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-08-30 16:55:00,353 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.15ms. Allocated memory is still 62.9MB. Free memory was 39.6MB in the beginning and 39.6MB in the end (delta: 42.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 476.86ms. Allocated memory is still 75.5MB. Free memory was 50.9MB in the beginning and 43.1MB in the end (delta: 7.8MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.10ms. Allocated memory is still 75.5MB. Free memory was 43.1MB in the beginning and 40.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.19ms. Allocated memory is still 75.5MB. Free memory was 40.3MB in the beginning and 37.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 912.01ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 37.7MB in the beginning and 50.2MB in the end (delta: -12.6MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * TraceAbstraction took 16921.41ms. Allocated memory was 92.3MB in the beginning and 673.2MB in the end (delta: 580.9MB). Free memory was 49.7MB in the beginning and 456.3MB in the end (delta: -406.7MB). Peak memory consumption was 176.0MB. Max. memory is 16.1GB. * Witness Printer took 68.75ms. Allocated memory is still 673.2MB. Free memory was 456.3MB in the beginning and 440.6MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.6s, 119 PlacesBefore, 30 PlacesAfterwards, 110 TransitionsBefore, 20 TransitionsAfterwards, 1212 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 93 TotalNumberOfCompositions, 3151 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1227, independent: 1066, independent conditional: 0, independent unconditional: 1066, dependent: 161, dependent conditional: 0, dependent unconditional: 161, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 638, independent: 598, independent conditional: 0, independent unconditional: 598, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1227, independent: 468, independent conditional: 0, independent unconditional: 468, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 638, unknown conditional: 0, unknown unconditional: 638] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 47, Positive conditional cache size: 0, Positive unconditional cache size: 47, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1825; [L854] FCALL, FORK 0 pthread_create(&t1825, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1825, ((void *)0), P0, ((void *)0))=-3, t1825={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L855] 0 pthread_t t1826; [L856] FCALL, FORK 0 pthread_create(&t1826, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1826, ((void *)0), P1, ((void *)0))=-2, t1825={7:0}, t1826={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L780] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L792] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L857] 0 pthread_t t1827; [L795] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L798] 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) [L798] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L798] EXPR 2 \read(y) [L798] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L798] 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) [L798] 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) [L799] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L800] 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 [L801] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L802] 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 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L858] FCALL, FORK 0 pthread_create(&t1827, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1827, ((void *)0), P2, ((void *)0))=-1, t1825={7:0}, t1826={5:0}, t1827={6:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 y$flush_delayed = weak$$choice2 [L815] EXPR 3 \read(y) [L815] 3 y$mem_tmp = y [L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] EXPR 3 \read(y) [L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L817] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L818] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L819] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L820] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L822] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] EXPR 3 \read(y) [L823] 3 __unbuffered_p2_EAX = y [L824] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L824] 3 y = y$flush_delayed ? y$mem_tmp : y [L825] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L828] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L831] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L831] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L831] EXPR 3 \read(y) [L831] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L831] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L831] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L833] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L834] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L835] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 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) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 \read(y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] 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) [L864] 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) [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 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 [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 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 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1825={7:0}, t1826={5:0}, t1827={6:0}, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 y$flush_delayed = weak$$choice2 [L874] EXPR 0 \read(y) [L874] 0 y$mem_tmp = y [L875] 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) [L875] EXPR 0 \read(y) [L875] 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) [L875] 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) [L876] 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)) [L877] 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)) [L878] 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)) [L879] 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)) [L880] 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)) [L881] 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)) [L882] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 \read(y) [L884] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L885] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L885] EXPR 0 \read(y) [L885] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L885] 0 y = y$flush_delayed ? y$mem_tmp : y [L886] 0 y$flush_delayed = (_Bool)0 [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: 858]: 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: 856]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 150 locations, 4 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: 16.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 554 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 376 mSDsluCounter, 263 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 142 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1020 IncrementalHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 121 mSDtfsCounter, 1020 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=307occurred in iteration=7, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 131 ConstructedInterpolants, 0 QuantifiedInterpolants, 1439 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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! [2023-08-30 16:55:00,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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