./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe027_power.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe027_power.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3edc5a2d9ce2881b3565fd36253c94b9cf356a0dafd043fa3f9d27823541c09b --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 16:58:24,714 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:58:24,717 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:58:24,758 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:58:24,760 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:58:24,763 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:58:24,765 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:58:24,767 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:58:24,769 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:58:24,774 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:58:24,775 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:58:24,777 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:58:24,777 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:58:24,778 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:58:24,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:58:24,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:58:24,783 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:58:24,785 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:58:24,787 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:58:24,795 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:58:24,798 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:58:24,802 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:58:24,803 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:58:24,803 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:58:24,806 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:58:24,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:58:24,809 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:58:24,810 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:58:24,811 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:58:24,812 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:58:24,812 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:58:24,815 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:58:24,815 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:58:24,817 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:58:24,818 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:58:24,818 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:58:24,819 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:58:24,819 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:58:24,820 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:58:24,820 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:58:24,821 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:58:24,822 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 16:58:24,850 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:58:24,850 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:58:24,851 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:58:24,851 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:58:24,852 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:58:24,852 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:58:24,853 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:58:24,853 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:58:24,853 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:58:24,853 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:58:24,854 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:58:24,854 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:58:24,854 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:58:24,855 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:58:24,855 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:58:24,855 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:58:24,855 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:58:24,856 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:58:24,856 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:58:24,856 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:58:24,856 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:58:24,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:58:24,857 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:58:24,857 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:58:24,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:58:24,857 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:58:24,857 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:58:24,858 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:58:24,858 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:58:24,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:58:24,858 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:58:24,858 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:58:24,859 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:58:24,859 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:58:24,859 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:58:24,859 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 -> 3edc5a2d9ce2881b3565fd36253c94b9cf356a0dafd043fa3f9d27823541c09b Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 16:58:25,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:58:25,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:58:25,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:58:25,172 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:58:25,172 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:58:25,174 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe027_power.opt.i [2023-08-30 16:58:26,259 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:58:26,538 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:58:26,542 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe027_power.opt.i [2023-08-30 16:58:26,568 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c8ee5d3e/7456ceec5a8841408ebd81eaa6fa286e/FLAG3314294c7 [2023-08-30 16:58:26,584 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c8ee5d3e/7456ceec5a8841408ebd81eaa6fa286e [2023-08-30 16:58:26,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:58:26,588 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:58:26,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:58:26,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:58:26,594 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:58:26,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:58:26" (1/1) ... [2023-08-30 16:58:26,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73de614b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:58:26, skipping insertion in model container [2023-08-30 16:58:26,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:58:26" (1/1) ... [2023-08-30 16:58:26,602 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:58:26,652 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:58:26,812 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/safe027_power.opt.i[994,1007] [2023-08-30 16:58:27,044 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:58:27,056 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:58:27,066 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/safe027_power.opt.i[994,1007] [2023-08-30 16:58:27,124 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:58:27,157 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:58:27,158 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:58:27,165 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:58:27,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:58:27 WrapperNode [2023-08-30 16:58:27,165 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:58:27,166 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:58:27,167 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:58:27,167 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:58:27,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:58:27" (1/1) ... [2023-08-30 16:58:27,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:58:27" (1/1) ... [2023-08-30 16:58:27,209 INFO L138 Inliner]: procedures = 177, calls = 88, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 195 [2023-08-30 16:58:27,210 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:58:27,210 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:58:27,210 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:58:27,211 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:58:27,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:58:27" (1/1) ... [2023-08-30 16:58:27,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:58:27" (1/1) ... [2023-08-30 16:58:27,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:58:27" (1/1) ... [2023-08-30 16:58:27,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:58:27" (1/1) ... [2023-08-30 16:58:27,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:58:27" (1/1) ... [2023-08-30 16:58:27,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:58:27" (1/1) ... [2023-08-30 16:58:27,239 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:58:27" (1/1) ... [2023-08-30 16:58:27,241 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:58:27" (1/1) ... [2023-08-30 16:58:27,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:58:27,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:58:27,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:58:27,247 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:58:27,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:58:27" (1/1) ... [2023-08-30 16:58:27,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:58:27,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:58:27,301 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 16:58:27,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 16:58:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 16:58:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:58:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:58:27,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:58:27,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:58:27,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:58:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:58:27,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:58:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:58:27,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:58:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 16:58:27,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 16:58:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 16:58:27,339 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 16:58:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:58:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:58:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:58:27,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:58:27,341 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 16:58:27,565 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:58:27,567 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:58:28,055 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:58:28,365 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:58:28,365 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:58:28,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:58:28 BoogieIcfgContainer [2023-08-30 16:58:28,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:58:28,369 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:58:28,370 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:58:28,372 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:58:28,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:58:26" (1/3) ... [2023-08-30 16:58:28,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e248b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:58:28, skipping insertion in model container [2023-08-30 16:58:28,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:58:27" (2/3) ... [2023-08-30 16:58:28,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e248b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:58:28, skipping insertion in model container [2023-08-30 16:58:28,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:58:28" (3/3) ... [2023-08-30 16:58:28,374 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_power.opt.i [2023-08-30 16:58:28,381 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:58:28,389 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:58:28,389 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:58:28,389 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:58:28,463 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:58:28,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 146 transitions, 312 flow [2023-08-30 16:58:28,590 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2023-08-30 16:58:28,590 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:58:28,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-08-30 16:58:28,596 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 146 transitions, 312 flow [2023-08-30 16:58:28,599 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 142 transitions, 296 flow [2023-08-30 16:58:28,603 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:58:28,610 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 142 transitions, 296 flow [2023-08-30 16:58:28,612 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 142 transitions, 296 flow [2023-08-30 16:58:28,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 296 flow [2023-08-30 16:58:28,644 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2023-08-30 16:58:28,644 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:58:28,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-08-30 16:58:28,649 INFO L119 LiptonReduction]: Number of co-enabled transitions 2664 [2023-08-30 16:58:36,365 INFO L134 LiptonReduction]: Checked pairs total: 7003 [2023-08-30 16:58:36,365 INFO L136 LiptonReduction]: Total number of compositions: 123 [2023-08-30 16:58:36,377 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:58:36,382 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;@e9bb71e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:58:36,383 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-30 16:58:36,386 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2023-08-30 16:58:36,386 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:58:36,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:36,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 16:58:36,387 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:58:36,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:36,392 INFO L85 PathProgramCache]: Analyzing trace with hash 919011141, now seen corresponding path program 1 times [2023-08-30 16:58:36,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:36,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34961673] [2023-08-30 16:58:36,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:36,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:58:36,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:58:36,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:58:36,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34961673] [2023-08-30 16:58:36,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34961673] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:58:36,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:58:36,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:58:36,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594236984] [2023-08-30 16:58:36,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:58:36,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:58:36,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:58:36,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:58:36,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:58:36,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 269 [2023-08-30 16:58:36,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:36,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:58:36,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 269 [2023-08-30 16:58:36,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:38,298 INFO L130 PetriNetUnfolder]: 5463/7428 cut-off events. [2023-08-30 16:58:38,299 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2023-08-30 16:58:38,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15028 conditions, 7428 events. 5463/7428 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 37430 event pairs, 1005 based on Foata normal form. 256/7168 useless extension candidates. Maximal degree in co-relation 15016. Up to 5923 conditions per place. [2023-08-30 16:58:38,334 INFO L137 encePairwiseOnDemand]: 265/269 looper letters, 39 selfloop transitions, 2 changer transitions 4/46 dead transitions. [2023-08-30 16:58:38,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 200 flow [2023-08-30 16:58:38,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:58:38,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:58:38,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-08-30 16:58:38,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5390334572490706 [2023-08-30 16:58:38,379 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-08-30 16:58:38,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-08-30 16:58:38,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:38,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-08-30 16:58:38,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:38,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:38,389 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:38,391 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 435 transitions. [2023-08-30 16:58:38,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 200 flow [2023-08-30 16:58:38,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 46 transitions, 194 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 16:58:38,396 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 62 flow [2023-08-30 16:58:38,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2023-08-30 16:58:38,401 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-08-30 16:58:38,401 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 62 flow [2023-08-30 16:58:38,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:38,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:38,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:58:38,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:58:38,402 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:58:38,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:38,403 INFO L85 PathProgramCache]: Analyzing trace with hash 313640684, now seen corresponding path program 1 times [2023-08-30 16:58:38,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:38,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181191355] [2023-08-30 16:58:38,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:38,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:58:38,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:58:38,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:58:38,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181191355] [2023-08-30 16:58:38,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181191355] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:58:38,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:58:38,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:58:38,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154540412] [2023-08-30 16:58:38,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:58:38,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:58:38,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:58:38,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:58:38,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:58:38,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 269 [2023-08-30 16:58:38,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:38,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:58:38,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 269 [2023-08-30 16:58:38,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:40,014 INFO L130 PetriNetUnfolder]: 4087/5668 cut-off events. [2023-08-30 16:58:40,015 INFO L131 PetriNetUnfolder]: For 391/391 co-relation queries the response was YES. [2023-08-30 16:58:40,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11898 conditions, 5668 events. 4087/5668 cut-off events. For 391/391 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 26711 event pairs, 1095 based on Foata normal form. 256/5920 useless extension candidates. Maximal degree in co-relation 11888. Up to 4175 conditions per place. [2023-08-30 16:58:40,042 INFO L137 encePairwiseOnDemand]: 265/269 looper letters, 39 selfloop transitions, 2 changer transitions 22/64 dead transitions. [2023-08-30 16:58:40,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 64 transitions, 278 flow [2023-08-30 16:58:40,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:58:40,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:58:40,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 700 transitions. [2023-08-30 16:58:40,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5204460966542751 [2023-08-30 16:58:40,046 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 700 transitions. [2023-08-30 16:58:40,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 700 transitions. [2023-08-30 16:58:40,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:40,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 700 transitions. [2023-08-30 16:58:40,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.0) internal successors, (700), 5 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:40,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:40,052 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:40,052 INFO L175 Difference]: Start difference. First operand has 38 places, 25 transitions, 62 flow. Second operand 5 states and 700 transitions. [2023-08-30 16:58:40,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 64 transitions, 278 flow [2023-08-30 16:58:40,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 64 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:58:40,054 INFO L231 Difference]: Finished difference. Result has 41 places, 25 transitions, 70 flow [2023-08-30 16:58:40,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=25} [2023-08-30 16:58:40,055 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2023-08-30 16:58:40,055 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 25 transitions, 70 flow [2023-08-30 16:58:40,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:40,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:40,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:58:40,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:58:40,056 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:58:40,056 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:40,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1132901910, now seen corresponding path program 1 times [2023-08-30 16:58:40,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:40,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676232866] [2023-08-30 16:58:40,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:40,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:58:40,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:58:40,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:58:40,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676232866] [2023-08-30 16:58:40,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676232866] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:58:40,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:58:40,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:58:40,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982516277] [2023-08-30 16:58:40,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:58:40,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:58:40,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:58:40,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:58:40,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:58:40,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 269 [2023-08-30 16:58:40,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 25 transitions, 70 flow. Second operand has 5 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:40,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:58:40,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 269 [2023-08-30 16:58:40,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:41,457 INFO L130 PetriNetUnfolder]: 4847/6712 cut-off events. [2023-08-30 16:58:41,457 INFO L131 PetriNetUnfolder]: For 809/809 co-relation queries the response was YES. [2023-08-30 16:58:41,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14677 conditions, 6712 events. 4847/6712 cut-off events. For 809/809 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 32092 event pairs, 903 based on Foata normal form. 192/6888 useless extension candidates. Maximal degree in co-relation 14664. Up to 2761 conditions per place. [2023-08-30 16:58:41,478 INFO L137 encePairwiseOnDemand]: 264/269 looper letters, 39 selfloop transitions, 3 changer transitions 26/69 dead transitions. [2023-08-30 16:58:41,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 69 transitions, 301 flow [2023-08-30 16:58:41,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:58:41,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:58:41,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 820 transitions. [2023-08-30 16:58:41,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5080545229244114 [2023-08-30 16:58:41,483 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 820 transitions. [2023-08-30 16:58:41,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 820 transitions. [2023-08-30 16:58:41,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:41,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 820 transitions. [2023-08-30 16:58:41,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.66666666666666) internal successors, (820), 6 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:41,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:41,489 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:41,489 INFO L175 Difference]: Start difference. First operand has 41 places, 25 transitions, 70 flow. Second operand 6 states and 820 transitions. [2023-08-30 16:58:41,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 69 transitions, 301 flow [2023-08-30 16:58:41,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 69 transitions, 291 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-30 16:58:41,525 INFO L231 Difference]: Finished difference. Result has 44 places, 25 transitions, 80 flow [2023-08-30 16:58:41,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=80, PETRI_PLACES=44, PETRI_TRANSITIONS=25} [2023-08-30 16:58:41,526 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2023-08-30 16:58:41,526 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 25 transitions, 80 flow [2023-08-30 16:58:41,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:41,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:41,527 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:58:41,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:58:41,528 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:58:41,528 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:41,528 INFO L85 PathProgramCache]: Analyzing trace with hash 759421574, now seen corresponding path program 1 times [2023-08-30 16:58:41,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:41,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562119660] [2023-08-30 16:58:41,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:41,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:58:41,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:58:41,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:58:41,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562119660] [2023-08-30 16:58:41,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562119660] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:58:41,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:58:41,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:58:41,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948385309] [2023-08-30 16:58:41,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:58:41,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:58:41,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:58:41,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:58:41,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:58:41,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 269 [2023-08-30 16:58:41,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 25 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:41,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:58:41,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 269 [2023-08-30 16:58:41,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:42,475 INFO L130 PetriNetUnfolder]: 2541/3768 cut-off events. [2023-08-30 16:58:42,475 INFO L131 PetriNetUnfolder]: For 1584/1584 co-relation queries the response was YES. [2023-08-30 16:58:42,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8565 conditions, 3768 events. 2541/3768 cut-off events. For 1584/1584 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 18732 event pairs, 438 based on Foata normal form. 144/3912 useless extension candidates. Maximal degree in co-relation 8550. Up to 2656 conditions per place. [2023-08-30 16:58:42,489 INFO L137 encePairwiseOnDemand]: 265/269 looper letters, 35 selfloop transitions, 2 changer transitions 18/56 dead transitions. [2023-08-30 16:58:42,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 268 flow [2023-08-30 16:58:42,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:58:42,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:58:42,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 702 transitions. [2023-08-30 16:58:42,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5219330855018587 [2023-08-30 16:58:42,492 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 702 transitions. [2023-08-30 16:58:42,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 702 transitions. [2023-08-30 16:58:42,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:42,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 702 transitions. [2023-08-30 16:58:42,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.4) internal successors, (702), 5 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:42,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:42,497 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:42,497 INFO L175 Difference]: Start difference. First operand has 44 places, 25 transitions, 80 flow. Second operand 5 states and 702 transitions. [2023-08-30 16:58:42,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 268 flow [2023-08-30 16:58:42,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 56 transitions, 240 flow, removed 6 selfloop flow, removed 7 redundant places. [2023-08-30 16:58:42,507 INFO L231 Difference]: Finished difference. Result has 42 places, 25 transitions, 74 flow [2023-08-30 16:58:42,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=74, PETRI_PLACES=42, PETRI_TRANSITIONS=25} [2023-08-30 16:58:42,507 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2023-08-30 16:58:42,508 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 25 transitions, 74 flow [2023-08-30 16:58:42,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:42,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:42,508 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:58:42,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:58:42,509 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:58:42,509 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:42,509 INFO L85 PathProgramCache]: Analyzing trace with hash 467717830, now seen corresponding path program 1 times [2023-08-30 16:58:42,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:42,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636002757] [2023-08-30 16:58:42,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:42,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:58:44,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:58:44,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:58:44,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636002757] [2023-08-30 16:58:44,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636002757] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:58:44,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:58:44,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 16:58:44,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500034204] [2023-08-30 16:58:44,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:58:44,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 16:58:44,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:58:44,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 16:58:44,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-08-30 16:58:44,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 269 [2023-08-30 16:58:44,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 25 transitions, 74 flow. Second operand has 9 states, 9 states have (on average 116.66666666666667) internal successors, (1050), 9 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:44,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:58:44,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 269 [2023-08-30 16:58:44,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:45,255 INFO L130 PetriNetUnfolder]: 3186/4490 cut-off events. [2023-08-30 16:58:45,255 INFO L131 PetriNetUnfolder]: For 1189/1189 co-relation queries the response was YES. [2023-08-30 16:58:45,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10131 conditions, 4490 events. 3186/4490 cut-off events. For 1189/1189 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 22746 event pairs, 246 based on Foata normal form. 134/4624 useless extension candidates. Maximal degree in co-relation 10118. Up to 2772 conditions per place. [2023-08-30 16:58:45,269 INFO L137 encePairwiseOnDemand]: 258/269 looper letters, 56 selfloop transitions, 11 changer transitions 24/92 dead transitions. [2023-08-30 16:58:45,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 92 transitions, 423 flow [2023-08-30 16:58:45,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:58:45,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:58:45,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1014 transitions. [2023-08-30 16:58:45,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4711895910780669 [2023-08-30 16:58:45,272 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1014 transitions. [2023-08-30 16:58:45,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1014 transitions. [2023-08-30 16:58:45,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:45,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1014 transitions. [2023-08-30 16:58:45,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.75) internal successors, (1014), 8 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:45,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 269.0) internal successors, (2421), 9 states have internal predecessors, (2421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:45,279 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 269.0) internal successors, (2421), 9 states have internal predecessors, (2421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:45,279 INFO L175 Difference]: Start difference. First operand has 42 places, 25 transitions, 74 flow. Second operand 8 states and 1014 transitions. [2023-08-30 16:58:45,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 92 transitions, 423 flow [2023-08-30 16:58:45,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 92 transitions, 409 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-30 16:58:45,284 INFO L231 Difference]: Finished difference. Result has 49 places, 34 transitions, 155 flow [2023-08-30 16:58:45,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=155, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2023-08-30 16:58:45,285 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2023-08-30 16:58:45,285 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 155 flow [2023-08-30 16:58:45,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 116.66666666666667) internal successors, (1050), 9 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:45,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:45,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:58:45,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:58:45,286 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:58:45,287 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:45,287 INFO L85 PathProgramCache]: Analyzing trace with hash -2042567032, now seen corresponding path program 2 times [2023-08-30 16:58:45,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:45,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148011129] [2023-08-30 16:58:45,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:45,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:58:46,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:58:46,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:58:46,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148011129] [2023-08-30 16:58:46,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148011129] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:58:46,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:58:46,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 16:58:46,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116659349] [2023-08-30 16:58:46,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:58:46,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 16:58:46,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:58:46,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 16:58:46,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-08-30 16:58:46,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 269 [2023-08-30 16:58:46,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 155 flow. Second operand has 9 states, 9 states have (on average 119.66666666666667) internal successors, (1077), 9 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:46,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:58:46,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 269 [2023-08-30 16:58:46,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:47,130 INFO L130 PetriNetUnfolder]: 3121/4435 cut-off events. [2023-08-30 16:58:47,130 INFO L131 PetriNetUnfolder]: For 4704/4738 co-relation queries the response was YES. [2023-08-30 16:58:47,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14239 conditions, 4435 events. 3121/4435 cut-off events. For 4704/4738 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 21207 event pairs, 1239 based on Foata normal form. 144/4579 useless extension candidates. Maximal degree in co-relation 14222. Up to 3890 conditions per place. [2023-08-30 16:58:47,152 INFO L137 encePairwiseOnDemand]: 260/269 looper letters, 58 selfloop transitions, 16 changer transitions 21/96 dead transitions. [2023-08-30 16:58:47,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 96 transitions, 632 flow [2023-08-30 16:58:47,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:58:47,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:58:47,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1027 transitions. [2023-08-30 16:58:47,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47723048327137546 [2023-08-30 16:58:47,156 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1027 transitions. [2023-08-30 16:58:47,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1027 transitions. [2023-08-30 16:58:47,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:47,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1027 transitions. [2023-08-30 16:58:47,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 128.375) internal successors, (1027), 8 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:47,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 269.0) internal successors, (2421), 9 states have internal predecessors, (2421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:47,163 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 269.0) internal successors, (2421), 9 states have internal predecessors, (2421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:47,164 INFO L175 Difference]: Start difference. First operand has 49 places, 34 transitions, 155 flow. Second operand 8 states and 1027 transitions. [2023-08-30 16:58:47,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 96 transitions, 632 flow [2023-08-30 16:58:47,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 96 transitions, 610 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-30 16:58:47,180 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 309 flow [2023-08-30 16:58:47,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=309, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2023-08-30 16:58:47,183 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 15 predicate places. [2023-08-30 16:58:47,183 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 309 flow [2023-08-30 16:58:47,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 119.66666666666667) internal successors, (1077), 9 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:47,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:47,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:58:47,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:58:47,184 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:58:47,184 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:47,185 INFO L85 PathProgramCache]: Analyzing trace with hash -2049630056, now seen corresponding path program 1 times [2023-08-30 16:58:47,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:47,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957271689] [2023-08-30 16:58:47,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:47,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:58:47,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:58:47,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:58:47,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957271689] [2023-08-30 16:58:47,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957271689] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:58:47,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:58:47,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:58:47,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177192793] [2023-08-30 16:58:47,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:58:47,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:58:47,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:58:47,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:58:47,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:58:47,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 269 [2023-08-30 16:58:47,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 309 flow. Second operand has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:47,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:58:47,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 269 [2023-08-30 16:58:47,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:48,281 INFO L130 PetriNetUnfolder]: 2673/3872 cut-off events. [2023-08-30 16:58:48,281 INFO L131 PetriNetUnfolder]: For 9507/9522 co-relation queries the response was YES. [2023-08-30 16:58:48,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14594 conditions, 3872 events. 2673/3872 cut-off events. For 9507/9522 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 18887 event pairs, 316 based on Foata normal form. 295/4164 useless extension candidates. Maximal degree in co-relation 14572. Up to 1935 conditions per place. [2023-08-30 16:58:48,301 INFO L137 encePairwiseOnDemand]: 262/269 looper letters, 110 selfloop transitions, 6 changer transitions 1/118 dead transitions. [2023-08-30 16:58:48,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 118 transitions, 997 flow [2023-08-30 16:58:48,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:58:48,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:58:48,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 547 transitions. [2023-08-30 16:58:48,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.508364312267658 [2023-08-30 16:58:48,304 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 547 transitions. [2023-08-30 16:58:48,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 547 transitions. [2023-08-30 16:58:48,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:48,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 547 transitions. [2023-08-30 16:58:48,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:48,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:48,308 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:48,308 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 309 flow. Second operand 4 states and 547 transitions. [2023-08-30 16:58:48,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 118 transitions, 997 flow [2023-08-30 16:58:48,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 118 transitions, 959 flow, removed 19 selfloop flow, removed 3 redundant places. [2023-08-30 16:58:48,320 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 337 flow [2023-08-30 16:58:48,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=337, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2023-08-30 16:58:48,321 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2023-08-30 16:58:48,321 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 337 flow [2023-08-30 16:58:48,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:48,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:48,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:58:48,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:58:48,322 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:58:48,322 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:48,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1405632035, now seen corresponding path program 1 times [2023-08-30 16:58:48,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:48,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928321488] [2023-08-30 16:58:48,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:48,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:58:49,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:58:49,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:58:49,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928321488] [2023-08-30 16:58:49,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928321488] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:58:49,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:58:49,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 16:58:49,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422903030] [2023-08-30 16:58:49,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:58:49,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 16:58:49,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:58:49,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 16:58:49,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-30 16:58:49,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 269 [2023-08-30 16:58:49,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 337 flow. Second operand has 9 states, 9 states have (on average 117.88888888888889) internal successors, (1061), 9 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:49,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:58:49,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 269 [2023-08-30 16:58:49,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:50,621 INFO L130 PetriNetUnfolder]: 2277/3347 cut-off events. [2023-08-30 16:58:50,621 INFO L131 PetriNetUnfolder]: For 7995/8049 co-relation queries the response was YES. [2023-08-30 16:58:50,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14088 conditions, 3347 events. 2277/3347 cut-off events. For 7995/8049 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 15940 event pairs, 823 based on Foata normal form. 140/3487 useless extension candidates. Maximal degree in co-relation 14065. Up to 2143 conditions per place. [2023-08-30 16:58:50,639 INFO L137 encePairwiseOnDemand]: 258/269 looper letters, 71 selfloop transitions, 28 changer transitions 24/124 dead transitions. [2023-08-30 16:58:50,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 124 transitions, 1004 flow [2023-08-30 16:58:50,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:58:50,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:58:50,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1018 transitions. [2023-08-30 16:58:50,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47304832713754646 [2023-08-30 16:58:50,643 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1018 transitions. [2023-08-30 16:58:50,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1018 transitions. [2023-08-30 16:58:50,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:50,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1018 transitions. [2023-08-30 16:58:50,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 127.25) internal successors, (1018), 8 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:50,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 269.0) internal successors, (2421), 9 states have internal predecessors, (2421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:50,650 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 269.0) internal successors, (2421), 9 states have internal predecessors, (2421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:50,650 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 337 flow. Second operand 8 states and 1018 transitions. [2023-08-30 16:58:50,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 124 transitions, 1004 flow [2023-08-30 16:58:50,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 124 transitions, 973 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-30 16:58:50,658 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 519 flow [2023-08-30 16:58:50,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=519, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2023-08-30 16:58:50,659 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2023-08-30 16:58:50,659 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 519 flow [2023-08-30 16:58:50,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 117.88888888888889) internal successors, (1061), 9 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:50,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:50,660 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:58:50,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:58:50,661 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:58:50,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:50,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1087541202, now seen corresponding path program 1 times [2023-08-30 16:58:50,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:50,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127140161] [2023-08-30 16:58:50,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:50,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:58:50,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:58:50,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:58:50,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127140161] [2023-08-30 16:58:50,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127140161] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:58:50,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:58:50,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:58:50,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176329032] [2023-08-30 16:58:50,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:58:50,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:58:50,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:58:50,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:58:50,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:58:50,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 269 [2023-08-30 16:58:50,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 519 flow. Second operand has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:50,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:58:50,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 269 [2023-08-30 16:58:50,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:51,429 INFO L130 PetriNetUnfolder]: 1593/2433 cut-off events. [2023-08-30 16:58:51,429 INFO L131 PetriNetUnfolder]: For 12648/12648 co-relation queries the response was YES. [2023-08-30 16:58:51,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11885 conditions, 2433 events. 1593/2433 cut-off events. For 12648/12648 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 11597 event pairs, 120 based on Foata normal form. 220/2650 useless extension candidates. Maximal degree in co-relation 11857. Up to 980 conditions per place. [2023-08-30 16:58:51,440 INFO L137 encePairwiseOnDemand]: 262/269 looper letters, 138 selfloop transitions, 10 changer transitions 1/150 dead transitions. [2023-08-30 16:58:51,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 150 transitions, 1570 flow [2023-08-30 16:58:51,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:58:51,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:58:51,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 684 transitions. [2023-08-30 16:58:51,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5085501858736059 [2023-08-30 16:58:51,443 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 684 transitions. [2023-08-30 16:58:51,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 684 transitions. [2023-08-30 16:58:51,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:51,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 684 transitions. [2023-08-30 16:58:51,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:51,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:51,448 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:51,448 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 519 flow. Second operand 5 states and 684 transitions. [2023-08-30 16:58:51,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 150 transitions, 1570 flow [2023-08-30 16:58:51,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 150 transitions, 1441 flow, removed 36 selfloop flow, removed 4 redundant places. [2023-08-30 16:58:51,458 INFO L231 Difference]: Finished difference. Result has 64 places, 67 transitions, 542 flow [2023-08-30 16:58:51,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=542, PETRI_PLACES=64, PETRI_TRANSITIONS=67} [2023-08-30 16:58:51,459 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2023-08-30 16:58:51,459 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 67 transitions, 542 flow [2023-08-30 16:58:51,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:51,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:51,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:58:51,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:58:51,460 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:58:51,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:51,461 INFO L85 PathProgramCache]: Analyzing trace with hash 499602359, now seen corresponding path program 1 times [2023-08-30 16:58:51,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:51,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427487916] [2023-08-30 16:58:51,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:51,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:58:51,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:58:51,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:58:51,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427487916] [2023-08-30 16:58:51,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427487916] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:58:51,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:58:51,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:58:51,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798991360] [2023-08-30 16:58:51,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:58:51,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:58:51,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:58:51,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:58:51,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:58:51,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 269 [2023-08-30 16:58:51,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 67 transitions, 542 flow. Second operand has 6 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:51,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:58:51,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 269 [2023-08-30 16:58:51,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:52,280 INFO L130 PetriNetUnfolder]: 893/1413 cut-off events. [2023-08-30 16:58:52,280 INFO L131 PetriNetUnfolder]: For 6898/6898 co-relation queries the response was YES. [2023-08-30 16:58:52,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7140 conditions, 1413 events. 893/1413 cut-off events. For 6898/6898 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6244 event pairs, 118 based on Foata normal form. 82/1492 useless extension candidates. Maximal degree in co-relation 7112. Up to 561 conditions per place. [2023-08-30 16:58:52,289 INFO L137 encePairwiseOnDemand]: 262/269 looper letters, 139 selfloop transitions, 14 changer transitions 1/155 dead transitions. [2023-08-30 16:58:52,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 155 transitions, 1555 flow [2023-08-30 16:58:52,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:58:52,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:58:52,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 817 transitions. [2023-08-30 16:58:52,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5061957868649318 [2023-08-30 16:58:52,292 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 817 transitions. [2023-08-30 16:58:52,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 817 transitions. [2023-08-30 16:58:52,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:52,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 817 transitions. [2023-08-30 16:58:52,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.16666666666666) internal successors, (817), 6 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:52,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:52,298 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:52,298 INFO L175 Difference]: Start difference. First operand has 64 places, 67 transitions, 542 flow. Second operand 6 states and 817 transitions. [2023-08-30 16:58:52,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 155 transitions, 1555 flow [2023-08-30 16:58:52,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 155 transitions, 1521 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-08-30 16:58:52,310 INFO L231 Difference]: Finished difference. Result has 67 places, 71 transitions, 596 flow [2023-08-30 16:58:52,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=596, PETRI_PLACES=67, PETRI_TRANSITIONS=71} [2023-08-30 16:58:52,311 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places. [2023-08-30 16:58:52,311 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 71 transitions, 596 flow [2023-08-30 16:58:52,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:52,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:52,312 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] [2023-08-30 16:58:52,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:58:52,312 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:58:52,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:52,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1615676936, now seen corresponding path program 1 times [2023-08-30 16:58:52,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:52,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470964107] [2023-08-30 16:58:52,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:52,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:58:54,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:58:54,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:58:54,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470964107] [2023-08-30 16:58:54,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470964107] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:58:54,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:58:54,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 16:58:54,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712717363] [2023-08-30 16:58:54,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:58:54,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 16:58:54,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:58:54,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 16:58:54,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-08-30 16:58:54,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 269 [2023-08-30 16:58:54,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 71 transitions, 596 flow. Second operand has 10 states, 10 states have (on average 119.2) internal successors, (1192), 10 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:54,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:58:54,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 269 [2023-08-30 16:58:54,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:55,150 INFO L130 PetriNetUnfolder]: 1130/1868 cut-off events. [2023-08-30 16:58:55,151 INFO L131 PetriNetUnfolder]: For 8177/8177 co-relation queries the response was YES. [2023-08-30 16:58:55,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9703 conditions, 1868 events. 1130/1868 cut-off events. For 8177/8177 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9657 event pairs, 167 based on Foata normal form. 7/1874 useless extension candidates. Maximal degree in co-relation 9674. Up to 774 conditions per place. [2023-08-30 16:58:55,160 INFO L137 encePairwiseOnDemand]: 259/269 looper letters, 136 selfloop transitions, 24 changer transitions 41/202 dead transitions. [2023-08-30 16:58:55,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 202 transitions, 2081 flow [2023-08-30 16:58:55,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 16:58:55,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 16:58:55,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1162 transitions. [2023-08-30 16:58:55,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47996695580338705 [2023-08-30 16:58:55,164 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1162 transitions. [2023-08-30 16:58:55,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1162 transitions. [2023-08-30 16:58:55,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:55,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1162 transitions. [2023-08-30 16:58:55,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 129.11111111111111) internal successors, (1162), 9 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:55,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 269.0) internal successors, (2690), 10 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:55,171 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 269.0) internal successors, (2690), 10 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:55,171 INFO L175 Difference]: Start difference. First operand has 67 places, 71 transitions, 596 flow. Second operand 9 states and 1162 transitions. [2023-08-30 16:58:55,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 202 transitions, 2081 flow [2023-08-30 16:58:55,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 202 transitions, 1812 flow, removed 57 selfloop flow, removed 6 redundant places. [2023-08-30 16:58:55,192 INFO L231 Difference]: Finished difference. Result has 74 places, 77 transitions, 691 flow [2023-08-30 16:58:55,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=691, PETRI_PLACES=74, PETRI_TRANSITIONS=77} [2023-08-30 16:58:55,193 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 33 predicate places. [2023-08-30 16:58:55,193 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 77 transitions, 691 flow [2023-08-30 16:58:55,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 119.2) internal successors, (1192), 10 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:55,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:55,194 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] [2023-08-30 16:58:55,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 16:58:55,194 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:58:55,194 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:55,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1846690688, now seen corresponding path program 2 times [2023-08-30 16:58:55,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:55,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494812651] [2023-08-30 16:58:55,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:55,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:58:55,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:58:55,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:58:55,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494812651] [2023-08-30 16:58:55,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494812651] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:58:55,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:58:55,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:58:55,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723264930] [2023-08-30 16:58:55,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:58:55,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:58:55,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:58:55,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:58:55,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:58:55,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 269 [2023-08-30 16:58:55,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 77 transitions, 691 flow. Second operand has 7 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:55,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:58:55,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 269 [2023-08-30 16:58:55,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:56,021 INFO L130 PetriNetUnfolder]: 998/1583 cut-off events. [2023-08-30 16:58:56,022 INFO L131 PetriNetUnfolder]: For 11157/11177 co-relation queries the response was YES. [2023-08-30 16:58:56,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8594 conditions, 1583 events. 998/1583 cut-off events. For 11157/11177 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7543 event pairs, 132 based on Foata normal form. 32/1613 useless extension candidates. Maximal degree in co-relation 8563. Up to 654 conditions per place. [2023-08-30 16:58:56,032 INFO L137 encePairwiseOnDemand]: 262/269 looper letters, 135 selfloop transitions, 18 changer transitions 1/155 dead transitions. [2023-08-30 16:58:56,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 155 transitions, 1772 flow [2023-08-30 16:58:56,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:58:56,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:58:56,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 929 transitions. [2023-08-30 16:58:56,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49336165693043016 [2023-08-30 16:58:56,036 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 929 transitions. [2023-08-30 16:58:56,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 929 transitions. [2023-08-30 16:58:56,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:56,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 929 transitions. [2023-08-30 16:58:56,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.71428571428572) internal successors, (929), 7 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:56,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 269.0) internal successors, (2152), 8 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:56,042 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 269.0) internal successors, (2152), 8 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:56,042 INFO L175 Difference]: Start difference. First operand has 74 places, 77 transitions, 691 flow. Second operand 7 states and 929 transitions. [2023-08-30 16:58:56,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 155 transitions, 1772 flow [2023-08-30 16:58:56,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 155 transitions, 1634 flow, removed 24 selfloop flow, removed 9 redundant places. [2023-08-30 16:58:56,061 INFO L231 Difference]: Finished difference. Result has 70 places, 74 transitions, 639 flow [2023-08-30 16:58:56,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=639, PETRI_PLACES=70, PETRI_TRANSITIONS=74} [2023-08-30 16:58:56,062 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 29 predicate places. [2023-08-30 16:58:56,062 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 74 transitions, 639 flow [2023-08-30 16:58:56,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:56,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:56,063 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] [2023-08-30 16:58:56,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 16:58:56,063 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:58:56,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:56,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1570755269, now seen corresponding path program 1 times [2023-08-30 16:58:56,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:56,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935204830] [2023-08-30 16:58:56,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:56,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:58:56,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:58:56,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:58:56,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935204830] [2023-08-30 16:58:56,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935204830] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:58:56,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:58:56,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 16:58:56,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731001544] [2023-08-30 16:58:56,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:58:56,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 16:58:56,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:58:56,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 16:58:56,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-30 16:58:56,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 269 [2023-08-30 16:58:56,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 74 transitions, 639 flow. Second operand has 8 states, 8 states have (on average 126.125) internal successors, (1009), 8 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:56,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:58:56,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 269 [2023-08-30 16:58:56,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:57,401 INFO L130 PetriNetUnfolder]: 2362/3680 cut-off events. [2023-08-30 16:58:57,401 INFO L131 PetriNetUnfolder]: For 19615/19615 co-relation queries the response was YES. [2023-08-30 16:58:57,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19477 conditions, 3680 events. 2362/3680 cut-off events. For 19615/19615 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 19786 event pairs, 318 based on Foata normal form. 3/3683 useless extension candidates. Maximal degree in co-relation 19449. Up to 1415 conditions per place. [2023-08-30 16:58:57,418 INFO L137 encePairwiseOnDemand]: 258/269 looper letters, 99 selfloop transitions, 46 changer transitions 99/244 dead transitions. [2023-08-30 16:58:57,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 244 transitions, 2631 flow [2023-08-30 16:58:57,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 16:58:57,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 16:58:57,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1583 transitions. [2023-08-30 16:58:57,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49039653035935565 [2023-08-30 16:58:57,425 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1583 transitions. [2023-08-30 16:58:57,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1583 transitions. [2023-08-30 16:58:57,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:57,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1583 transitions. [2023-08-30 16:58:57,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 131.91666666666666) internal successors, (1583), 12 states have internal predecessors, (1583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:57,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 269.0) internal successors, (3497), 13 states have internal predecessors, (3497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:57,434 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 269.0) internal successors, (3497), 13 states have internal predecessors, (3497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:57,434 INFO L175 Difference]: Start difference. First operand has 70 places, 74 transitions, 639 flow. Second operand 12 states and 1583 transitions. [2023-08-30 16:58:57,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 244 transitions, 2631 flow [2023-08-30 16:58:57,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 244 transitions, 2054 flow, removed 115 selfloop flow, removed 11 redundant places. [2023-08-30 16:58:57,485 INFO L231 Difference]: Finished difference. Result has 77 places, 89 transitions, 849 flow [2023-08-30 16:58:57,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=849, PETRI_PLACES=77, PETRI_TRANSITIONS=89} [2023-08-30 16:58:57,485 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 36 predicate places. [2023-08-30 16:58:57,486 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 89 transitions, 849 flow [2023-08-30 16:58:57,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 126.125) internal successors, (1009), 8 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:57,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:57,486 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] [2023-08-30 16:58:57,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 16:58:57,487 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:58:57,487 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:57,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1814161711, now seen corresponding path program 2 times [2023-08-30 16:58:57,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:57,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157075379] [2023-08-30 16:58:57,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:57,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:59:00,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:59:00,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:59:00,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157075379] [2023-08-30 16:59:00,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157075379] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:59:00,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:59:00,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-08-30 16:59:00,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572278119] [2023-08-30 16:59:00,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:59:00,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-30 16:59:00,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:59:00,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-30 16:59:00,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-08-30 16:59:00,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 269 [2023-08-30 16:59:00,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 89 transitions, 849 flow. Second operand has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:00,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:59:00,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 269 [2023-08-30 16:59:00,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:59:01,777 INFO L130 PetriNetUnfolder]: 1667/2812 cut-off events. [2023-08-30 16:59:01,778 INFO L131 PetriNetUnfolder]: For 11942/11969 co-relation queries the response was YES. [2023-08-30 16:59:01,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12919 conditions, 2812 events. 1667/2812 cut-off events. For 11942/11969 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 16054 event pairs, 427 based on Foata normal form. 19/2817 useless extension candidates. Maximal degree in co-relation 12890. Up to 1017 conditions per place. [2023-08-30 16:59:01,791 INFO L137 encePairwiseOnDemand]: 262/269 looper letters, 100 selfloop transitions, 17 changer transitions 81/199 dead transitions. [2023-08-30 16:59:01,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 199 transitions, 1781 flow [2023-08-30 16:59:01,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 16:59:01,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 16:59:01,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1208 transitions. [2023-08-30 16:59:01,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4490706319702602 [2023-08-30 16:59:01,796 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1208 transitions. [2023-08-30 16:59:01,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1208 transitions. [2023-08-30 16:59:01,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:59:01,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1208 transitions. [2023-08-30 16:59:01,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 120.8) internal successors, (1208), 10 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:01,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 269.0) internal successors, (2959), 11 states have internal predecessors, (2959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:01,803 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 269.0) internal successors, (2959), 11 states have internal predecessors, (2959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:01,803 INFO L175 Difference]: Start difference. First operand has 77 places, 89 transitions, 849 flow. Second operand 10 states and 1208 transitions. [2023-08-30 16:59:01,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 199 transitions, 1781 flow [2023-08-30 16:59:01,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 199 transitions, 1749 flow, removed 13 selfloop flow, removed 6 redundant places. [2023-08-30 16:59:01,816 INFO L231 Difference]: Finished difference. Result has 82 places, 79 transitions, 778 flow [2023-08-30 16:59:01,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=778, PETRI_PLACES=82, PETRI_TRANSITIONS=79} [2023-08-30 16:59:01,817 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 41 predicate places. [2023-08-30 16:59:01,817 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 79 transitions, 778 flow [2023-08-30 16:59:01,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:01,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:59:01,818 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] [2023-08-30 16:59:01,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 16:59:01,819 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:59:01,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:59:01,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1895776631, now seen corresponding path program 3 times [2023-08-30 16:59:01,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:59:01,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652429234] [2023-08-30 16:59:01,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:59:01,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:59:01,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:59:05,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:59:05,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:59:05,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652429234] [2023-08-30 16:59:05,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652429234] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:59:05,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:59:05,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-08-30 16:59:05,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326343735] [2023-08-30 16:59:05,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:59:05,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-30 16:59:05,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:59:05,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-30 16:59:05,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-08-30 16:59:06,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 269 [2023-08-30 16:59:06,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 79 transitions, 778 flow. Second operand has 12 states, 12 states have (on average 113.0) internal successors, (1356), 12 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:06,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:59:06,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 269 [2023-08-30 16:59:06,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:59:07,101 INFO L130 PetriNetUnfolder]: 1336/2289 cut-off events. [2023-08-30 16:59:07,101 INFO L131 PetriNetUnfolder]: For 14021/14044 co-relation queries the response was YES. [2023-08-30 16:59:07,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11368 conditions, 2289 events. 1336/2289 cut-off events. For 14021/14044 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 12857 event pairs, 211 based on Foata normal form. 17/2298 useless extension candidates. Maximal degree in co-relation 11336. Up to 1135 conditions per place. [2023-08-30 16:59:07,110 INFO L137 encePairwiseOnDemand]: 261/269 looper letters, 124 selfloop transitions, 38 changer transitions 42/205 dead transitions. [2023-08-30 16:59:07,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 205 transitions, 1866 flow [2023-08-30 16:59:07,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 16:59:07,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 16:59:07,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1323 transitions. [2023-08-30 16:59:07,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44711051030753635 [2023-08-30 16:59:07,122 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1323 transitions. [2023-08-30 16:59:07,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1323 transitions. [2023-08-30 16:59:07,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:59:07,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1323 transitions. [2023-08-30 16:59:07,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 120.27272727272727) internal successors, (1323), 11 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:07,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 269.0) internal successors, (3228), 12 states have internal predecessors, (3228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:07,130 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 269.0) internal successors, (3228), 12 states have internal predecessors, (3228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:07,130 INFO L175 Difference]: Start difference. First operand has 82 places, 79 transitions, 778 flow. Second operand 11 states and 1323 transitions. [2023-08-30 16:59:07,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 205 transitions, 1866 flow [2023-08-30 16:59:07,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 205 transitions, 1782 flow, removed 36 selfloop flow, removed 8 redundant places. [2023-08-30 16:59:07,150 INFO L231 Difference]: Finished difference. Result has 85 places, 89 transitions, 1003 flow [2023-08-30 16:59:07,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1003, PETRI_PLACES=85, PETRI_TRANSITIONS=89} [2023-08-30 16:59:07,151 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 44 predicate places. [2023-08-30 16:59:07,151 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 89 transitions, 1003 flow [2023-08-30 16:59:07,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 113.0) internal successors, (1356), 12 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:07,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:59:07,152 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] [2023-08-30 16:59:07,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 16:59:07,153 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:59:07,153 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:59:07,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1096710029, now seen corresponding path program 4 times [2023-08-30 16:59:07,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:59:07,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657255466] [2023-08-30 16:59:07,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:59:07,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:59:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:59:09,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:59:09,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:59:09,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657255466] [2023-08-30 16:59:09,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657255466] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:59:09,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:59:09,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-30 16:59:09,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11271430] [2023-08-30 16:59:09,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:59:09,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 16:59:09,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:59:09,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 16:59:09,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-08-30 16:59:09,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 269 [2023-08-30 16:59:09,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 89 transitions, 1003 flow. Second operand has 11 states, 11 states have (on average 118.18181818181819) internal successors, (1300), 11 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:09,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:59:09,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 269 [2023-08-30 16:59:09,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:59:10,263 INFO L130 PetriNetUnfolder]: 1602/2785 cut-off events. [2023-08-30 16:59:10,264 INFO L131 PetriNetUnfolder]: For 18790/18813 co-relation queries the response was YES. [2023-08-30 16:59:10,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14030 conditions, 2785 events. 1602/2785 cut-off events. For 18790/18813 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 16728 event pairs, 256 based on Foata normal form. 16/2790 useless extension candidates. Maximal degree in co-relation 13997. Up to 1308 conditions per place. [2023-08-30 16:59:10,274 INFO L137 encePairwiseOnDemand]: 258/269 looper letters, 146 selfloop transitions, 40 changer transitions 11/198 dead transitions. [2023-08-30 16:59:10,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 198 transitions, 1951 flow [2023-08-30 16:59:10,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 16:59:10,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 16:59:10,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1249 transitions. [2023-08-30 16:59:10,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46431226765799255 [2023-08-30 16:59:10,277 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1249 transitions. [2023-08-30 16:59:10,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1249 transitions. [2023-08-30 16:59:10,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:59:10,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1249 transitions. [2023-08-30 16:59:10,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 124.9) internal successors, (1249), 10 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:10,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 269.0) internal successors, (2959), 11 states have internal predecessors, (2959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:10,284 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 269.0) internal successors, (2959), 11 states have internal predecessors, (2959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:10,284 INFO L175 Difference]: Start difference. First operand has 85 places, 89 transitions, 1003 flow. Second operand 10 states and 1249 transitions. [2023-08-30 16:59:10,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 198 transitions, 1951 flow [2023-08-30 16:59:10,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 198 transitions, 1895 flow, removed 28 selfloop flow, removed 4 redundant places. [2023-08-30 16:59:10,307 INFO L231 Difference]: Finished difference. Result has 92 places, 102 transitions, 1220 flow [2023-08-30 16:59:10,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=971, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1220, PETRI_PLACES=92, PETRI_TRANSITIONS=102} [2023-08-30 16:59:10,307 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 51 predicate places. [2023-08-30 16:59:10,308 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 102 transitions, 1220 flow [2023-08-30 16:59:10,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 118.18181818181819) internal successors, (1300), 11 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:10,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:59:10,308 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] [2023-08-30 16:59:10,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 16:59:10,309 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:59:10,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:59:10,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1818811859, now seen corresponding path program 5 times [2023-08-30 16:59:10,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:59:10,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275469993] [2023-08-30 16:59:10,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:59:10,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:59:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:59:12,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:59:12,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:59:12,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275469993] [2023-08-30 16:59:12,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275469993] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:59:12,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:59:12,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-08-30 16:59:12,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352629154] [2023-08-30 16:59:12,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:59:12,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-30 16:59:12,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:59:12,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-30 16:59:12,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-08-30 16:59:13,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 269 [2023-08-30 16:59:13,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 102 transitions, 1220 flow. Second operand has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:13,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:59:13,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 269 [2023-08-30 16:59:13,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:59:13,983 INFO L130 PetriNetUnfolder]: 2103/3670 cut-off events. [2023-08-30 16:59:13,983 INFO L131 PetriNetUnfolder]: For 28559/28582 co-relation queries the response was YES. [2023-08-30 16:59:13,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19319 conditions, 3670 events. 2103/3670 cut-off events. For 28559/28582 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 23093 event pairs, 471 based on Foata normal form. 24/3681 useless extension candidates. Maximal degree in co-relation 19282. Up to 2466 conditions per place. [2023-08-30 16:59:13,997 INFO L137 encePairwiseOnDemand]: 258/269 looper letters, 158 selfloop transitions, 52 changer transitions 19/230 dead transitions. [2023-08-30 16:59:13,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 230 transitions, 2737 flow [2023-08-30 16:59:13,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 16:59:13,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 16:59:14,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1355 transitions. [2023-08-30 16:59:14,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4579249746535992 [2023-08-30 16:59:14,001 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1355 transitions. [2023-08-30 16:59:14,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1355 transitions. [2023-08-30 16:59:14,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:59:14,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1355 transitions. [2023-08-30 16:59:14,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 123.18181818181819) internal successors, (1355), 11 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:14,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 269.0) internal successors, (3228), 12 states have internal predecessors, (3228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:14,008 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 269.0) internal successors, (3228), 12 states have internal predecessors, (3228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:14,008 INFO L175 Difference]: Start difference. First operand has 92 places, 102 transitions, 1220 flow. Second operand 11 states and 1355 transitions. [2023-08-30 16:59:14,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 230 transitions, 2737 flow [2023-08-30 16:59:14,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 230 transitions, 2602 flow, removed 45 selfloop flow, removed 4 redundant places. [2023-08-30 16:59:14,073 INFO L231 Difference]: Finished difference. Result has 103 places, 137 transitions, 1829 flow [2023-08-30 16:59:14,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1829, PETRI_PLACES=103, PETRI_TRANSITIONS=137} [2023-08-30 16:59:14,074 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 62 predicate places. [2023-08-30 16:59:14,074 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 137 transitions, 1829 flow [2023-08-30 16:59:14,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:14,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:59:14,075 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] [2023-08-30 16:59:14,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 16:59:14,075 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:59:14,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:59:14,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1745075755, now seen corresponding path program 6 times [2023-08-30 16:59:14,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:59:14,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83339411] [2023-08-30 16:59:14,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:59:14,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:59:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:59:16,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:59:16,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:59:16,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83339411] [2023-08-30 16:59:16,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83339411] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:59:16,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:59:16,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-30 16:59:16,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556148758] [2023-08-30 16:59:16,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:59:16,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 16:59:16,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:59:16,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 16:59:16,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-08-30 16:59:16,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 269 [2023-08-30 16:59:16,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 137 transitions, 1829 flow. Second operand has 11 states, 11 states have (on average 117.18181818181819) internal successors, (1289), 11 states have internal predecessors, (1289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:16,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:59:16,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 269 [2023-08-30 16:59:16,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:59:17,225 INFO L130 PetriNetUnfolder]: 2197/3866 cut-off events. [2023-08-30 16:59:17,225 INFO L131 PetriNetUnfolder]: For 30448/30451 co-relation queries the response was YES. [2023-08-30 16:59:17,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20314 conditions, 3866 events. 2197/3866 cut-off events. For 30448/30451 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 24786 event pairs, 488 based on Foata normal form. 2/3853 useless extension candidates. Maximal degree in co-relation 20271. Up to 2668 conditions per place. [2023-08-30 16:59:17,240 INFO L137 encePairwiseOnDemand]: 260/269 looper letters, 129 selfloop transitions, 42 changer transitions 35/207 dead transitions. [2023-08-30 16:59:17,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 207 transitions, 2668 flow [2023-08-30 16:59:17,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:59:17,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:59:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 996 transitions. [2023-08-30 16:59:17,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4628252788104089 [2023-08-30 16:59:17,243 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 996 transitions. [2023-08-30 16:59:17,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 996 transitions. [2023-08-30 16:59:17,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:59:17,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 996 transitions. [2023-08-30 16:59:17,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 124.5) internal successors, (996), 8 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:17,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 269.0) internal successors, (2421), 9 states have internal predecessors, (2421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:17,247 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 269.0) internal successors, (2421), 9 states have internal predecessors, (2421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:17,247 INFO L175 Difference]: Start difference. First operand has 103 places, 137 transitions, 1829 flow. Second operand 8 states and 996 transitions. [2023-08-30 16:59:17,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 207 transitions, 2668 flow [2023-08-30 16:59:17,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 207 transitions, 2584 flow, removed 42 selfloop flow, removed 1 redundant places. [2023-08-30 16:59:17,316 INFO L231 Difference]: Finished difference. Result has 112 places, 134 transitions, 1824 flow [2023-08-30 16:59:17,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=1755, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1824, PETRI_PLACES=112, PETRI_TRANSITIONS=134} [2023-08-30 16:59:17,316 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 71 predicate places. [2023-08-30 16:59:17,316 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 134 transitions, 1824 flow [2023-08-30 16:59:17,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 117.18181818181819) internal successors, (1289), 11 states have internal predecessors, (1289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:17,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:59:17,317 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] [2023-08-30 16:59:17,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 16:59:17,318 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:59:17,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:59:17,318 INFO L85 PathProgramCache]: Analyzing trace with hash -956476461, now seen corresponding path program 7 times [2023-08-30 16:59:17,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:59:17,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3947569] [2023-08-30 16:59:17,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:59:17,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:59:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:59:17,430 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:59:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:59:17,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:59:17,579 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:59:17,580 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-30 16:59:17,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-30 16:59:17,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-30 16:59:17,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-30 16:59:17,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-30 16:59:17,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-30 16:59:17,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-30 16:59:17,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-30 16:59:17,585 INFO L445 BasicCegarLoop]: Path program histogram: [7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:59:17,590 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:59:17,590 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:59:17,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:59:17 BasicIcfg [2023-08-30 16:59:17,697 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:59:17,697 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:59:17,697 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:59:17,698 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:59:17,698 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:58:28" (3/4) ... [2023-08-30 16:59:17,699 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:59:17,795 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:59:17,795 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:59:17,796 INFO L158 Benchmark]: Toolchain (without parser) took 51207.99ms. Allocated memory was 71.3MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 40.6MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 157.8MB. Max. memory is 16.1GB. [2023-08-30 16:59:17,796 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 71.3MB. Free memory is still 49.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:59:17,796 INFO L158 Benchmark]: CACSL2BoogieTranslator took 574.64ms. Allocated memory was 71.3MB in the beginning and 96.5MB in the end (delta: 25.2MB). Free memory was 40.3MB in the beginning and 62.4MB in the end (delta: -22.1MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2023-08-30 16:59:17,797 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.28ms. Allocated memory is still 96.5MB. Free memory was 62.4MB in the beginning and 59.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 16:59:17,797 INFO L158 Benchmark]: Boogie Preprocessor took 35.32ms. Allocated memory is still 96.5MB. Free memory was 59.5MB in the beginning and 56.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:59:17,797 INFO L158 Benchmark]: RCFGBuilder took 1121.10ms. Allocated memory is still 96.5MB. Free memory was 56.9MB in the beginning and 54.2MB in the end (delta: 2.7MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2023-08-30 16:59:17,797 INFO L158 Benchmark]: TraceAbstraction took 49327.39ms. Allocated memory was 96.5MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 53.6MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 122.8MB. Max. memory is 16.1GB. [2023-08-30 16:59:17,798 INFO L158 Benchmark]: Witness Printer took 97.94ms. Allocated memory is still 1.6GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-08-30 16:59:17,800 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.18ms. Allocated memory is still 71.3MB. Free memory is still 49.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 574.64ms. Allocated memory was 71.3MB in the beginning and 96.5MB in the end (delta: 25.2MB). Free memory was 40.3MB in the beginning and 62.4MB in the end (delta: -22.1MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.28ms. Allocated memory is still 96.5MB. Free memory was 62.4MB in the beginning and 59.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.32ms. Allocated memory is still 96.5MB. Free memory was 59.5MB in the beginning and 56.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1121.10ms. Allocated memory is still 96.5MB. Free memory was 56.9MB in the beginning and 54.2MB in the end (delta: 2.7MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * TraceAbstraction took 49327.39ms. Allocated memory was 96.5MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 53.6MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 122.8MB. Max. memory is 16.1GB. * Witness Printer took 97.94ms. Allocated memory is still 1.6GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.8s, 153 PlacesBefore, 41 PlacesAfterwards, 142 TransitionsBefore, 29 TransitionsAfterwards, 2664 CoEnabledTransitionPairs, 8 FixpointIterations, 62 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 123 TotalNumberOfCompositions, 7003 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2869, independent: 2632, independent conditional: 0, independent unconditional: 2632, dependent: 237, dependent conditional: 0, dependent unconditional: 237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1358, independent: 1316, independent conditional: 0, independent unconditional: 1316, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2869, independent: 1316, independent conditional: 0, independent unconditional: 1316, dependent: 195, dependent conditional: 0, dependent unconditional: 195, unknown: 1358, unknown conditional: 0, unknown unconditional: 1358] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 93, Positive conditional cache size: 0, Positive unconditional cache size: 93, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p0_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L718] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L719] 0 int __unbuffered_p2_EAX$mem_tmp; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L727] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L728] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L729] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L730] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L731] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L732] 0 int __unbuffered_p2_EAX$w_buff0; [L733] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L734] 0 int __unbuffered_p2_EAX$w_buff1; [L735] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L737] 0 int __unbuffered_p2_EBX = 0; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L742] 0 _Bool x$flush_delayed; [L743] 0 int x$mem_tmp; [L744] 0 _Bool x$r_buff0_thd0; [L745] 0 _Bool x$r_buff0_thd1; [L746] 0 _Bool x$r_buff0_thd2; [L747] 0 _Bool x$r_buff0_thd3; [L748] 0 _Bool x$r_buff0_thd4; [L749] 0 _Bool x$r_buff1_thd0; [L750] 0 _Bool x$r_buff1_thd1; [L751] 0 _Bool x$r_buff1_thd2; [L752] 0 _Bool x$r_buff1_thd3; [L753] 0 _Bool x$r_buff1_thd4; [L754] 0 _Bool x$read_delayed; [L755] 0 int *x$read_delayed_var; [L756] 0 int x$w_buff0; [L757] 0 _Bool x$w_buff0_used; [L758] 0 int x$w_buff1; [L759] 0 _Bool x$w_buff1_used; [L761] 0 int y = 0; [L762] 0 _Bool weak$$choice0; [L763] 0 _Bool weak$$choice1; [L764] 0 _Bool weak$$choice2; [L884] 0 pthread_t t2421; [L885] FCALL, FORK 0 pthread_create(&t2421, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2421, ((void *)0), P0, ((void *)0))=-3, t2421={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L886] 0 pthread_t t2422; [L887] FCALL, FORK 0 pthread_create(&t2422, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2422, ((void *)0), P1, ((void *)0))=-2, t2421={6:0}, t2422={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L888] 0 pthread_t t2423; [L889] FCALL, FORK 0 pthread_create(&t2423, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2423, ((void *)0), P2, ((void *)0))=-1, t2421={6:0}, t2422={7:0}, t2423={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L890] 0 pthread_t t2424; [L891] FCALL, FORK 0 pthread_create(&t2424, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2424, ((void *)0), P3, ((void *)0))=0, t2421={6:0}, t2422={7:0}, t2423={8:0}, t2424={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L796] 2 x$w_buff1 = x$w_buff0 [L797] 2 x$w_buff0 = 1 [L798] 2 x$w_buff1_used = x$w_buff0_used [L799] 2 x$w_buff0_used = (_Bool)1 [L800] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L800] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L801] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L802] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L803] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L804] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L805] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L806] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L823] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 3 x$flush_delayed = weak$$choice2 [L826] EXPR 3 \read(x) [L826] 3 x$mem_tmp = x [L827] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L828] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L828] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L828] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L828] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L828] EXPR 3 \read(x) [L828] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L828] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L828] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L828] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L828] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L829] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L830] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L831] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L832] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L833] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L834] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L835] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L836] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L837] EXPR 3 \read(x) [L837] 3 __unbuffered_p2_EAX = x [L838] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L838] 3 x = x$flush_delayed ? x$mem_tmp : x [L839] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L842] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L859] 4 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L768] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L845] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L845] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L845] EXPR 3 \read(x) [L845] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L845] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L845] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L846] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L847] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L848] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L849] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L852] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L854] 3 return 0; [L862] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L862] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L862] EXPR 4 \read(x) [L862] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L862] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L862] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L863] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L864] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L865] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L866] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L771] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 1 x$flush_delayed = weak$$choice2 [L774] EXPR 1 \read(x) [L774] 1 x$mem_tmp = x [L775] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L775] EXPR 1 \read(x) [L775] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L775] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L776] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L777] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L778] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L779] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L780] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L781] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 1 \read(x) [L782] 1 __unbuffered_p0_EBX = x [L783] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L783] EXPR 1 \read(x) [L783] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L783] 1 x = x$flush_delayed ? x$mem_tmp : x [L784] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L809] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L809] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L810] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L811] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L812] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L813] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, 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$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L869] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L871] 4 return 0; [L789] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 1 return 0; [L893] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, 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, t2421={6:0}, t2422={7:0}, t2423={8:0}, t2424={5:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L895] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L895] RET 0 assume_abort_if_not(main$tmp_guard0) [L897] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L897] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L897] EXPR 0 \read(x) [L897] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L897] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L897] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L898] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L899] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L900] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L901] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, 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, t2421={6:0}, t2422={7:0}, t2423={8:0}, t2424={5:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L904] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L905] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L905] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L905] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L905] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L905] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L905] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L906] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L908] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 887]: 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: 885]: 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: 891]: 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: 889]: 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, 179 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: 49.1s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 18.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2517 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2082 mSDsluCounter, 3712 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3375 mSDsCounter, 668 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8906 IncrementalHoareTripleChecker+Invalid, 9574 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 668 mSolverCounterUnsat, 337 mSDtfsCounter, 8906 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1829occurred in iteration=17, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 20.9s InterpolantComputationTime, 364 NumberOfCodeBlocks, 364 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 321 ConstructedInterpolants, 0 QuantifiedInterpolants, 7003 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-30 16:59:17,833 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