./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cbb513b70df4783d73c8ce937f205ecfc8e5e869592c62a4af16bc0bc109e7a4 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 16:57:49,827 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:57:49,828 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:57:49,860 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:57:49,862 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:57:49,865 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:57:49,867 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:57:49,870 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:57:49,873 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:57:49,878 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:57:49,879 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:57:49,881 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:57:49,882 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:57:49,884 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:57:49,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:57:49,891 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:57:49,892 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:57:49,893 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:57:49,895 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:57:49,901 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:57:49,902 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:57:49,903 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:57:49,904 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:57:49,905 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:57:49,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:57:49,912 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:57:49,912 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:57:49,915 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:57:49,915 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:57:49,917 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:57:49,917 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:57:49,923 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:57:49,925 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:57:49,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:57:49,926 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:57:49,927 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:57:49,927 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:57:49,927 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:57:49,928 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:57:49,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:57:49,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:57:49,940 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 16:57:49,973 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:57:49,974 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:57:49,975 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:57:49,975 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:57:49,976 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:57:49,976 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:57:49,977 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:57:49,977 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:57:49,977 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:57:49,977 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:57:49,978 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:57:49,978 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:57:49,978 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:57:49,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:57:49,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:57:49,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:57:49,979 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:57:49,979 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:57:49,979 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:57:49,979 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:57:49,980 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:57:49,980 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:57:49,980 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:57:49,980 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:57:49,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:57:49,981 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:57:49,981 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:57:49,981 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:57:49,981 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:57:49,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:57:49,981 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:57:49,982 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:57:49,982 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:57:49,982 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:57:49,982 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:57:49,982 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 -> cbb513b70df4783d73c8ce937f205ecfc8e5e869592c62a4af16bc0bc109e7a4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 16:57:50,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:57:50,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:57:50,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:57:50,352 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:57:50,352 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:57:50,353 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2023-08-30 16:57:51,594 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:57:51,868 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:57:51,869 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2023-08-30 16:57:51,881 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca6ac8cd/966c48c4ef3448c5a675b0e930aadde3/FLAG3778ede39 [2023-08-30 16:57:51,896 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca6ac8cd/966c48c4ef3448c5a675b0e930aadde3 [2023-08-30 16:57:51,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:57:51,899 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:57:51,900 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:57:51,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:57:51,904 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:57:51,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:57:51" (1/1) ... [2023-08-30 16:57:51,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ae463d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:57:51, skipping insertion in model container [2023-08-30 16:57:51,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:57:51" (1/1) ... [2023-08-30 16:57:51,914 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:57:51,966 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:57:52,131 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/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2023-08-30 16:57:52,408 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:57:52,424 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:57:52,437 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/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2023-08-30 16:57:52,499 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:57:52,533 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:57:52,533 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:57:52,539 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:57:52,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:57:52 WrapperNode [2023-08-30 16:57:52,540 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:57:52,541 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:57:52,541 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:57:52,542 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:57:52,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:57:52" (1/1) ... [2023-08-30 16:57:52,579 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:57:52" (1/1) ... [2023-08-30 16:57:52,613 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2023-08-30 16:57:52,614 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:57:52,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:57:52,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:57:52,615 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:57:52,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:57:52" (1/1) ... [2023-08-30 16:57:52,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:57:52" (1/1) ... [2023-08-30 16:57:52,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:57:52" (1/1) ... [2023-08-30 16:57:52,636 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:57:52" (1/1) ... [2023-08-30 16:57:52,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:57:52" (1/1) ... [2023-08-30 16:57:52,650 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:57:52" (1/1) ... [2023-08-30 16:57:52,652 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:57:52" (1/1) ... [2023-08-30 16:57:52,653 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:57:52" (1/1) ... [2023-08-30 16:57:52,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:57:52,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:57:52,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:57:52,678 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:57:52,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:57:52" (1/1) ... [2023-08-30 16:57:52,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:57:52,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:57:52,714 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 16:57:52,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 16:57:52,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:57:52,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:57:52,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:57:52,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:57:52,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:57:52,747 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:57:52,747 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:57:52,747 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:57:52,747 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:57:52,748 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 16:57:52,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 16:57:52,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:57:52,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:57:52,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:57:52,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:57:52,750 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 16:57:52,866 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:57:52,868 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:57:53,192 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:57:53,335 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:57:53,336 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:57:53,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:57:53 BoogieIcfgContainer [2023-08-30 16:57:53,338 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:57:53,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:57:53,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:57:53,343 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:57:53,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:57:51" (1/3) ... [2023-08-30 16:57:53,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4884046a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:57:53, skipping insertion in model container [2023-08-30 16:57:53,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:57:52" (2/3) ... [2023-08-30 16:57:53,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4884046a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:57:53, skipping insertion in model container [2023-08-30 16:57:53,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:57:53" (3/3) ... [2023-08-30 16:57:53,345 INFO L112 eAbstractionObserver]: Analyzing ICFG safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2023-08-30 16:57:53,352 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:57:53,361 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:57:53,361 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:57:53,361 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:57:53,415 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:57:53,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2023-08-30 16:57:53,528 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2023-08-30 16:57:53,528 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:57:53,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-08-30 16:57:53,537 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2023-08-30 16:57:53,541 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2023-08-30 16:57:53,544 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:57:53,551 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2023-08-30 16:57:53,553 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2023-08-30 16:57:53,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2023-08-30 16:57:53,578 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2023-08-30 16:57:53,578 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:57:53,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-08-30 16:57:53,580 INFO L119 LiptonReduction]: Number of co-enabled transitions 1920 [2023-08-30 16:57:56,802 INFO L134 LiptonReduction]: Checked pairs total: 4996 [2023-08-30 16:57:56,802 INFO L136 LiptonReduction]: Total number of compositions: 94 [2023-08-30 16:57:56,815 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:57:56,820 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;@162ccb53, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:57:56,821 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-30 16:57:56,824 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2023-08-30 16:57:56,824 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:57:56,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:57:56,825 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 16:57:56,826 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:57:56,830 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:57:56,830 INFO L85 PathProgramCache]: Analyzing trace with hash 469637, now seen corresponding path program 1 times [2023-08-30 16:57:56,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:57:56,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683090471] [2023-08-30 16:57:56,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:57:56,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:57:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:57:57,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:57:57,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:57:57,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683090471] [2023-08-30 16:57:57,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683090471] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:57:57,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:57:57,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:57:57,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575399625] [2023-08-30 16:57:57,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:57:57,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:57:57,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:57:57,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:57:57,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:57:57,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 202 [2023-08-30 16:57:57,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:57:57,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:57:57,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 202 [2023-08-30 16:57:57,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:57:57,547 INFO L130 PetriNetUnfolder]: 895/1447 cut-off events. [2023-08-30 16:57:57,548 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-30 16:57:57,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2830 conditions, 1447 events. 895/1447 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7509 event pairs, 142 based on Foata normal form. 0/1366 useless extension candidates. Maximal degree in co-relation 2819. Up to 1084 conditions per place. [2023-08-30 16:57:57,558 INFO L137 encePairwiseOnDemand]: 198/202 looper letters, 31 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-08-30 16:57:57,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 37 transitions, 159 flow [2023-08-30 16:57:57,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:57:57,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:57:57,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2023-08-30 16:57:57,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.528052805280528 [2023-08-30 16:57:57,571 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions. [2023-08-30 16:57:57,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions. [2023-08-30 16:57:57,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:57:57,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions. [2023-08-30 16:57:57,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:57:57,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:57:57,582 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:57:57,583 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states and 320 transitions. [2023-08-30 16:57:57,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 37 transitions, 159 flow [2023-08-30 16:57:57,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 37 transitions, 154 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 16:57:57,587 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2023-08-30 16:57:57,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-08-30 16:57:57,592 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-08-30 16:57:57,593 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2023-08-30 16:57:57,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:57:57,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:57:57,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:57:57,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:57:57,594 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:57:57,594 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:57:57,595 INFO L85 PathProgramCache]: Analyzing trace with hash -19873178, now seen corresponding path program 1 times [2023-08-30 16:57:57,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:57:57,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424516771] [2023-08-30 16:57:57,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:57:57,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:57:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:57:57,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:57:57,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:57:57,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424516771] [2023-08-30 16:57:57,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424516771] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:57:57,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:57:57,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:57:57,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026982987] [2023-08-30 16:57:57,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:57:57,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:57:57,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:57:57,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:57:57,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:57:57,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-30 16:57:57,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:57:57,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:57:57,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-30 16:57:57,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:57:58,146 INFO L130 PetriNetUnfolder]: 671/1021 cut-off events. [2023-08-30 16:57:58,147 INFO L131 PetriNetUnfolder]: For 85/85 co-relation queries the response was YES. [2023-08-30 16:57:58,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2169 conditions, 1021 events. 671/1021 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4356 event pairs, 159 based on Foata normal form. 16/1033 useless extension candidates. Maximal degree in co-relation 2159. Up to 817 conditions per place. [2023-08-30 16:57:58,154 INFO L137 encePairwiseOnDemand]: 199/202 looper letters, 25 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2023-08-30 16:57:58,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 124 flow [2023-08-30 16:57:58,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:57:58,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:57:58,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2023-08-30 16:57:58,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5066006600660066 [2023-08-30 16:57:58,160 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 307 transitions. [2023-08-30 16:57:58,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 307 transitions. [2023-08-30 16:57:58,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:57:58,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 307 transitions. [2023-08-30 16:57:58,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:57:58,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:57:58,166 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:57:58,166 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 3 states and 307 transitions. [2023-08-30 16:57:58,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 124 flow [2023-08-30 16:57:58,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:57:58,168 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 56 flow [2023-08-30 16:57:58,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-08-30 16:57:58,169 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-08-30 16:57:58,169 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2023-08-30 16:57:58,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:57:58,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:57:58,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:57:58,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:57:58,170 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:57:58,173 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:57:58,173 INFO L85 PathProgramCache]: Analyzing trace with hash -616069414, now seen corresponding path program 1 times [2023-08-30 16:57:58,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:57:58,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361003169] [2023-08-30 16:57:58,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:57:58,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:57:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:57:58,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:57:58,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:57:58,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361003169] [2023-08-30 16:57:58,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361003169] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:57:58,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:57:58,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:57:58,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058739922] [2023-08-30 16:57:58,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:57:58,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:57:58,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:57:58,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:57:58,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:57:58,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 202 [2023-08-30 16:57:58,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:57:58,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:57:58,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 202 [2023-08-30 16:57:58,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:57:58,631 INFO L130 PetriNetUnfolder]: 838/1346 cut-off events. [2023-08-30 16:57:58,631 INFO L131 PetriNetUnfolder]: For 134/134 co-relation queries the response was YES. [2023-08-30 16:57:58,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2856 conditions, 1346 events. 838/1346 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6344 event pairs, 220 based on Foata normal form. 8/1354 useless extension candidates. Maximal degree in co-relation 2845. Up to 1189 conditions per place. [2023-08-30 16:57:58,639 INFO L137 encePairwiseOnDemand]: 198/202 looper letters, 30 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2023-08-30 16:57:58,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 155 flow [2023-08-30 16:57:58,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:57:58,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:57:58,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 310 transitions. [2023-08-30 16:57:58,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5115511551155115 [2023-08-30 16:57:58,641 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 310 transitions. [2023-08-30 16:57:58,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 310 transitions. [2023-08-30 16:57:58,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:57:58,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 310 transitions. [2023-08-30 16:57:58,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:57:58,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:57:58,644 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:57:58,644 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 3 states and 310 transitions. [2023-08-30 16:57:58,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 155 flow [2023-08-30 16:57:58,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 149 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:57:58,646 INFO L231 Difference]: Finished difference. Result has 32 places, 23 transitions, 71 flow [2023-08-30 16:57:58,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2023-08-30 16:57:58,647 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -1 predicate places. [2023-08-30 16:57:58,647 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 71 flow [2023-08-30 16:57:58,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:57:58,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:57:58,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:57:58,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:57:58,648 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:57:58,649 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:57:58,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1946220684, now seen corresponding path program 1 times [2023-08-30 16:57:58,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:57:58,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797677413] [2023-08-30 16:57:58,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:57:58,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:57:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:57:58,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-08-30 16:57:58,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:57:58,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797677413] [2023-08-30 16:57:58,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797677413] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:57:58,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:57:58,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:57:58,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582919993] [2023-08-30 16:57:58,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:57:58,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:57:58,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:57:58,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:57:58,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:57:58,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 202 [2023-08-30 16:57:58,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 71 flow. Second operand has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:57:58,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:57:58,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 202 [2023-08-30 16:57:58,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:57:59,185 INFO L130 PetriNetUnfolder]: 1564/2384 cut-off events. [2023-08-30 16:57:59,186 INFO L131 PetriNetUnfolder]: For 683/683 co-relation queries the response was YES. [2023-08-30 16:57:59,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5304 conditions, 2384 events. 1564/2384 cut-off events. For 683/683 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 11210 event pairs, 328 based on Foata normal form. 128/2512 useless extension candidates. Maximal degree in co-relation 5292. Up to 774 conditions per place. [2023-08-30 16:57:59,195 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 43 selfloop transitions, 5 changer transitions 7/55 dead transitions. [2023-08-30 16:57:59,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 55 transitions, 252 flow [2023-08-30 16:57:59,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:57:59,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:57:59,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 491 transitions. [2023-08-30 16:57:59,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861386138613861 [2023-08-30 16:57:59,198 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 491 transitions. [2023-08-30 16:57:59,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 491 transitions. [2023-08-30 16:57:59,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:57:59,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 491 transitions. [2023-08-30 16:57:59,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:57:59,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:57:59,202 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:57:59,203 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 71 flow. Second operand 5 states and 491 transitions. [2023-08-30 16:57:59,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 55 transitions, 252 flow [2023-08-30 16:57:59,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 55 transitions, 249 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:57:59,205 INFO L231 Difference]: Finished difference. Result has 39 places, 25 transitions, 104 flow [2023-08-30 16:57:59,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2023-08-30 16:57:59,205 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2023-08-30 16:57:59,206 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 25 transitions, 104 flow [2023-08-30 16:57:59,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:57:59,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:57:59,206 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:57:59,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:57:59,207 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:57:59,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:57:59,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1633095935, now seen corresponding path program 1 times [2023-08-30 16:57:59,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:57:59,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486386006] [2023-08-30 16:57:59,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:57:59,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:57:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:57:59,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:57:59,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:57:59,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486386006] [2023-08-30 16:57:59,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486386006] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:57:59,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:57:59,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:57:59,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216850014] [2023-08-30 16:57:59,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:57:59,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:57:59,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:57:59,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:57:59,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:57:59,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 202 [2023-08-30 16:57:59,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 25 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 89.75) internal successors, (359), 4 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:57:59,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:57:59,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 202 [2023-08-30 16:57:59,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:57:59,682 INFO L130 PetriNetUnfolder]: 617/1060 cut-off events. [2023-08-30 16:57:59,682 INFO L131 PetriNetUnfolder]: For 687/694 co-relation queries the response was YES. [2023-08-30 16:57:59,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2653 conditions, 1060 events. 617/1060 cut-off events. For 687/694 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5116 event pairs, 122 based on Foata normal form. 103/1160 useless extension candidates. Maximal degree in co-relation 2636. Up to 638 conditions per place. [2023-08-30 16:57:59,689 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 36 selfloop transitions, 6 changer transitions 18/64 dead transitions. [2023-08-30 16:57:59,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 64 transitions, 347 flow [2023-08-30 16:57:59,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:57:59,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:57:59,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 491 transitions. [2023-08-30 16:57:59,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861386138613861 [2023-08-30 16:57:59,691 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 491 transitions. [2023-08-30 16:57:59,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 491 transitions. [2023-08-30 16:57:59,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:57:59,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 491 transitions. [2023-08-30 16:57:59,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:57:59,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:57:59,695 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:57:59,695 INFO L175 Difference]: Start difference. First operand has 39 places, 25 transitions, 104 flow. Second operand 5 states and 491 transitions. [2023-08-30 16:57:59,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 64 transitions, 347 flow [2023-08-30 16:57:59,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 64 transitions, 334 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-30 16:57:59,700 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 140 flow [2023-08-30 16:57:59,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=140, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-30 16:57:59,701 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 10 predicate places. [2023-08-30 16:57:59,701 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 140 flow [2023-08-30 16:57:59,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.75) internal successors, (359), 4 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:57:59,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:57:59,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:57:59,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:57:59,702 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:57:59,703 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:57:59,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1448665674, now seen corresponding path program 1 times [2023-08-30 16:57:59,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:57:59,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368841991] [2023-08-30 16:57:59,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:57:59,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:57:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:57:59,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:57:59,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:57:59,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368841991] [2023-08-30 16:57:59,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368841991] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:57:59,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:57:59,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:57:59,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776135930] [2023-08-30 16:57:59,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:57:59,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:57:59,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:57:59,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:57:59,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:57:59,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 202 [2023-08-30 16:57:59,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:57:59,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:57:59,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 202 [2023-08-30 16:57:59,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:00,145 INFO L130 PetriNetUnfolder]: 421/768 cut-off events. [2023-08-30 16:58:00,145 INFO L131 PetriNetUnfolder]: For 608/610 co-relation queries the response was YES. [2023-08-30 16:58:00,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2343 conditions, 768 events. 421/768 cut-off events. For 608/610 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3670 event pairs, 70 based on Foata normal form. 62/827 useless extension candidates. Maximal degree in co-relation 2324. Up to 241 conditions per place. [2023-08-30 16:58:00,149 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 45 selfloop transitions, 10 changer transitions 26/85 dead transitions. [2023-08-30 16:58:00,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 85 transitions, 508 flow [2023-08-30 16:58:00,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:58:00,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:58:00,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 684 transitions. [2023-08-30 16:58:00,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4837340876944837 [2023-08-30 16:58:00,152 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 684 transitions. [2023-08-30 16:58:00,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 684 transitions. [2023-08-30 16:58:00,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:00,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 684 transitions. [2023-08-30 16:58:00,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.71428571428571) internal successors, (684), 7 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:00,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:00,157 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:00,158 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 140 flow. Second operand 7 states and 684 transitions. [2023-08-30 16:58:00,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 85 transitions, 508 flow [2023-08-30 16:58:00,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 85 transitions, 508 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 16:58:00,162 INFO L231 Difference]: Finished difference. Result has 52 places, 34 transitions, 207 flow [2023-08-30 16:58:00,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=207, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2023-08-30 16:58:00,163 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 19 predicate places. [2023-08-30 16:58:00,163 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 207 flow [2023-08-30 16:58:00,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:00,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:00,164 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:58:00,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:58:00,164 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:58:00,164 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:00,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1525077593, now seen corresponding path program 1 times [2023-08-30 16:58:00,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:00,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736727027] [2023-08-30 16:58:00,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:00,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:58:00,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:58:00,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:58:00,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736727027] [2023-08-30 16:58:00,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736727027] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:58:00,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:58:00,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:58:00,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230932096] [2023-08-30 16:58:00,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:58:00,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:58:00,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:58:00,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:58:00,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:58:00,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 202 [2023-08-30 16:58:00,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 207 flow. Second operand has 6 states, 6 states have (on average 89.66666666666667) internal successors, (538), 6 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:00,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:58:00,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 202 [2023-08-30 16:58:00,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:00,755 INFO L130 PetriNetUnfolder]: 355/644 cut-off events. [2023-08-30 16:58:00,755 INFO L131 PetriNetUnfolder]: For 984/985 co-relation queries the response was YES. [2023-08-30 16:58:00,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2238 conditions, 644 events. 355/644 cut-off events. For 984/985 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3028 event pairs, 65 based on Foata normal form. 18/659 useless extension candidates. Maximal degree in co-relation 2214. Up to 194 conditions per place. [2023-08-30 16:58:00,759 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 41 selfloop transitions, 13 changer transitions 25/83 dead transitions. [2023-08-30 16:58:00,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 83 transitions, 553 flow [2023-08-30 16:58:00,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 16:58:00,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 16:58:00,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 856 transitions. [2023-08-30 16:58:00,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47084708470847086 [2023-08-30 16:58:00,763 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 856 transitions. [2023-08-30 16:58:00,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 856 transitions. [2023-08-30 16:58:00,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:00,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 856 transitions. [2023-08-30 16:58:00,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 95.11111111111111) internal successors, (856), 9 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:00,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 202.0) internal successors, (2020), 10 states have internal predecessors, (2020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:00,769 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 202.0) internal successors, (2020), 10 states have internal predecessors, (2020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:00,769 INFO L175 Difference]: Start difference. First operand has 52 places, 34 transitions, 207 flow. Second operand 9 states and 856 transitions. [2023-08-30 16:58:00,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 83 transitions, 553 flow [2023-08-30 16:58:00,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 83 transitions, 514 flow, removed 10 selfloop flow, removed 6 redundant places. [2023-08-30 16:58:00,779 INFO L231 Difference]: Finished difference. Result has 56 places, 34 transitions, 211 flow [2023-08-30 16:58:00,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=211, PETRI_PLACES=56, PETRI_TRANSITIONS=34} [2023-08-30 16:58:00,780 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 23 predicate places. [2023-08-30 16:58:00,780 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 34 transitions, 211 flow [2023-08-30 16:58:00,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.66666666666667) internal successors, (538), 6 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:00,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:00,781 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-08-30 16:58:00,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:58:00,781 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:58:00,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:00,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1826734683, now seen corresponding path program 1 times [2023-08-30 16:58:00,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:00,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79095896] [2023-08-30 16:58:00,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:00,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:58:01,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:58:01,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:58:01,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79095896] [2023-08-30 16:58:01,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79095896] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:58:01,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:58:01,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:58:01,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945460050] [2023-08-30 16:58:01,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:58:01,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:58:01,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:58:01,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:58:01,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:58:01,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 202 [2023-08-30 16:58:01,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 34 transitions, 211 flow. Second operand has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:01,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:58:01,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 202 [2023-08-30 16:58:01,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:02,154 INFO L130 PetriNetUnfolder]: 370/682 cut-off events. [2023-08-30 16:58:02,154 INFO L131 PetriNetUnfolder]: For 1240/1240 co-relation queries the response was YES. [2023-08-30 16:58:02,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2386 conditions, 682 events. 370/682 cut-off events. For 1240/1240 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3302 event pairs, 48 based on Foata normal form. 1/672 useless extension candidates. Maximal degree in co-relation 2362. Up to 295 conditions per place. [2023-08-30 16:58:02,158 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 41 selfloop transitions, 4 changer transitions 34/83 dead transitions. [2023-08-30 16:58:02,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 83 transitions, 679 flow [2023-08-30 16:58:02,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:58:02,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:58:02,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 674 transitions. [2023-08-30 16:58:02,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4766619519094767 [2023-08-30 16:58:02,161 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 674 transitions. [2023-08-30 16:58:02,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 674 transitions. [2023-08-30 16:58:02,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:02,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 674 transitions. [2023-08-30 16:58:02,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.28571428571429) internal successors, (674), 7 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:02,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:02,166 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:02,166 INFO L175 Difference]: Start difference. First operand has 56 places, 34 transitions, 211 flow. Second operand 7 states and 674 transitions. [2023-08-30 16:58:02,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 83 transitions, 679 flow [2023-08-30 16:58:02,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 83 transitions, 560 flow, removed 27 selfloop flow, removed 7 redundant places. [2023-08-30 16:58:02,174 INFO L231 Difference]: Finished difference. Result has 55 places, 33 transitions, 169 flow [2023-08-30 16:58:02,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=169, PETRI_PLACES=55, PETRI_TRANSITIONS=33} [2023-08-30 16:58:02,177 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 22 predicate places. [2023-08-30 16:58:02,178 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 33 transitions, 169 flow [2023-08-30 16:58:02,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:02,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:02,179 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-08-30 16:58:02,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:58:02,179 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:58:02,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:02,183 INFO L85 PathProgramCache]: Analyzing trace with hash 666810809, now seen corresponding path program 2 times [2023-08-30 16:58:02,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:02,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752686357] [2023-08-30 16:58:02,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:02,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:58:02,224 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:58:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:58:02,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:58:02,287 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:58:02,288 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-30 16:58:02,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-30 16:58:02,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-30 16:58:02,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-30 16:58:02,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-30 16:58:02,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-30 16:58:02,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:58:02,290 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:58:02,295 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:58:02,296 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:58:02,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:58:02 BasicIcfg [2023-08-30 16:58:02,352 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:58:02,360 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:58:02,360 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:58:02,360 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:58:02,361 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:57:53" (3/4) ... [2023-08-30 16:58:02,363 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:58:02,441 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:58:02,441 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:58:02,442 INFO L158 Benchmark]: Toolchain (without parser) took 10543.06ms. Allocated memory was 65.0MB in the beginning and 230.7MB in the end (delta: 165.7MB). Free memory was 42.2MB in the beginning and 71.3MB in the end (delta: -29.1MB). Peak memory consumption was 137.6MB. Max. memory is 16.1GB. [2023-08-30 16:58:02,442 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 50.3MB. Free memory was 28.9MB in the beginning and 28.9MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:58:02,442 INFO L158 Benchmark]: CACSL2BoogieTranslator took 640.59ms. Allocated memory is still 65.0MB. Free memory was 41.9MB in the beginning and 34.3MB in the end (delta: 7.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-08-30 16:58:02,443 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.76ms. Allocated memory is still 65.0MB. Free memory was 34.3MB in the beginning and 31.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:58:02,443 INFO L158 Benchmark]: Boogie Preprocessor took 62.26ms. Allocated memory is still 65.0MB. Free memory was 31.8MB in the beginning and 29.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:58:02,443 INFO L158 Benchmark]: RCFGBuilder took 660.56ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 29.8MB in the beginning and 45.8MB in the end (delta: -15.9MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2023-08-30 16:58:02,444 INFO L158 Benchmark]: TraceAbstraction took 9019.40ms. Allocated memory was 79.7MB in the beginning and 230.7MB in the end (delta: 151.0MB). Free memory was 44.9MB in the beginning and 80.7MB in the end (delta: -35.9MB). Peak memory consumption was 115.0MB. Max. memory is 16.1GB. [2023-08-30 16:58:02,444 INFO L158 Benchmark]: Witness Printer took 81.57ms. Allocated memory is still 230.7MB. Free memory was 80.7MB in the beginning and 71.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-08-30 16:58:02,445 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.20ms. Allocated memory is still 50.3MB. Free memory was 28.9MB in the beginning and 28.9MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 640.59ms. Allocated memory is still 65.0MB. Free memory was 41.9MB in the beginning and 34.3MB in the end (delta: 7.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.76ms. Allocated memory is still 65.0MB. Free memory was 34.3MB in the beginning and 31.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.26ms. Allocated memory is still 65.0MB. Free memory was 31.8MB in the beginning and 29.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 660.56ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 29.8MB in the beginning and 45.8MB in the end (delta: -15.9MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9019.40ms. Allocated memory was 79.7MB in the beginning and 230.7MB in the end (delta: 151.0MB). Free memory was 44.9MB in the beginning and 80.7MB in the end (delta: -35.9MB). Peak memory consumption was 115.0MB. Max. memory is 16.1GB. * Witness Printer took 81.57ms. Allocated memory is still 230.7MB. Free memory was 80.7MB in the beginning and 71.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 113 PlacesBefore, 33 PlacesAfterwards, 105 TransitionsBefore, 24 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 94 TotalNumberOfCompositions, 4996 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2329, independent: 2168, independent conditional: 0, independent unconditional: 2168, dependent: 161, dependent conditional: 0, dependent unconditional: 161, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1078, independent: 1038, independent conditional: 0, independent unconditional: 1038, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2329, independent: 1130, independent conditional: 0, independent unconditional: 1130, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 1078, unknown conditional: 0, unknown unconditional: 1078] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 70, Positive conditional cache size: 0, Positive unconditional cache size: 70, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L833] 0 pthread_t t2281; [L834] FCALL, FORK 0 pthread_create(&t2281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2281, ((void *)0), P0, ((void *)0))=-2, t2281={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L835] 0 pthread_t t2282; [L836] FCALL, FORK 0 pthread_create(&t2282, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2282, ((void *)0), P1, ((void *)0))=-1, t2281={5:0}, t2282={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L837] 0 pthread_t t2283; [L838] FCALL, FORK 0 pthread_create(&t2283, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2283, ((void *)0), P2, ((void *)0))=0, t2281={5:0}, t2282={6:0}, t2283={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 1 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L792] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L795] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 3 z$flush_delayed = weak$$choice2 [L798] 3 z$mem_tmp = z [L799] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L800] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L801] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L802] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L803] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L805] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] 3 __unbuffered_p2_EBX = z [L807] 3 z = z$flush_delayed ? z$mem_tmp : z [L808] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L811] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L812] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L813] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L814] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L815] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L845] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L846] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L847] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L848] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2281={5:0}, t2282={6:0}, t2283={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L851] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] 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}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 834]: 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: 838]: 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: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 135 locations, 6 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: 8.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 344 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 286 mSDsluCounter, 123 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 720 IncrementalHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 36 mSDtfsCounter, 720 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=7, InterpolantAutomatonStates: 42, 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.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 592 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-30 16:58:02,480 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