./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8943650a21e052edc6a6af145da55799620df509a78c8e503eca6167eaa2f8fc --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 09:46:09,804 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:46:09,806 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:46:09,848 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:46:09,849 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:46:09,852 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:46:09,854 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:46:09,856 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:46:09,858 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:46:09,862 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:46:09,863 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:46:09,866 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:46:09,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:46:09,868 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:46:09,869 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:46:09,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:46:09,874 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:46:09,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:46:09,877 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:46:09,881 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:46:09,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:46:09,883 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:46:09,885 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:46:09,886 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:46:09,893 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:46:09,893 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:46:09,894 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:46:09,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:46:09,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:46:09,897 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:46:09,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:46:09,898 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:46:09,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:46:09,900 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:46:09,901 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:46:09,901 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:46:09,902 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:46:09,902 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:46:09,902 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:46:09,903 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:46:09,903 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:46:09,905 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 09:46:09,940 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:46:09,940 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:46:09,941 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:46:09,942 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:46:09,942 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:46:09,943 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:46:09,943 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:46:09,943 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:46:09,944 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:46:09,944 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:46:09,945 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:46:09,945 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:46:09,945 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:46:09,945 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:46:09,946 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:46:09,946 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:46:09,946 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:46:09,946 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:46:09,946 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:46:09,947 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:46:09,947 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:46:09,947 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:46:09,947 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:46:09,948 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:46:09,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:46:09,948 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:46:09,948 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:46:09,949 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:46:09,949 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:46:09,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:46:09,949 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:46:09,949 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:46:09,950 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:46:09,950 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:46:09,950 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:46:09,950 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 -> 8943650a21e052edc6a6af145da55799620df509a78c8e503eca6167eaa2f8fc Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 09:46:10,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:46:10,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:46:10,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:46:10,289 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:46:10,289 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:46:10,291 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i [2023-09-01 09:46:11,539 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:46:11,766 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:46:11,767 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i [2023-09-01 09:46:11,778 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/826ed4d3c/c210c37fd051410c94fd49b329461b6c/FLAG5fbd94c0f [2023-09-01 09:46:11,791 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/826ed4d3c/c210c37fd051410c94fd49b329461b6c [2023-09-01 09:46:11,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:46:11,798 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:46:11,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:46:11,799 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:46:11,803 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:46:11,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:46:11" (1/1) ... [2023-09-01 09:46:11,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e90d235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:11, skipping insertion in model container [2023-09-01 09:46:11,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:46:11" (1/1) ... [2023-09-01 09:46:11,808 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:46:11,864 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:46:12,043 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/mix021_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-09-01 09:46:12,266 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:46:12,283 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:46:12,295 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/mix021_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-09-01 09:46:12,357 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:46:12,390 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:46:12,390 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:46:12,396 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:46:12,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:12 WrapperNode [2023-09-01 09:46:12,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:46:12,397 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:46:12,398 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:46:12,398 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:46:12,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:12" (1/1) ... [2023-09-01 09:46:12,430 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:12" (1/1) ... [2023-09-01 09:46:12,468 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-09-01 09:46:12,468 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:46:12,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:46:12,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:46:12,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:46:12,478 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:12" (1/1) ... [2023-09-01 09:46:12,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:12" (1/1) ... [2023-09-01 09:46:12,494 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:12" (1/1) ... [2023-09-01 09:46:12,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:12" (1/1) ... [2023-09-01 09:46:12,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:12" (1/1) ... [2023-09-01 09:46:12,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:12" (1/1) ... [2023-09-01 09:46:12,514 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:12" (1/1) ... [2023-09-01 09:46:12,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:12" (1/1) ... [2023-09-01 09:46:12,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:46:12,520 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:46:12,521 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:46:12,521 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:46:12,521 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:12" (1/1) ... [2023-09-01 09:46:12,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:46:12,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:46:12,546 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-01 09:46:12,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-01 09:46:12,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:46:12,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:46:12,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:46:12,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:46:12,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:46:12,570 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:46:12,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:46:12,570 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:46:12,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:46:12,571 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-09-01 09:46:12,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-09-01 09:46:12,571 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-09-01 09:46:12,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-09-01 09:46:12,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:46:12,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:46:12,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:46:12,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:46:12,573 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 09:46:12,783 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:46:12,784 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:46:13,042 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:46:13,158 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:46:13,158 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:46:13,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:46:13 BoogieIcfgContainer [2023-09-01 09:46:13,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:46:13,163 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:46:13,163 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:46:13,166 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:46:13,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:46:11" (1/3) ... [2023-09-01 09:46:13,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@509e64bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:46:13, skipping insertion in model container [2023-09-01 09:46:13,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:12" (2/3) ... [2023-09-01 09:46:13,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@509e64bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:46:13, skipping insertion in model container [2023-09-01 09:46:13,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:46:13" (3/3) ... [2023-09-01 09:46:13,169 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021_power.oepc_pso.oepc_rmo.oepc.i [2023-09-01 09:46:13,175 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:46:13,181 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:46:13,181 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-01 09:46:13,181 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:46:13,243 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:46:13,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2023-09-01 09:46:13,322 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2023-09-01 09:46:13,323 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:46:13,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-09-01 09:46:13,328 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2023-09-01 09:46:13,332 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2023-09-01 09:46:13,334 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:46:13,350 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2023-09-01 09:46:13,352 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2023-09-01 09:46:13,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2023-09-01 09:46:13,376 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2023-09-01 09:46:13,376 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:46:13,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-09-01 09:46:13,379 INFO L119 LiptonReduction]: Number of co-enabled transitions 3164 [2023-09-01 09:46:17,469 INFO L134 LiptonReduction]: Checked pairs total: 9510 [2023-09-01 09:46:17,469 INFO L136 LiptonReduction]: Total number of compositions: 107 [2023-09-01 09:46:17,488 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:46:17,493 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;@7ca41551, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:46:17,494 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-09-01 09:46:17,496 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2023-09-01 09:46:17,496 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:46:17,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:17,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 09:46:17,498 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:46:17,501 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:17,502 INFO L85 PathProgramCache]: Analyzing trace with hash 545563, now seen corresponding path program 1 times [2023-09-01 09:46:17,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:17,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782618973] [2023-09-01 09:46:17,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:17,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:17,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:46:17,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:17,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782618973] [2023-09-01 09:46:17,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782618973] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:17,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:17,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:46:17,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677725380] [2023-09-01 09:46:17,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:17,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:46:17,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:17,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:46:17,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:46:17,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 237 [2023-09-01 09:46:17,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:17,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:17,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 237 [2023-09-01 09:46:17,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:19,021 INFO L130 PetriNetUnfolder]: 4903/7134 cut-off events. [2023-09-01 09:46:19,021 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2023-09-01 09:46:19,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13982 conditions, 7134 events. 4903/7134 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 42420 event pairs, 895 based on Foata normal form. 0/6798 useless extension candidates. Maximal degree in co-relation 13970. Up to 5335 conditions per place. [2023-09-01 09:46:19,064 INFO L137 encePairwiseOnDemand]: 233/237 looper letters, 41 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2023-09-01 09:46:19,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 209 flow [2023-09-01 09:46:19,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:46:19,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:46:19,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2023-09-01 09:46:19,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5485232067510548 [2023-09-01 09:46:19,083 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 390 transitions. [2023-09-01 09:46:19,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions. [2023-09-01 09:46:19,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:19,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions. [2023-09-01 09:46:19,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:19,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:19,099 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:19,101 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 390 transitions. [2023-09-01 09:46:19,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 209 flow [2023-09-01 09:46:19,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 202 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 09:46:19,108 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-09-01 09:46:19,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-09-01 09:46:19,113 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-09-01 09:46:19,114 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-09-01 09:46:19,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:19,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:19,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:46:19,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:46:19,118 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:46:19,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:19,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1762563186, now seen corresponding path program 1 times [2023-09-01 09:46:19,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:19,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962225802] [2023-09-01 09:46:19,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:19,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:19,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:46:19,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:19,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962225802] [2023-09-01 09:46:19,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962225802] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:19,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:19,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:46:19,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717669630] [2023-09-01 09:46:19,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:19,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:46:19,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:19,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:46:19,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:46:19,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 237 [2023-09-01 09:46:19,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:19,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:19,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 237 [2023-09-01 09:46:19,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:21,739 INFO L130 PetriNetUnfolder]: 16243/22100 cut-off events. [2023-09-01 09:46:21,739 INFO L131 PetriNetUnfolder]: For 1019/1019 co-relation queries the response was YES. [2023-09-01 09:46:21,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45716 conditions, 22100 events. 16243/22100 cut-off events. For 1019/1019 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 117083 event pairs, 5739 based on Foata normal form. 634/22734 useless extension candidates. Maximal degree in co-relation 45706. Up to 13082 conditions per place. [2023-09-01 09:46:21,855 INFO L137 encePairwiseOnDemand]: 228/237 looper letters, 43 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2023-09-01 09:46:21,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 51 transitions, 222 flow [2023-09-01 09:46:21,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:46:21,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:46:21,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2023-09-01 09:46:21,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5119549929676512 [2023-09-01 09:46:21,857 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2023-09-01 09:46:21,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2023-09-01 09:46:21,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:21,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2023-09-01 09:46:21,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:21,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:21,861 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:21,861 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 364 transitions. [2023-09-01 09:46:21,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 51 transitions, 222 flow [2023-09-01 09:46:21,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:46:21,864 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 126 flow [2023-09-01 09:46:21,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2023-09-01 09:46:21,865 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2023-09-01 09:46:21,865 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 126 flow [2023-09-01 09:46:21,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:21,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:21,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:46:21,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:46:21,866 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:46:21,866 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:21,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1195115225, now seen corresponding path program 1 times [2023-09-01 09:46:21,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:21,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102229336] [2023-09-01 09:46:21,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:21,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:22,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:46:22,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:22,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102229336] [2023-09-01 09:46:22,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102229336] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:22,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:22,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:46:22,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749357667] [2023-09-01 09:46:22,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:22,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:46:22,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:22,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:46:22,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:46:22,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 237 [2023-09-01 09:46:22,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:22,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:22,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 237 [2023-09-01 09:46:22,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:24,125 INFO L130 PetriNetUnfolder]: 15857/21580 cut-off events. [2023-09-01 09:46:24,125 INFO L131 PetriNetUnfolder]: For 8506/8506 co-relation queries the response was YES. [2023-09-01 09:46:24,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54543 conditions, 21580 events. 15857/21580 cut-off events. For 8506/8506 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 116944 event pairs, 1172 based on Foata normal form. 50/21630 useless extension candidates. Maximal degree in co-relation 54531. Up to 12236 conditions per place. [2023-09-01 09:46:24,215 INFO L137 encePairwiseOnDemand]: 228/237 looper letters, 61 selfloop transitions, 12 changer transitions 0/73 dead transitions. [2023-09-01 09:46:24,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 73 transitions, 390 flow [2023-09-01 09:46:24,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:46:24,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:46:24,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 484 transitions. [2023-09-01 09:46:24,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.510548523206751 [2023-09-01 09:46:24,218 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 484 transitions. [2023-09-01 09:46:24,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 484 transitions. [2023-09-01 09:46:24,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:24,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 484 transitions. [2023-09-01 09:46:24,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:24,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:24,223 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:24,223 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 126 flow. Second operand 4 states and 484 transitions. [2023-09-01 09:46:24,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 73 transitions, 390 flow [2023-09-01 09:46:24,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 73 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:46:24,261 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 204 flow [2023-09-01 09:46:24,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=204, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2023-09-01 09:46:24,263 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-09-01 09:46:24,265 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 204 flow [2023-09-01 09:46:24,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:24,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:24,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:46:24,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:46:24,267 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:46:24,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:24,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1195114698, now seen corresponding path program 1 times [2023-09-01 09:46:24,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:24,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102182050] [2023-09-01 09:46:24,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:24,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:24,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:46:24,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:24,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102182050] [2023-09-01 09:46:24,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102182050] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:24,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:24,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:46:24,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928720152] [2023-09-01 09:46:24,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:24,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:46:24,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:24,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:46:24,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:46:24,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 237 [2023-09-01 09:46:24,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:24,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:24,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 237 [2023-09-01 09:46:24,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:25,999 INFO L130 PetriNetUnfolder]: 14805/20160 cut-off events. [2023-09-01 09:46:25,999 INFO L131 PetriNetUnfolder]: For 18874/18874 co-relation queries the response was YES. [2023-09-01 09:46:26,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55317 conditions, 20160 events. 14805/20160 cut-off events. For 18874/18874 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 101760 event pairs, 3978 based on Foata normal form. 200/20360 useless extension candidates. Maximal degree in co-relation 55302. Up to 8743 conditions per place. [2023-09-01 09:46:26,123 INFO L137 encePairwiseOnDemand]: 228/237 looper letters, 63 selfloop transitions, 15 changer transitions 0/78 dead transitions. [2023-09-01 09:46:26,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 78 transitions, 502 flow [2023-09-01 09:46:26,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:46:26,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:46:26,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 476 transitions. [2023-09-01 09:46:26,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5021097046413502 [2023-09-01 09:46:26,127 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 476 transitions. [2023-09-01 09:46:26,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 476 transitions. [2023-09-01 09:46:26,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:26,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 476 transitions. [2023-09-01 09:46:26,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:26,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:26,131 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:26,131 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 204 flow. Second operand 4 states and 476 transitions. [2023-09-01 09:46:26,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 78 transitions, 502 flow [2023-09-01 09:46:26,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 78 transitions, 502 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 09:46:26,184 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 352 flow [2023-09-01 09:46:26,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=352, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2023-09-01 09:46:26,186 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2023-09-01 09:46:26,186 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 352 flow [2023-09-01 09:46:26,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:26,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:26,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:46:26,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:46:26,187 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:46:26,188 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:26,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1383065169, now seen corresponding path program 1 times [2023-09-01 09:46:26,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:26,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645643394] [2023-09-01 09:46:26,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:26,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:26,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:46:26,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:26,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645643394] [2023-09-01 09:46:26,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645643394] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:26,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:26,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:46:26,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953842098] [2023-09-01 09:46:26,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:26,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:46:26,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:26,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:46:26,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:46:26,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 237 [2023-09-01 09:46:26,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:26,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:26,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 237 [2023-09-01 09:46:26,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:27,865 INFO L130 PetriNetUnfolder]: 11867/16895 cut-off events. [2023-09-01 09:46:27,866 INFO L131 PetriNetUnfolder]: For 26876/27284 co-relation queries the response was YES. [2023-09-01 09:46:27,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48715 conditions, 16895 events. 11867/16895 cut-off events. For 26876/27284 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 98400 event pairs, 5081 based on Foata normal form. 288/16820 useless extension candidates. Maximal degree in co-relation 48695. Up to 15257 conditions per place. [2023-09-01 09:46:27,974 INFO L137 encePairwiseOnDemand]: 233/237 looper letters, 56 selfloop transitions, 7 changer transitions 0/75 dead transitions. [2023-09-01 09:46:27,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 75 transitions, 582 flow [2023-09-01 09:46:27,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:46:27,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:46:27,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2023-09-01 09:46:27,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5344585091420534 [2023-09-01 09:46:27,980 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 380 transitions. [2023-09-01 09:46:27,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 380 transitions. [2023-09-01 09:46:27,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:27,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 380 transitions. [2023-09-01 09:46:27,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:27,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:27,987 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:27,987 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 352 flow. Second operand 3 states and 380 transitions. [2023-09-01 09:46:27,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 75 transitions, 582 flow [2023-09-01 09:46:28,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 75 transitions, 578 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:46:28,041 INFO L231 Difference]: Finished difference. Result has 53 places, 58 transitions, 431 flow [2023-09-01 09:46:28,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=431, PETRI_PLACES=53, PETRI_TRANSITIONS=58} [2023-09-01 09:46:28,043 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 10 predicate places. [2023-09-01 09:46:28,043 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 58 transitions, 431 flow [2023-09-01 09:46:28,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:28,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:28,044 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:46:28,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:46:28,044 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:46:28,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:28,045 INFO L85 PathProgramCache]: Analyzing trace with hash 564453781, now seen corresponding path program 1 times [2023-09-01 09:46:28,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:28,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407178269] [2023-09-01 09:46:28,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:28,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:28,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:46:28,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:28,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407178269] [2023-09-01 09:46:28,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407178269] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:28,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:28,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:46:28,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863931119] [2023-09-01 09:46:28,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:28,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:46:28,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:28,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:46:28,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:46:28,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 237 [2023-09-01 09:46:28,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 58 transitions, 431 flow. Second operand has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:28,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:28,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 237 [2023-09-01 09:46:28,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:30,571 INFO L130 PetriNetUnfolder]: 19688/27036 cut-off events. [2023-09-01 09:46:30,571 INFO L131 PetriNetUnfolder]: For 50617/50617 co-relation queries the response was YES. [2023-09-01 09:46:30,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81469 conditions, 27036 events. 19688/27036 cut-off events. For 50617/50617 co-relation queries the response was YES. Maximal size of possible extension queue 852. Compared 150653 event pairs, 3657 based on Foata normal form. 300/27336 useless extension candidates. Maximal degree in co-relation 81447. Up to 12108 conditions per place. [2023-09-01 09:46:30,702 INFO L137 encePairwiseOnDemand]: 228/237 looper letters, 66 selfloop transitions, 29 changer transitions 4/99 dead transitions. [2023-09-01 09:46:30,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 99 transitions, 787 flow [2023-09-01 09:46:30,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:46:30,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:46:30,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2023-09-01 09:46:30,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5158227848101266 [2023-09-01 09:46:30,707 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 489 transitions. [2023-09-01 09:46:30,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 489 transitions. [2023-09-01 09:46:30,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:30,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 489 transitions. [2023-09-01 09:46:30,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:30,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:30,713 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:30,714 INFO L175 Difference]: Start difference. First operand has 53 places, 58 transitions, 431 flow. Second operand 4 states and 489 transitions. [2023-09-01 09:46:30,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 99 transitions, 787 flow [2023-09-01 09:46:30,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 99 transitions, 780 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:46:30,813 INFO L231 Difference]: Finished difference. Result has 58 places, 61 transitions, 589 flow [2023-09-01 09:46:30,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=589, PETRI_PLACES=58, PETRI_TRANSITIONS=61} [2023-09-01 09:46:30,816 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 15 predicate places. [2023-09-01 09:46:30,816 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 61 transitions, 589 flow [2023-09-01 09:46:30,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:30,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:30,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:46:30,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:46:30,817 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:46:30,818 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:30,819 INFO L85 PathProgramCache]: Analyzing trace with hash 564508558, now seen corresponding path program 1 times [2023-09-01 09:46:30,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:30,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876571083] [2023-09-01 09:46:30,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:30,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:31,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:46:31,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:31,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876571083] [2023-09-01 09:46:31,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876571083] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:31,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:31,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:46:31,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064173746] [2023-09-01 09:46:31,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:31,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:46:31,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:31,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:46:31,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:46:31,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 237 [2023-09-01 09:46:31,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 61 transitions, 589 flow. Second operand has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:31,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:31,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 237 [2023-09-01 09:46:31,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:32,730 INFO L130 PetriNetUnfolder]: 11917/17671 cut-off events. [2023-09-01 09:46:32,731 INFO L131 PetriNetUnfolder]: For 43064/44578 co-relation queries the response was YES. [2023-09-01 09:46:32,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51089 conditions, 17671 events. 11917/17671 cut-off events. For 43064/44578 co-relation queries the response was YES. Maximal size of possible extension queue 949. Compared 115622 event pairs, 1991 based on Foata normal form. 1806/19117 useless extension candidates. Maximal degree in co-relation 51063. Up to 11052 conditions per place. [2023-09-01 09:46:32,829 INFO L137 encePairwiseOnDemand]: 230/237 looper letters, 114 selfloop transitions, 10 changer transitions 0/147 dead transitions. [2023-09-01 09:46:32,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 147 transitions, 1519 flow [2023-09-01 09:46:32,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:46:32,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:46:32,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2023-09-01 09:46:32,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5080168776371308 [2023-09-01 09:46:32,832 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 602 transitions. [2023-09-01 09:46:32,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 602 transitions. [2023-09-01 09:46:32,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:32,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 602 transitions. [2023-09-01 09:46:32,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:32,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:32,836 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:32,836 INFO L175 Difference]: Start difference. First operand has 58 places, 61 transitions, 589 flow. Second operand 5 states and 602 transitions. [2023-09-01 09:46:32,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 147 transitions, 1519 flow [2023-09-01 09:46:32,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 147 transitions, 1511 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-09-01 09:46:32,863 INFO L231 Difference]: Finished difference. Result has 65 places, 70 transitions, 662 flow [2023-09-01 09:46:32,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=662, PETRI_PLACES=65, PETRI_TRANSITIONS=70} [2023-09-01 09:46:32,864 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 22 predicate places. [2023-09-01 09:46:32,864 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 70 transitions, 662 flow [2023-09-01 09:46:32,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:32,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:32,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:46:32,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:46:32,865 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:46:32,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:32,865 INFO L85 PathProgramCache]: Analyzing trace with hash 930532706, now seen corresponding path program 1 times [2023-09-01 09:46:32,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:32,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226978977] [2023-09-01 09:46:32,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:32,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:33,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:46:33,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:33,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226978977] [2023-09-01 09:46:33,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226978977] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:33,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:33,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:46:33,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265285225] [2023-09-01 09:46:33,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:33,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:46:33,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:33,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:46:33,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:46:33,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 237 [2023-09-01 09:46:33,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 70 transitions, 662 flow. Second operand has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:33,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:33,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 237 [2023-09-01 09:46:33,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:35,687 INFO L130 PetriNetUnfolder]: 21303/30688 cut-off events. [2023-09-01 09:46:35,687 INFO L131 PetriNetUnfolder]: For 110790/110790 co-relation queries the response was YES. [2023-09-01 09:46:35,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119686 conditions, 30688 events. 21303/30688 cut-off events. For 110790/110790 co-relation queries the response was YES. Maximal size of possible extension queue 1168. Compared 193349 event pairs, 6412 based on Foata normal form. 168/30856 useless extension candidates. Maximal degree in co-relation 119655. Up to 15783 conditions per place. [2023-09-01 09:46:35,846 INFO L137 encePairwiseOnDemand]: 228/237 looper letters, 85 selfloop transitions, 24 changer transitions 26/135 dead transitions. [2023-09-01 09:46:35,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 135 transitions, 1313 flow [2023-09-01 09:46:35,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:46:35,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:46:35,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 490 transitions. [2023-09-01 09:46:35,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5168776371308017 [2023-09-01 09:46:35,849 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 490 transitions. [2023-09-01 09:46:35,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 490 transitions. [2023-09-01 09:46:35,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:35,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 490 transitions. [2023-09-01 09:46:35,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:35,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:35,852 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:35,853 INFO L175 Difference]: Start difference. First operand has 65 places, 70 transitions, 662 flow. Second operand 4 states and 490 transitions. [2023-09-01 09:46:35,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 135 transitions, 1313 flow [2023-09-01 09:46:36,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 135 transitions, 1300 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:46:36,048 INFO L231 Difference]: Finished difference. Result has 70 places, 66 transitions, 750 flow [2023-09-01 09:46:36,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=750, PETRI_PLACES=70, PETRI_TRANSITIONS=66} [2023-09-01 09:46:36,049 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2023-09-01 09:46:36,049 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 66 transitions, 750 flow [2023-09-01 09:46:36,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:36,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:36,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:46:36,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:46:36,050 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:46:36,051 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:36,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1594277679, now seen corresponding path program 1 times [2023-09-01 09:46:36,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:36,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624331411] [2023-09-01 09:46:36,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:36,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:36,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:46:36,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:36,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624331411] [2023-09-01 09:46:36,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624331411] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:36,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:36,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:46:36,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918229533] [2023-09-01 09:46:36,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:36,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:46:36,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:36,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:46:36,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:46:36,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 237 [2023-09-01 09:46:36,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 66 transitions, 750 flow. Second operand has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:36,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:36,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 237 [2023-09-01 09:46:36,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:37,747 INFO L130 PetriNetUnfolder]: 7733/12158 cut-off events. [2023-09-01 09:46:37,747 INFO L131 PetriNetUnfolder]: For 41201/41680 co-relation queries the response was YES. [2023-09-01 09:46:37,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43587 conditions, 12158 events. 7733/12158 cut-off events. For 41201/41680 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 81584 event pairs, 1058 based on Foata normal form. 1417/13381 useless extension candidates. Maximal degree in co-relation 43552. Up to 4795 conditions per place. [2023-09-01 09:46:37,802 INFO L137 encePairwiseOnDemand]: 230/237 looper letters, 133 selfloop transitions, 14 changer transitions 6/175 dead transitions. [2023-09-01 09:46:37,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 175 transitions, 2090 flow [2023-09-01 09:46:37,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:46:37,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:46:37,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 725 transitions. [2023-09-01 09:46:37,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5098452883263009 [2023-09-01 09:46:37,805 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 725 transitions. [2023-09-01 09:46:37,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 725 transitions. [2023-09-01 09:46:37,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:37,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 725 transitions. [2023-09-01 09:46:37,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:37,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 237.0) internal successors, (1659), 7 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:37,809 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 237.0) internal successors, (1659), 7 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:37,809 INFO L175 Difference]: Start difference. First operand has 70 places, 66 transitions, 750 flow. Second operand 6 states and 725 transitions. [2023-09-01 09:46:37,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 175 transitions, 2090 flow [2023-09-01 09:46:37,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 175 transitions, 2068 flow, removed 11 selfloop flow, removed 1 redundant places. [2023-09-01 09:46:37,924 INFO L231 Difference]: Finished difference. Result has 75 places, 74 transitions, 844 flow [2023-09-01 09:46:37,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=844, PETRI_PLACES=75, PETRI_TRANSITIONS=74} [2023-09-01 09:46:37,924 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places. [2023-09-01 09:46:37,925 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 74 transitions, 844 flow [2023-09-01 09:46:37,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:37,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:37,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:46:37,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:46:37,926 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:46:37,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:37,926 INFO L85 PathProgramCache]: Analyzing trace with hash 793722416, now seen corresponding path program 1 times [2023-09-01 09:46:37,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:37,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236965544] [2023-09-01 09:46:37,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:37,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:38,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:46:38,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:38,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236965544] [2023-09-01 09:46:38,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236965544] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:38,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:38,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:46:38,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63553987] [2023-09-01 09:46:38,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:38,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:46:38,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:38,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:46:38,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:46:38,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 237 [2023-09-01 09:46:38,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 74 transitions, 844 flow. Second operand has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:38,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:38,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 237 [2023-09-01 09:46:38,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:40,302 INFO L130 PetriNetUnfolder]: 12118/19035 cut-off events. [2023-09-01 09:46:40,302 INFO L131 PetriNetUnfolder]: For 88191/88561 co-relation queries the response was YES. [2023-09-01 09:46:40,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82740 conditions, 19035 events. 12118/19035 cut-off events. For 88191/88561 co-relation queries the response was YES. Maximal size of possible extension queue 984. Compared 135655 event pairs, 2432 based on Foata normal form. 291/19092 useless extension candidates. Maximal degree in co-relation 82701. Up to 8736 conditions per place. [2023-09-01 09:46:40,417 INFO L137 encePairwiseOnDemand]: 234/237 looper letters, 88 selfloop transitions, 4 changer transitions 26/135 dead transitions. [2023-09-01 09:46:40,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 135 transitions, 1628 flow [2023-09-01 09:46:40,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:46:40,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:46:40,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2023-09-01 09:46:40,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5221518987341772 [2023-09-01 09:46:40,419 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 495 transitions. [2023-09-01 09:46:40,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 495 transitions. [2023-09-01 09:46:40,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:40,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 495 transitions. [2023-09-01 09:46:40,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:40,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:40,423 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:40,423 INFO L175 Difference]: Start difference. First operand has 75 places, 74 transitions, 844 flow. Second operand 4 states and 495 transitions. [2023-09-01 09:46:40,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 135 transitions, 1628 flow [2023-09-01 09:46:41,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 135 transitions, 1508 flow, removed 48 selfloop flow, removed 2 redundant places. [2023-09-01 09:46:41,453 INFO L231 Difference]: Finished difference. Result has 78 places, 74 transitions, 807 flow [2023-09-01 09:46:41,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=807, PETRI_PLACES=78, PETRI_TRANSITIONS=74} [2023-09-01 09:46:41,458 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 35 predicate places. [2023-09-01 09:46:41,458 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 807 flow [2023-09-01 09:46:41,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:41,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:41,459 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] [2023-09-01 09:46:41,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 09:46:41,459 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:46:41,459 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:41,459 INFO L85 PathProgramCache]: Analyzing trace with hash -2145600381, now seen corresponding path program 1 times [2023-09-01 09:46:41,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:41,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262252310] [2023-09-01 09:46:41,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:41,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:41,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:46:41,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:41,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262252310] [2023-09-01 09:46:41,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262252310] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:41,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:41,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:46:41,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798300305] [2023-09-01 09:46:41,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:41,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:46:41,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:41,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:46:41,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:46:41,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 237 [2023-09-01 09:46:41,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 807 flow. Second operand has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:41,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:41,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 237 [2023-09-01 09:46:41,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:43,600 INFO L130 PetriNetUnfolder]: 9657/15338 cut-off events. [2023-09-01 09:46:43,600 INFO L131 PetriNetUnfolder]: For 53910/54338 co-relation queries the response was YES. [2023-09-01 09:46:43,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58191 conditions, 15338 events. 9657/15338 cut-off events. For 53910/54338 co-relation queries the response was YES. Maximal size of possible extension queue 902. Compared 109927 event pairs, 1014 based on Foata normal form. 925/16027 useless extension candidates. Maximal degree in co-relation 58151. Up to 4345 conditions per place. [2023-09-01 09:46:43,656 INFO L137 encePairwiseOnDemand]: 230/237 looper letters, 107 selfloop transitions, 21 changer transitions 62/207 dead transitions. [2023-09-01 09:46:43,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 207 transitions, 2421 flow [2023-09-01 09:46:43,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 09:46:43,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 09:46:43,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 966 transitions. [2023-09-01 09:46:43,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509493670886076 [2023-09-01 09:46:43,663 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 966 transitions. [2023-09-01 09:46:43,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 966 transitions. [2023-09-01 09:46:43,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:43,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 966 transitions. [2023-09-01 09:46:43,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.75) internal successors, (966), 8 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:43,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 237.0) internal successors, (2133), 9 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:43,668 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 237.0) internal successors, (2133), 9 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:43,668 INFO L175 Difference]: Start difference. First operand has 78 places, 74 transitions, 807 flow. Second operand 8 states and 966 transitions. [2023-09-01 09:46:43,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 207 transitions, 2421 flow [2023-09-01 09:46:44,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 207 transitions, 2304 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-09-01 09:46:44,326 INFO L231 Difference]: Finished difference. Result has 85 places, 74 transitions, 794 flow [2023-09-01 09:46:44,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=794, PETRI_PLACES=85, PETRI_TRANSITIONS=74} [2023-09-01 09:46:44,326 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 42 predicate places. [2023-09-01 09:46:44,327 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 74 transitions, 794 flow [2023-09-01 09:46:44,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:44,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:44,327 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] [2023-09-01 09:46:44,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 09:46:44,327 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:46:44,328 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:44,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1773678665, now seen corresponding path program 1 times [2023-09-01 09:46:44,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:44,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119950535] [2023-09-01 09:46:44,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:44,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:44,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:46:44,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:44,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119950535] [2023-09-01 09:46:44,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119950535] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:44,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:44,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 09:46:44,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311421996] [2023-09-01 09:46:44,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:44,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:46:44,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:44,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:46:44,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:46:44,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 237 [2023-09-01 09:46:44,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 74 transitions, 794 flow. Second operand has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:44,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:44,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 237 [2023-09-01 09:46:44,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:46,088 INFO L130 PetriNetUnfolder]: 8397/13794 cut-off events. [2023-09-01 09:46:46,089 INFO L131 PetriNetUnfolder]: For 47315/47680 co-relation queries the response was YES. [2023-09-01 09:46:46,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57660 conditions, 13794 events. 8397/13794 cut-off events. For 47315/47680 co-relation queries the response was YES. Maximal size of possible extension queue 862. Compared 103147 event pairs, 975 based on Foata normal form. 355/13933 useless extension candidates. Maximal degree in co-relation 57618. Up to 3938 conditions per place. [2023-09-01 09:46:46,142 INFO L137 encePairwiseOnDemand]: 230/237 looper letters, 52 selfloop transitions, 17 changer transitions 118/191 dead transitions. [2023-09-01 09:46:46,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 191 transitions, 2174 flow [2023-09-01 09:46:46,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-01 09:46:46,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-09-01 09:46:46,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1177 transitions. [2023-09-01 09:46:46,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4966244725738397 [2023-09-01 09:46:46,145 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1177 transitions. [2023-09-01 09:46:46,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1177 transitions. [2023-09-01 09:46:46,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:46,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1177 transitions. [2023-09-01 09:46:46,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 117.7) internal successors, (1177), 10 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:46,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 237.0) internal successors, (2607), 11 states have internal predecessors, (2607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:46,152 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 237.0) internal successors, (2607), 11 states have internal predecessors, (2607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:46,152 INFO L175 Difference]: Start difference. First operand has 85 places, 74 transitions, 794 flow. Second operand 10 states and 1177 transitions. [2023-09-01 09:46:46,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 191 transitions, 2174 flow [2023-09-01 09:46:47,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 191 transitions, 1962 flow, removed 26 selfloop flow, removed 7 redundant places. [2023-09-01 09:46:47,650 INFO L231 Difference]: Finished difference. Result has 90 places, 40 transitions, 307 flow [2023-09-01 09:46:47,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=307, PETRI_PLACES=90, PETRI_TRANSITIONS=40} [2023-09-01 09:46:47,651 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 47 predicate places. [2023-09-01 09:46:47,651 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 40 transitions, 307 flow [2023-09-01 09:46:47,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:47,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:47,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:46:47,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-09-01 09:46:47,652 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:46:47,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:47,653 INFO L85 PathProgramCache]: Analyzing trace with hash -2130018362, now seen corresponding path program 1 times [2023-09-01 09:46:47,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:47,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343516295] [2023-09-01 09:46:47,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:47,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:48,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:46:48,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:48,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343516295] [2023-09-01 09:46:48,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343516295] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:48,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:48,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 09:46:48,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762267597] [2023-09-01 09:46:48,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:48,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 09:46:48,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:48,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 09:46:48,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-09-01 09:46:48,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 237 [2023-09-01 09:46:48,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 40 transitions, 307 flow. Second operand has 8 states, 8 states have (on average 98.5) internal successors, (788), 8 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:48,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:48,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 237 [2023-09-01 09:46:48,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:49,259 INFO L130 PetriNetUnfolder]: 796/1292 cut-off events. [2023-09-01 09:46:49,260 INFO L131 PetriNetUnfolder]: For 2755/2755 co-relation queries the response was YES. [2023-09-01 09:46:49,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4948 conditions, 1292 events. 796/1292 cut-off events. For 2755/2755 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5308 event pairs, 85 based on Foata normal form. 1/1293 useless extension candidates. Maximal degree in co-relation 4914. Up to 436 conditions per place. [2023-09-01 09:46:49,266 INFO L137 encePairwiseOnDemand]: 228/237 looper letters, 52 selfloop transitions, 6 changer transitions 65/123 dead transitions. [2023-09-01 09:46:49,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 123 transitions, 1069 flow [2023-09-01 09:46:49,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 09:46:49,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 09:46:49,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 846 transitions. [2023-09-01 09:46:49,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4462025316455696 [2023-09-01 09:46:49,269 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 846 transitions. [2023-09-01 09:46:49,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 846 transitions. [2023-09-01 09:46:49,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:49,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 846 transitions. [2023-09-01 09:46:49,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 105.75) internal successors, (846), 8 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:49,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 237.0) internal successors, (2133), 9 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:49,275 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 237.0) internal successors, (2133), 9 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:49,275 INFO L175 Difference]: Start difference. First operand has 90 places, 40 transitions, 307 flow. Second operand 8 states and 846 transitions. [2023-09-01 09:46:49,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 123 transitions, 1069 flow [2023-09-01 09:46:49,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 123 transitions, 785 flow, removed 58 selfloop flow, removed 29 redundant places. [2023-09-01 09:46:49,286 INFO L231 Difference]: Finished difference. Result has 62 places, 40 transitions, 204 flow [2023-09-01 09:46:49,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=204, PETRI_PLACES=62, PETRI_TRANSITIONS=40} [2023-09-01 09:46:49,287 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2023-09-01 09:46:49,287 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 40 transitions, 204 flow [2023-09-01 09:46:49,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.5) internal successors, (788), 8 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:49,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:49,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:46:49,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-09-01 09:46:49,289 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:46:49,289 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:49,289 INFO L85 PathProgramCache]: Analyzing trace with hash 2058537466, now seen corresponding path program 2 times [2023-09-01 09:46:49,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:49,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860946155] [2023-09-01 09:46:49,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:49,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:46:49,358 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:46:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:46:49,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:46:49,453 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:46:49,454 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-09-01 09:46:49,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-09-01 09:46:49,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-09-01 09:46:49,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-09-01 09:46:49,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-09-01 09:46:49,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-09-01 09:46:49,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-09-01 09:46:49,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-09-01 09:46:49,460 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:46:49,466 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:46:49,466 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:46:49,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:46:49 BasicIcfg [2023-09-01 09:46:49,563 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:46:49,563 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:46:49,563 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:46:49,563 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:46:49,564 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:46:13" (3/4) ... [2023-09-01 09:46:49,565 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:46:49,673 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:46:49,673 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:46:49,674 INFO L158 Benchmark]: Toolchain (without parser) took 37875.37ms. Allocated memory was 73.4MB in the beginning and 4.8GB in the end (delta: 4.7GB). Free memory was 46.5MB in the beginning and 2.9GB in the end (delta: -2.9GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2023-09-01 09:46:49,674 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory is still 34.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:46:49,674 INFO L158 Benchmark]: CACSL2BoogieTranslator took 597.36ms. Allocated memory is still 73.4MB. Free memory was 46.3MB in the beginning and 40.9MB in the end (delta: 5.4MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2023-09-01 09:46:49,674 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.44ms. Allocated memory is still 73.4MB. Free memory was 40.9MB in the beginning and 38.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:46:49,675 INFO L158 Benchmark]: Boogie Preprocessor took 49.25ms. Allocated memory is still 73.4MB. Free memory was 38.5MB in the beginning and 36.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:46:49,675 INFO L158 Benchmark]: RCFGBuilder took 641.18ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 36.3MB in the beginning and 54.0MB in the end (delta: -17.7MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2023-09-01 09:46:49,677 INFO L158 Benchmark]: TraceAbstraction took 36399.59ms. Allocated memory was 88.1MB in the beginning and 4.8GB in the end (delta: 4.7GB). Free memory was 53.4MB in the beginning and 2.9GB in the end (delta: -2.9GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2023-09-01 09:46:49,677 INFO L158 Benchmark]: Witness Printer took 110.15ms. Allocated memory is still 4.8GB. Free memory was 2.9GB in the beginning and 2.9GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-09-01 09:46:49,679 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.17ms. Allocated memory is still 56.6MB. Free memory is still 34.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 597.36ms. Allocated memory is still 73.4MB. Free memory was 46.3MB in the beginning and 40.9MB in the end (delta: 5.4MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.44ms. Allocated memory is still 73.4MB. Free memory was 40.9MB in the beginning and 38.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.25ms. Allocated memory is still 73.4MB. Free memory was 38.5MB in the beginning and 36.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 641.18ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 36.3MB in the beginning and 54.0MB in the end (delta: -17.7MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * TraceAbstraction took 36399.59ms. Allocated memory was 88.1MB in the beginning and 4.8GB in the end (delta: 4.7GB). Free memory was 53.4MB in the beginning and 2.9GB in the end (delta: -2.9GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 110.15ms. Allocated memory is still 4.8GB. Free memory was 2.9GB in the beginning and 2.9GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 137 PlacesBefore, 43 PlacesAfterwards, 126 TransitionsBefore, 31 TransitionsAfterwards, 3164 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 107 TotalNumberOfCompositions, 9510 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3804, independent: 3552, independent conditional: 0, independent unconditional: 3552, dependent: 252, dependent conditional: 0, dependent unconditional: 252, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1711, independent: 1659, independent conditional: 0, independent unconditional: 1659, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3804, independent: 1893, independent conditional: 0, independent unconditional: 1893, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 1711, unknown conditional: 0, unknown unconditional: 1711] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 144, Positive conditional cache size: 0, Positive unconditional cache size: 144, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L864] 0 pthread_t t553; [L865] FCALL, FORK 0 pthread_create(&t553, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t553, ((void *)0), P0, ((void *)0))=-3, t553={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t554; [L867] FCALL, FORK 0 pthread_create(&t554, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t554, ((void *)0), P1, ((void *)0))=-2, t553={5:0}, t554={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t555; [L869] FCALL, FORK 0 pthread_create(&t555, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t555, ((void *)0), P2, ((void *)0))=-1, t553={5:0}, t554={6:0}, t555={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t556; [L871] FCALL, FORK 0 pthread_create(&t556, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t556, ((void *)0), P3, ((void *)0))=0, t553={5:0}, t554={6:0}, t555={7:0}, t556={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L800] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L820] 4 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L823] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L831] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L832] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L833] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L834] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L836] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EBX = a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=1] [L842] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=1] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t553={5:0}, t554={6:0}, t555={7:0}, t556={3:0}, weak$$choice2=1, x=2, y=2, z=1] [L884] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 867]: 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: 871]: 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: 865]: 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: 869]: 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, 167 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: 36.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 27.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 795 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 637 mSDsluCounter, 283 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 212 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1591 IncrementalHoareTripleChecker+Invalid, 1694 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 71 mSDtfsCounter, 1591 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=844occurred in iteration=9, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 201 ConstructedInterpolants, 0 QuantifiedInterpolants, 1515 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-09-01 09:46:49,710 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