./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix050.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --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/mix050.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 a3c87384db48703a1f350b065ac4130898667537456cdd449d5c78c22c9ba26d --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 09:51:50,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:51:50,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:51:50,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:51:50,685 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:51:50,687 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:51:50,690 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:51:50,692 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:51:50,693 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:51:50,697 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:51:50,697 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:51:50,699 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:51:50,699 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:51:50,701 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:51:50,702 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:51:50,708 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:51:50,709 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:51:50,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:51:50,710 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:51:50,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:51:50,733 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:51:50,733 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:51:50,734 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:51:50,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:51:50,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:51:50,737 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:51:50,737 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:51:50,737 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:51:50,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:51:50,738 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:51:50,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:51:50,739 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:51:50,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:51:50,739 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:51:50,740 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:51:50,740 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:51:50,740 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:51:50,741 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:51:50,741 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:51:50,741 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:51:50,742 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:51:50,743 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 09:51:50,765 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:51:50,765 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:51:50,766 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:51:50,766 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:51:50,766 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:51:50,767 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:51:50,767 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:51:50,767 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:51:50,767 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:51:50,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:51:50,768 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:51:50,768 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:51:50,768 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:51:50,768 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:51:50,769 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:51:50,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:51:50,769 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:51:50,769 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:51:50,769 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:51:50,769 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:51:50,769 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:51:50,770 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:51:50,770 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:51:50,770 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:51:50,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:51:50,770 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:51:50,770 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:51:50,771 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:51:50,771 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:51:50,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:51:50,771 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:51:50,771 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:51:50,771 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:51:50,772 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:51:50,772 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:51:50,772 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 -> a3c87384db48703a1f350b065ac4130898667537456cdd449d5c78c22c9ba26d 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 -> BEFORE [2023-09-01 09:51:51,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:51:51,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:51:51,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:51:51,047 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:51:51,047 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:51:51,048 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix050.i [2023-09-01 09:51:52,091 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:51:52,325 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:51:52,326 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix050.i [2023-09-01 09:51:52,335 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5fffa124/e1b18467a652487eb3004cac810378f3/FLAGa9007a47d [2023-09-01 09:51:52,351 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5fffa124/e1b18467a652487eb3004cac810378f3 [2023-09-01 09:51:52,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:51:52,354 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:51:52,356 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:51:52,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:51:52,358 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:51:52,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:51:52" (1/1) ... [2023-09-01 09:51:52,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52244c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:51:52, skipping insertion in model container [2023-09-01 09:51:52,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:51:52" (1/1) ... [2023-09-01 09:51:52,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:51:52,411 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:51:52,537 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/mix050.i[940,953] [2023-09-01 09:51:52,667 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:51:52,674 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:51:52,691 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/mix050.i[940,953] [2023-09-01 09:51:52,751 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:51:52,783 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:51:52,784 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:51:52,788 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:51:52,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:51:52 WrapperNode [2023-09-01 09:51:52,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:51:52,790 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:51:52,790 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:51:52,790 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:51:52,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:51:52" (1/1) ... [2023-09-01 09:51:52,819 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:51:52" (1/1) ... [2023-09-01 09:51:52,850 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-09-01 09:51:52,850 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:51:52,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:51:52,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:51:52,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:51:52,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:51:52" (1/1) ... [2023-09-01 09:51:52,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:51:52" (1/1) ... [2023-09-01 09:51:52,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:51:52" (1/1) ... [2023-09-01 09:51:52,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:51:52" (1/1) ... [2023-09-01 09:51:52,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:51:52" (1/1) ... [2023-09-01 09:51:52,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:51:52" (1/1) ... [2023-09-01 09:51:52,880 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:51:52" (1/1) ... [2023-09-01 09:51:52,881 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:51:52" (1/1) ... [2023-09-01 09:51:52,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:51:52,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:51:52,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:51:52,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:51:52,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:51:52" (1/1) ... [2023-09-01 09:51:52,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:51:52,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:51:52,909 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-09-01 09:51:52,931 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-09-01 09:51:52,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:51:52,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:51:52,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:51:52,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:51:52,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:51:52,939 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:51:52,939 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:51:52,939 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:51:52,939 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:51:52,939 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-09-01 09:51:52,939 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-09-01 09:51:52,939 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-09-01 09:51:52,939 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-09-01 09:51:52,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:51:52,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:51:52,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:51:52,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:51:52,940 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 09:51:53,096 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:51:53,097 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:51:53,359 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:51:53,455 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:51:53,456 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:51:53,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:51:53 BoogieIcfgContainer [2023-09-01 09:51:53,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:51:53,460 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:51:53,460 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:51:53,462 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:51:53,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:51:52" (1/3) ... [2023-09-01 09:51:53,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@154055e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:51:53, skipping insertion in model container [2023-09-01 09:51:53,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:51:52" (2/3) ... [2023-09-01 09:51:53,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@154055e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:51:53, skipping insertion in model container [2023-09-01 09:51:53,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:51:53" (3/3) ... [2023-09-01 09:51:53,465 INFO L112 eAbstractionObserver]: Analyzing ICFG mix050.i [2023-09-01 09:51:53,470 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:51:53,475 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:51:53,476 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-01 09:51:53,476 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:51:53,524 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:51:53,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2023-09-01 09:51:53,603 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2023-09-01 09:51:53,604 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:51:53,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-09-01 09:51:53,609 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2023-09-01 09:51:53,613 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2023-09-01 09:51:53,616 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:51:53,625 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2023-09-01 09:51:53,627 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2023-09-01 09:51:53,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2023-09-01 09:51:53,659 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2023-09-01 09:51:53,659 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:51:53,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-09-01 09:51:53,666 INFO L119 LiptonReduction]: Number of co-enabled transitions 3058 [2023-09-01 09:51:57,077 INFO L134 LiptonReduction]: Checked pairs total: 8842 [2023-09-01 09:51:57,078 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-09-01 09:51:57,087 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:51:57,094 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;@ee12509, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:51:57,094 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-09-01 09:51:57,096 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-09-01 09:51:57,096 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:51:57,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:57,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 09:51:57,097 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:57,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:57,100 INFO L85 PathProgramCache]: Analyzing trace with hash 547453, now seen corresponding path program 1 times [2023-09-01 09:51:57,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:57,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663048245] [2023-09-01 09:51:57,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:57,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:57,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:57,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:57,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663048245] [2023-09-01 09:51:57,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663048245] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:57,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:57,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:51:57,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026866824] [2023-09-01 09:51:57,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:57,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:51:57,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:57,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:51:57,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:51:57,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 240 [2023-09-01 09:51:57,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:57,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:57,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 240 [2023-09-01 09:51:57,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:58,056 INFO L130 PetriNetUnfolder]: 4903/7118 cut-off events. [2023-09-01 09:51:58,057 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2023-09-01 09:51:58,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13966 conditions, 7118 events. 4903/7118 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 41445 event pairs, 895 based on Foata normal form. 0/6793 useless extension candidates. Maximal degree in co-relation 13954. Up to 5335 conditions per place. [2023-09-01 09:51:58,099 INFO L137 encePairwiseOnDemand]: 236/240 looper letters, 41 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2023-09-01 09:51:58,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 207 flow [2023-09-01 09:51:58,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:51:58,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:51:58,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2023-09-01 09:51:58,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2023-09-01 09:51:58,113 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 390 transitions. [2023-09-01 09:51:58,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions. [2023-09-01 09:51:58,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:58,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions. [2023-09-01 09:51:58,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 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-09-01 09:51:58,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:58,124 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:58,125 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 390 transitions. [2023-09-01 09:51:58,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 207 flow [2023-09-01 09:51:58,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 200 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 09:51:58,129 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 66 flow [2023-09-01 09:51:58,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-09-01 09:51:58,132 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-09-01 09:51:58,133 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 66 flow [2023-09-01 09:51:58,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:58,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:58,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:51:58,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:51:58,134 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:58,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:58,134 INFO L85 PathProgramCache]: Analyzing trace with hash 128778335, now seen corresponding path program 1 times [2023-09-01 09:51:58,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:58,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919449102] [2023-09-01 09:51:58,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:58,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:58,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:58,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:58,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919449102] [2023-09-01 09:51:58,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919449102] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:58,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:58,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:51:58,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304259352] [2023-09-01 09:51:58,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:58,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:51:58,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:58,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:51:58,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:51:58,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 240 [2023-09-01 09:51:58,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand has 4 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-09-01 09:51:58,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:58,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 240 [2023-09-01 09:51:58,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:58,929 INFO L130 PetriNetUnfolder]: 3395/4853 cut-off events. [2023-09-01 09:51:58,929 INFO L131 PetriNetUnfolder]: For 333/333 co-relation queries the response was YES. [2023-09-01 09:51:58,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10201 conditions, 4853 events. 3395/4853 cut-off events. For 333/333 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 25154 event pairs, 634 based on Foata normal form. 320/5159 useless extension candidates. Maximal degree in co-relation 10191. Up to 3244 conditions per place. [2023-09-01 09:51:58,947 INFO L137 encePairwiseOnDemand]: 233/240 looper letters, 38 selfloop transitions, 5 changer transitions 27/73 dead transitions. [2023-09-01 09:51:58,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 73 transitions, 310 flow [2023-09-01 09:51:58,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:51:58,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:51:58,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 617 transitions. [2023-09-01 09:51:58,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5141666666666667 [2023-09-01 09:51:58,950 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 617 transitions. [2023-09-01 09:51:58,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 617 transitions. [2023-09-01 09:51:58,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:58,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 617 transitions. [2023-09-01 09:51:58,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 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-09-01 09:51:58,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 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-09-01 09:51:58,955 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 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-09-01 09:51:58,956 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 5 states and 617 transitions. [2023-09-01 09:51:58,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 73 transitions, 310 flow [2023-09-01 09:51:58,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 73 transitions, 300 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:51:58,958 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 107 flow [2023-09-01 09:51:58,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2023-09-01 09:51:58,958 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2023-09-01 09:51:58,959 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 107 flow [2023-09-01 09:51:58,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-09-01 09:51:58,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:58,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:51:58,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:51:58,960 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:58,961 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:58,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1019116965, now seen corresponding path program 1 times [2023-09-01 09:51:58,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:58,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056935060] [2023-09-01 09:51:58,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:58,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:59,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:59,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:59,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056935060] [2023-09-01 09:51:59,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056935060] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:59,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:59,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:51:59,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846496096] [2023-09-01 09:51:59,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:59,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:51:59,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:59,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:51:59,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:51:59,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 240 [2023-09-01 09:51:59,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 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-09-01 09:51:59,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:59,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 240 [2023-09-01 09:51:59,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:59,590 INFO L130 PetriNetUnfolder]: 1883/2829 cut-off events. [2023-09-01 09:51:59,591 INFO L131 PetriNetUnfolder]: For 942/942 co-relation queries the response was YES. [2023-09-01 09:51:59,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7619 conditions, 2829 events. 1883/2829 cut-off events. For 942/942 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14223 event pairs, 373 based on Foata normal form. 212/3027 useless extension candidates. Maximal degree in co-relation 7606. Up to 994 conditions per place. [2023-09-01 09:51:59,600 INFO L137 encePairwiseOnDemand]: 233/240 looper letters, 51 selfloop transitions, 9 changer transitions 27/90 dead transitions. [2023-09-01 09:51:59,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 90 transitions, 459 flow [2023-09-01 09:51:59,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:51:59,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:51:59,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 743 transitions. [2023-09-01 09:51:59,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5159722222222223 [2023-09-01 09:51:59,603 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 743 transitions. [2023-09-01 09:51:59,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 743 transitions. [2023-09-01 09:51:59,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:59,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 743 transitions. [2023-09-01 09:51:59,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 0 states have call successors, (0), 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-09-01 09:51:59,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 240.0) internal successors, (1680), 7 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:59,608 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 240.0) internal successors, (1680), 7 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:59,608 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 107 flow. Second operand 6 states and 743 transitions. [2023-09-01 09:51:59,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 90 transitions, 459 flow [2023-09-01 09:51:59,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 90 transitions, 452 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-09-01 09:51:59,615 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 172 flow [2023-09-01 09:51:59,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2023-09-01 09:51:59,616 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2023-09-01 09:51:59,616 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 172 flow [2023-09-01 09:51:59,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 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-09-01 09:51:59,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:59,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:51:59,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:51:59,618 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:59,618 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:59,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1228858763, now seen corresponding path program 1 times [2023-09-01 09:51:59,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:59,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430487117] [2023-09-01 09:51:59,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:59,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:59,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:59,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:59,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430487117] [2023-09-01 09:51:59,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430487117] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:59,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:59,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:51:59,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15588000] [2023-09-01 09:51:59,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:59,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:51:59,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:59,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:51:59,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:51:59,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 240 [2023-09-01 09:51:59,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 172 flow. Second operand has 6 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 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-09-01 09:51:59,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:59,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 240 [2023-09-01 09:51:59,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:00,113 INFO L130 PetriNetUnfolder]: 1163/1785 cut-off events. [2023-09-01 09:52:00,113 INFO L131 PetriNetUnfolder]: For 1730/1730 co-relation queries the response was YES. [2023-09-01 09:52:00,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5418 conditions, 1785 events. 1163/1785 cut-off events. For 1730/1730 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8480 event pairs, 329 based on Foata normal form. 77/1848 useless extension candidates. Maximal degree in co-relation 5402. Up to 630 conditions per place. [2023-09-01 09:52:00,121 INFO L137 encePairwiseOnDemand]: 233/240 looper letters, 62 selfloop transitions, 13 changer transitions 27/105 dead transitions. [2023-09-01 09:52:00,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 105 transitions, 628 flow [2023-09-01 09:52:00,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:52:00,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:52:00,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 867 transitions. [2023-09-01 09:52:00,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5160714285714286 [2023-09-01 09:52:00,126 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 867 transitions. [2023-09-01 09:52:00,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 867 transitions. [2023-09-01 09:52:00,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:00,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 867 transitions. [2023-09-01 09:52:00,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 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-09-01 09:52:00,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 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-09-01 09:52:00,131 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 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-09-01 09:52:00,131 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 172 flow. Second operand 7 states and 867 transitions. [2023-09-01 09:52:00,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 105 transitions, 628 flow [2023-09-01 09:52:00,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 105 transitions, 566 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-09-01 09:52:00,146 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 222 flow [2023-09-01 09:52:00,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2023-09-01 09:52:00,147 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2023-09-01 09:52:00,147 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 222 flow [2023-09-01 09:52:00,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 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-09-01 09:52:00,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:00,148 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, 1, 1, 1] [2023-09-01 09:52:00,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:52:00,148 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:00,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:00,149 INFO L85 PathProgramCache]: Analyzing trace with hash -696967962, now seen corresponding path program 1 times [2023-09-01 09:52:00,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:00,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698824297] [2023-09-01 09:52:00,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:00,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:00,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:00,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:00,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698824297] [2023-09-01 09:52:00,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698824297] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:00,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:00,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 09:52:00,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005592122] [2023-09-01 09:52:00,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:00,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:52:00,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:00,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:52:00,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:52:00,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 240 [2023-09-01 09:52:00,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 111.85714285714286) internal successors, (783), 7 states have internal predecessors, (783), 0 states have call successors, (0), 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-09-01 09:52:00,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:00,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 240 [2023-09-01 09:52:00,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:00,729 INFO L130 PetriNetUnfolder]: 1011/1531 cut-off events. [2023-09-01 09:52:00,730 INFO L131 PetriNetUnfolder]: For 1455/1455 co-relation queries the response was YES. [2023-09-01 09:52:00,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4480 conditions, 1531 events. 1011/1531 cut-off events. For 1455/1455 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7100 event pairs, 326 based on Foata normal form. 14/1531 useless extension candidates. Maximal degree in co-relation 4464. Up to 630 conditions per place. [2023-09-01 09:52:00,738 INFO L137 encePairwiseOnDemand]: 233/240 looper letters, 58 selfloop transitions, 17 changer transitions 14/92 dead transitions. [2023-09-01 09:52:00,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 92 transitions, 564 flow [2023-09-01 09:52:00,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 09:52:00,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 09:52:00,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 963 transitions. [2023-09-01 09:52:00,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5015625 [2023-09-01 09:52:00,741 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 963 transitions. [2023-09-01 09:52:00,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 963 transitions. [2023-09-01 09:52:00,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:00,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 963 transitions. [2023-09-01 09:52:00,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.375) internal successors, (963), 8 states have internal predecessors, (963), 0 states have call successors, (0), 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-09-01 09:52:00,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 240.0) internal successors, (2160), 9 states have internal predecessors, (2160), 0 states have call successors, (0), 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-09-01 09:52:00,745 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 240.0) internal successors, (2160), 9 states have internal predecessors, (2160), 0 states have call successors, (0), 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-09-01 09:52:00,746 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 222 flow. Second operand 8 states and 963 transitions. [2023-09-01 09:52:00,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 92 transitions, 564 flow [2023-09-01 09:52:00,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 92 transitions, 502 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-09-01 09:52:00,762 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 216 flow [2023-09-01 09:52:00,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=216, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2023-09-01 09:52:00,763 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2023-09-01 09:52:00,763 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 216 flow [2023-09-01 09:52:00,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.85714285714286) internal successors, (783), 7 states have internal predecessors, (783), 0 states have call successors, (0), 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-09-01 09:52:00,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:00,764 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, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:00,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:52:00,764 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:00,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:00,764 INFO L85 PathProgramCache]: Analyzing trace with hash 748678022, now seen corresponding path program 1 times [2023-09-01 09:52:00,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:00,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634484853] [2023-09-01 09:52:00,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:00,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:01,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:01,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:01,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634484853] [2023-09-01 09:52:01,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634484853] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:01,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:01,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 09:52:01,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922176459] [2023-09-01 09:52:01,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:01,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 09:52:01,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:01,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 09:52:01,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-09-01 09:52:01,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 240 [2023-09-01 09:52:01,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 216 flow. Second operand has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 0 states have call successors, (0), 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-09-01 09:52:01,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:01,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 240 [2023-09-01 09:52:01,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:02,120 INFO L130 PetriNetUnfolder]: 1471/2370 cut-off events. [2023-09-01 09:52:02,120 INFO L131 PetriNetUnfolder]: For 2863/2863 co-relation queries the response was YES. [2023-09-01 09:52:02,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7091 conditions, 2370 events. 1471/2370 cut-off events. For 2863/2863 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 13090 event pairs, 175 based on Foata normal form. 1/2366 useless extension candidates. Maximal degree in co-relation 7073. Up to 775 conditions per place. [2023-09-01 09:52:02,135 INFO L137 encePairwiseOnDemand]: 234/240 looper letters, 97 selfloop transitions, 4 changer transitions 31/135 dead transitions. [2023-09-01 09:52:02,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 135 transitions, 1042 flow [2023-09-01 09:52:02,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:52:02,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:52:02,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 745 transitions. [2023-09-01 09:52:02,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5173611111111112 [2023-09-01 09:52:02,137 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 745 transitions. [2023-09-01 09:52:02,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 745 transitions. [2023-09-01 09:52:02,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:02,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 745 transitions. [2023-09-01 09:52:02,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 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-09-01 09:52:02,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 240.0) internal successors, (1680), 7 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:52:02,141 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 240.0) internal successors, (1680), 7 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:52:02,141 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 216 flow. Second operand 6 states and 745 transitions. [2023-09-01 09:52:02,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 135 transitions, 1042 flow [2023-09-01 09:52:02,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 135 transitions, 824 flow, removed 57 selfloop flow, removed 7 redundant places. [2023-09-01 09:52:02,155 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 176 flow [2023-09-01 09:52:02,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2023-09-01 09:52:02,157 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2023-09-01 09:52:02,157 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 176 flow [2023-09-01 09:52:02,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 0 states have call successors, (0), 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-09-01 09:52:02,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:02,158 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, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:02,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:52:02,158 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:02,158 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:02,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1712724858, now seen corresponding path program 2 times [2023-09-01 09:52:02,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:02,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175581709] [2023-09-01 09:52:02,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:02,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:02,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:02,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:02,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175581709] [2023-09-01 09:52:02,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175581709] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:02,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:02,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:52:02,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089452978] [2023-09-01 09:52:02,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:02,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:52:02,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:02,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:52:02,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:52:02,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 240 [2023-09-01 09:52:02,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 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-09-01 09:52:02,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:02,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 240 [2023-09-01 09:52:02,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:02,889 INFO L130 PetriNetUnfolder]: 3784/5672 cut-off events. [2023-09-01 09:52:02,889 INFO L131 PetriNetUnfolder]: For 4507/4507 co-relation queries the response was YES. [2023-09-01 09:52:02,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16783 conditions, 5672 events. 3784/5672 cut-off events. For 4507/4507 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 30833 event pairs, 377 based on Foata normal form. 2/5674 useless extension candidates. Maximal degree in co-relation 16767. Up to 3347 conditions per place. [2023-09-01 09:52:02,910 INFO L137 encePairwiseOnDemand]: 234/240 looper letters, 85 selfloop transitions, 5 changer transitions 6/96 dead transitions. [2023-09-01 09:52:02,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 96 transitions, 608 flow [2023-09-01 09:52:02,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:52:02,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:52:02,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2023-09-01 09:52:02,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5072916666666667 [2023-09-01 09:52:02,912 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 487 transitions. [2023-09-01 09:52:02,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 487 transitions. [2023-09-01 09:52:02,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:02,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 487 transitions. [2023-09-01 09:52:02,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 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-09-01 09:52:02,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:52:02,916 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:52:02,916 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 176 flow. Second operand 4 states and 487 transitions. [2023-09-01 09:52:02,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 96 transitions, 608 flow [2023-09-01 09:52:02,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 96 transitions, 600 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-09-01 09:52:02,960 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 209 flow [2023-09-01 09:52:02,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=209, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2023-09-01 09:52:02,961 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2023-09-01 09:52:02,961 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 209 flow [2023-09-01 09:52:02,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 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-09-01 09:52:02,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:02,962 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, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:02,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:52:02,962 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:02,962 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:02,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1708784758, now seen corresponding path program 3 times [2023-09-01 09:52:02,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:02,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880780891] [2023-09-01 09:52:02,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:02,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:03,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:03,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:03,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880780891] [2023-09-01 09:52:03,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880780891] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:03,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:03,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:52:03,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189324309] [2023-09-01 09:52:03,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:03,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:52:03,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:03,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:52:03,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:52:03,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 240 [2023-09-01 09:52:03,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 209 flow. Second operand has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 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-09-01 09:52:03,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:03,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 240 [2023-09-01 09:52:03,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:03,708 INFO L130 PetriNetUnfolder]: 4929/7409 cut-off events. [2023-09-01 09:52:03,708 INFO L131 PetriNetUnfolder]: For 8642/8642 co-relation queries the response was YES. [2023-09-01 09:52:03,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24148 conditions, 7409 events. 4929/7409 cut-off events. For 8642/8642 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 41438 event pairs, 753 based on Foata normal form. 2/7411 useless extension candidates. Maximal degree in co-relation 24130. Up to 4749 conditions per place. [2023-09-01 09:52:03,737 INFO L137 encePairwiseOnDemand]: 234/240 looper letters, 89 selfloop transitions, 6 changer transitions 6/101 dead transitions. [2023-09-01 09:52:03,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 101 transitions, 686 flow [2023-09-01 09:52:03,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:52:03,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:52:03,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 483 transitions. [2023-09-01 09:52:03,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503125 [2023-09-01 09:52:03,739 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 483 transitions. [2023-09-01 09:52:03,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 483 transitions. [2023-09-01 09:52:03,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:03,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 483 transitions. [2023-09-01 09:52:03,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 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-09-01 09:52:03,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:52:03,742 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:52:03,742 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 209 flow. Second operand 4 states and 483 transitions. [2023-09-01 09:52:03,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 101 transitions, 686 flow [2023-09-01 09:52:03,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 101 transitions, 684 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:52:03,823 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 269 flow [2023-09-01 09:52:03,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=269, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2023-09-01 09:52:03,825 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2023-09-01 09:52:03,825 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 269 flow [2023-09-01 09:52:03,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 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-09-01 09:52:03,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:03,825 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, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:03,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:52:03,826 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:03,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:03,829 INFO L85 PathProgramCache]: Analyzing trace with hash 747214452, now seen corresponding path program 4 times [2023-09-01 09:52:03,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:03,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601105220] [2023-09-01 09:52:03,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:03,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:04,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:04,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:04,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601105220] [2023-09-01 09:52:04,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601105220] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:04,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:04,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:52:04,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546722671] [2023-09-01 09:52:04,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:04,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:52:04,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:04,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:52:04,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:52:04,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 240 [2023-09-01 09:52:04,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 269 flow. Second operand has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 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-09-01 09:52:04,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:04,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 240 [2023-09-01 09:52:04,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:04,728 INFO L130 PetriNetUnfolder]: 5186/8083 cut-off events. [2023-09-01 09:52:04,728 INFO L131 PetriNetUnfolder]: For 12559/12765 co-relation queries the response was YES. [2023-09-01 09:52:04,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27832 conditions, 8083 events. 5186/8083 cut-off events. For 12559/12765 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 50360 event pairs, 1760 based on Foata normal form. 21/7979 useless extension candidates. Maximal degree in co-relation 27812. Up to 3165 conditions per place. [2023-09-01 09:52:04,759 INFO L137 encePairwiseOnDemand]: 237/240 looper letters, 59 selfloop transitions, 1 changer transitions 32/99 dead transitions. [2023-09-01 09:52:04,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 99 transitions, 716 flow [2023-09-01 09:52:04,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:52:04,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:52:04,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2023-09-01 09:52:04,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135416666666667 [2023-09-01 09:52:04,761 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 493 transitions. [2023-09-01 09:52:04,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 493 transitions. [2023-09-01 09:52:04,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:04,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 493 transitions. [2023-09-01 09:52:04,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 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-09-01 09:52:04,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:52:04,765 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:52:04,765 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 269 flow. Second operand 4 states and 493 transitions. [2023-09-01 09:52:04,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 99 transitions, 716 flow [2023-09-01 09:52:04,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 99 transitions, 706 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-09-01 09:52:04,954 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 275 flow [2023-09-01 09:52:04,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=275, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-09-01 09:52:04,955 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2023-09-01 09:52:04,955 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 275 flow [2023-09-01 09:52:04,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 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-09-01 09:52:04,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:04,956 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, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:04,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:52:04,956 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:04,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:04,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1275952376, now seen corresponding path program 5 times [2023-09-01 09:52:04,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:04,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572569553] [2023-09-01 09:52:04,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:04,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:05,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:05,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:05,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572569553] [2023-09-01 09:52:05,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572569553] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:05,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:05,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 09:52:05,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131924918] [2023-09-01 09:52:05,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:05,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 09:52:05,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:05,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 09:52:05,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-09-01 09:52:05,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 240 [2023-09-01 09:52:05,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 275 flow. Second operand has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 0 states have call successors, (0), 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-09-01 09:52:05,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:05,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 240 [2023-09-01 09:52:05,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:06,357 INFO L130 PetriNetUnfolder]: 3885/6382 cut-off events. [2023-09-01 09:52:06,357 INFO L131 PetriNetUnfolder]: For 9282/9488 co-relation queries the response was YES. [2023-09-01 09:52:06,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21808 conditions, 6382 events. 3885/6382 cut-off events. For 9282/9488 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 42194 event pairs, 296 based on Foata normal form. 94/6387 useless extension candidates. Maximal degree in co-relation 21786. Up to 2677 conditions per place. [2023-09-01 09:52:06,384 INFO L137 encePairwiseOnDemand]: 233/240 looper letters, 94 selfloop transitions, 6 changer transitions 33/143 dead transitions. [2023-09-01 09:52:06,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 143 transitions, 996 flow [2023-09-01 09:52:06,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:52:06,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:52:06,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 850 transitions. [2023-09-01 09:52:06,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5059523809523809 [2023-09-01 09:52:06,386 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 850 transitions. [2023-09-01 09:52:06,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 850 transitions. [2023-09-01 09:52:06,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:06,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 850 transitions. [2023-09-01 09:52:06,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.42857142857143) internal successors, (850), 7 states have internal predecessors, (850), 0 states have call successors, (0), 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-09-01 09:52:06,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 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-09-01 09:52:06,390 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 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-09-01 09:52:06,390 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 275 flow. Second operand 7 states and 850 transitions. [2023-09-01 09:52:06,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 143 transitions, 996 flow [2023-09-01 09:52:06,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 143 transitions, 990 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-09-01 09:52:06,498 INFO L231 Difference]: Finished difference. Result has 67 places, 52 transitions, 308 flow [2023-09-01 09:52:06,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=308, PETRI_PLACES=67, PETRI_TRANSITIONS=52} [2023-09-01 09:52:06,499 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2023-09-01 09:52:06,499 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 52 transitions, 308 flow [2023-09-01 09:52:06,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 0 states have call successors, (0), 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-09-01 09:52:06,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:06,500 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, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:06,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 09:52:06,500 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:06,500 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:06,501 INFO L85 PathProgramCache]: Analyzing trace with hash 42905700, now seen corresponding path program 6 times [2023-09-01 09:52:06,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:06,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708742163] [2023-09-01 09:52:06,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:06,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:52:06,547 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:52:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:52:06,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:52:06,638 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:52:06,638 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-09-01 09:52:06,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-09-01 09:52:06,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-09-01 09:52:06,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-09-01 09:52:06,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-09-01 09:52:06,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-09-01 09:52:06,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-09-01 09:52:06,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 09:52:06,642 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1] [2023-09-01 09:52:06,646 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:52:06,646 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:52:06,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:52:06 BasicIcfg [2023-09-01 09:52:06,711 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:52:06,712 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:52:06,712 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:52:06,712 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:52:06,712 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:51:53" (3/4) ... [2023-09-01 09:52:06,721 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:52:06,782 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:52:06,783 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:52:06,783 INFO L158 Benchmark]: Toolchain (without parser) took 14429.10ms. Allocated memory was 81.8MB in the beginning and 966.8MB in the end (delta: 885.0MB). Free memory was 57.6MB in the beginning and 446.3MB in the end (delta: -388.6MB). Peak memory consumption was 498.3MB. Max. memory is 16.1GB. [2023-09-01 09:52:06,783 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 65.0MB. Free memory was 42.8MB in the beginning and 42.7MB in the end (delta: 58.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:52:06,784 INFO L158 Benchmark]: CACSL2BoogieTranslator took 432.93ms. Allocated memory is still 81.8MB. Free memory was 57.5MB in the beginning and 53.4MB in the end (delta: 4.1MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2023-09-01 09:52:06,784 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.44ms. Allocated memory is still 81.8MB. Free memory was 53.0MB in the beginning and 50.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:52:06,784 INFO L158 Benchmark]: Boogie Preprocessor took 32.09ms. Allocated memory is still 81.8MB. Free memory was 50.5MB in the beginning and 48.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:52:06,784 INFO L158 Benchmark]: RCFGBuilder took 574.27ms. Allocated memory is still 81.8MB. Free memory was 48.8MB in the beginning and 39.6MB in the end (delta: 9.2MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2023-09-01 09:52:06,785 INFO L158 Benchmark]: TraceAbstraction took 13251.97ms. Allocated memory was 81.8MB in the beginning and 966.8MB in the end (delta: 885.0MB). Free memory was 39.1MB in the beginning and 461.0MB in the end (delta: -421.8MB). Peak memory consumption was 462.4MB. Max. memory is 16.1GB. [2023-09-01 09:52:06,785 INFO L158 Benchmark]: Witness Printer took 70.95ms. Allocated memory is still 966.8MB. Free memory was 461.0MB in the beginning and 446.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-09-01 09:52:06,786 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.09ms. Allocated memory is still 65.0MB. Free memory was 42.8MB in the beginning and 42.7MB in the end (delta: 58.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 432.93ms. Allocated memory is still 81.8MB. Free memory was 57.5MB in the beginning and 53.4MB in the end (delta: 4.1MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.44ms. Allocated memory is still 81.8MB. Free memory was 53.0MB in the beginning and 50.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.09ms. Allocated memory is still 81.8MB. Free memory was 50.5MB in the beginning and 48.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 574.27ms. Allocated memory is still 81.8MB. Free memory was 48.8MB in the beginning and 39.6MB in the end (delta: 9.2MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * TraceAbstraction took 13251.97ms. Allocated memory was 81.8MB in the beginning and 966.8MB in the end (delta: 885.0MB). Free memory was 39.1MB in the beginning and 461.0MB in the end (delta: -421.8MB). Peak memory consumption was 462.4MB. Max. memory is 16.1GB. * Witness Printer took 70.95ms. Allocated memory is still 966.8MB. Free memory was 461.0MB in the beginning and 446.3MB in the end (delta: 14.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: 3.5s, 137 PlacesBefore, 42 PlacesAfterwards, 126 TransitionsBefore, 30 TransitionsAfterwards, 3058 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 110 TotalNumberOfCompositions, 8842 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3505, independent: 3269, independent conditional: 0, independent unconditional: 3269, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1647, independent: 1600, independent conditional: 0, independent unconditional: 1600, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3505, independent: 1669, independent conditional: 0, independent unconditional: 1669, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 1647, unknown conditional: 0, unknown unconditional: 1647] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 140, Positive conditional cache size: 0, Positive unconditional cache size: 140, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: 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; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L863] 0 pthread_t t1321; [L864] FCALL, FORK 0 pthread_create(&t1321, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1321, ((void *)0), P0, ((void *)0))=-4, t1321={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t1322; [L866] FCALL, FORK 0 pthread_create(&t1322, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1322, ((void *)0), P1, ((void *)0))=-3, t1321={5:0}, t1322={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L867] 0 pthread_t t1323; [L868] FCALL, FORK 0 pthread_create(&t1323, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1323, ((void *)0), P2, ((void *)0))=-2, t1321={5:0}, t1322={6:0}, t1323={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L869] 0 pthread_t t1324; [L870] FCALL, FORK 0 pthread_create(&t1324, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1324, ((void *)0), P3, ((void *)0))=-1, t1321={5:0}, t1322={6:0}, t1323={7:0}, t1324={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L822] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L825] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 4 a$flush_delayed = weak$$choice2 [L828] 4 a$mem_tmp = a [L829] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L830] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L831] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L832] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L833] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L835] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 __unbuffered_p3_EAX = a [L837] 4 a = a$flush_delayed ? a$mem_tmp : a [L838] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, 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$$choice2=0, x=1, y=1, z=1] [L841] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L842] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L843] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L844] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L845] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, 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$$choice2=0, x=1, y=1, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, 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$$choice2=0, x=1, y=1, z=1] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L848] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L850] 4 return 0; [L872] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L874] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L874] RET 0 assume_abort_if_not(main$tmp_guard0) [L876] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L877] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L878] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L879] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L880] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=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, t1321={5:0}, t1322={6:0}, t1323={7:0}, t1324={3:0}, weak$$choice2=0, x=1, y=1, z=1] [L883] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L885] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 870]: 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: 866]: 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: 868]: 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: 864]: 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 9 procedures, 166 locations, 7 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: 13.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 622 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 507 mSDsluCounter, 334 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 249 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1740 IncrementalHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 85 mSDtfsCounter, 1740 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=308occurred in iteration=10, InterpolantAutomatonStates: 54, 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.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 233 NumberOfCodeBlocks, 233 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 196 ConstructedInterpolants, 0 QuantifiedInterpolants, 1534 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-09-01 09:52:06,813 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