./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_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 ad7a565ad4ebe037ce541fa36cdf85746d072cc2b5132ab8ae2e3025ff70fea5 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 09:54:47,787 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:54:47,788 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:54:47,831 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:54:47,832 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:54:47,834 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:54:47,836 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:54:47,839 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:54:47,841 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:54:47,846 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:54:47,847 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:54:47,849 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:54:47,850 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:54:47,852 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:54:47,853 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:54:47,858 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:54:47,859 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:54:47,861 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:54:47,862 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:54:47,867 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:54:47,875 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:54:47,877 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:54:47,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:54:47,878 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:54:47,885 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:54:47,886 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:54:47,886 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:54:47,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:54:47,889 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:54:47,890 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:54:47,891 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:54:47,892 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:54:47,894 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:54:47,894 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:54:47,895 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:54:47,895 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:54:47,896 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:54:47,896 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:54:47,897 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:54:47,897 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:54:47,898 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:54:47,900 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 09:54:47,932 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:54:47,933 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:54:47,934 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:54:47,934 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:54:47,935 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:54:47,935 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:54:47,936 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:54:47,936 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:54:47,936 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:54:47,936 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:54:47,937 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:54:47,937 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:54:47,938 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:54:47,938 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:54:47,938 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:54:47,938 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:54:47,938 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:54:47,939 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:54:47,939 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:54:47,939 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:54:47,939 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:54:47,939 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:54:47,940 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:54:47,940 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:54:47,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:54:47,940 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:54:47,940 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:54:47,941 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:54:47,941 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:54:47,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:54:47,941 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:54:47,941 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:54:47,942 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:54:47,942 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:54:47,942 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:54:47,942 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 -> ad7a565ad4ebe037ce541fa36cdf85746d072cc2b5132ab8ae2e3025ff70fea5 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 09:54:48,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:54:48,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:54:48,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:54:48,244 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:54:48,244 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:54:48,245 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2023-09-01 09:54:49,468 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:54:49,758 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:54:49,759 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2023-09-01 09:54:49,770 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9e4fe128/3cb2316116d041208946cc3495729255/FLAG4896a5b87 [2023-09-01 09:54:49,784 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9e4fe128/3cb2316116d041208946cc3495729255 [2023-09-01 09:54:49,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:54:49,787 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:54:49,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:54:49,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:54:49,794 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:54:49,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:54:49" (1/1) ... [2023-09-01 09:54:49,798 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17962889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:54:49, skipping insertion in model container [2023-09-01 09:54:49,798 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:54:49" (1/1) ... [2023-09-01 09:54:49,804 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:54:49,864 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:54:50,019 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/safe004_power.opt_pso.opt_rmo.opt.i[967,980] [2023-09-01 09:54:50,259 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:54:50,271 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:54:50,283 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/safe004_power.opt_pso.opt_rmo.opt.i[967,980] [2023-09-01 09:54:50,337 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:54:50,373 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:54:50,373 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:54:50,379 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:54:50,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:54:50 WrapperNode [2023-09-01 09:54:50,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:54:50,381 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:54:50,381 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:54:50,381 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:54:50,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:54:50" (1/1) ... [2023-09-01 09:54:50,420 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:54:50" (1/1) ... [2023-09-01 09:54:50,445 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-09-01 09:54:50,446 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:54:50,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:54:50,447 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:54:50,447 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:54:50,454 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:54:50" (1/1) ... [2023-09-01 09:54:50,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:54:50" (1/1) ... [2023-09-01 09:54:50,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:54:50" (1/1) ... [2023-09-01 09:54:50,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:54:50" (1/1) ... [2023-09-01 09:54:50,470 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:54:50" (1/1) ... [2023-09-01 09:54:50,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:54:50" (1/1) ... [2023-09-01 09:54:50,483 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:54:50" (1/1) ... [2023-09-01 09:54:50,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:54:50" (1/1) ... [2023-09-01 09:54:50,491 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:54:50,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:54:50,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:54:50,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:54:50,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:54:50" (1/1) ... [2023-09-01 09:54:50,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:54:50,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:54:50,534 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-01 09:54:50,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-01 09:54:50,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:54:50,577 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:54:50,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:54:50,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:54:50,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:54:50,579 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:54:50,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:54:50,579 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:54:50,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:54:50,579 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-09-01 09:54:50,580 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-09-01 09:54:50,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:54:50,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:54:50,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:54:50,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:54:50,581 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 09:54:50,739 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:54:50,740 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:54:51,133 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:54:51,261 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:54:51,261 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:54:51,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:54:51 BoogieIcfgContainer [2023-09-01 09:54:51,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:54:51,265 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:54:51,265 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:54:51,268 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:54:51,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:54:49" (1/3) ... [2023-09-01 09:54:51,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a6b5f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:54:51, skipping insertion in model container [2023-09-01 09:54:51,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:54:50" (2/3) ... [2023-09-01 09:54:51,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a6b5f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:54:51, skipping insertion in model container [2023-09-01 09:54:51,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:54:51" (3/3) ... [2023-09-01 09:54:51,271 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.opt_pso.opt_rmo.opt.i [2023-09-01 09:54:51,279 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:54:51,287 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:54:51,287 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-01 09:54:51,288 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:54:51,346 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:54:51,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2023-09-01 09:54:51,419 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2023-09-01 09:54:51,420 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:54:51,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-09-01 09:54:51,426 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2023-09-01 09:54:51,431 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2023-09-01 09:54:51,435 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:54:51,448 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2023-09-01 09:54:51,455 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2023-09-01 09:54:51,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2023-09-01 09:54:51,488 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2023-09-01 09:54:51,488 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:54:51,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-09-01 09:54:51,491 INFO L119 LiptonReduction]: Number of co-enabled transitions 1906 [2023-09-01 09:54:55,578 INFO L134 LiptonReduction]: Checked pairs total: 4689 [2023-09-01 09:54:55,578 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-09-01 09:54:55,590 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:54:55,596 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;@f811e77, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:54:55,596 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-09-01 09:54:55,601 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2023-09-01 09:54:55,601 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:54:55,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:54:55,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 09:54:55,603 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:54:55,607 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:54:55,607 INFO L85 PathProgramCache]: Analyzing trace with hash 449581389, now seen corresponding path program 1 times [2023-09-01 09:54:55,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:54:55,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222375507] [2023-09-01 09:54:55,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:54:55,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:54:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:54:56,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:54:56,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:54:56,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222375507] [2023-09-01 09:54:56,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222375507] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:54:56,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:54:56,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:54:56,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158887324] [2023-09-01 09:54:56,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:54:56,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:54:56,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:54:56,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:54:56,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:54:56,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 199 [2023-09-01 09:54:56,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:56,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:54:56,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 199 [2023-09-01 09:54:56,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:54:56,355 INFO L130 PetriNetUnfolder]: 711/1166 cut-off events. [2023-09-01 09:54:56,356 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-09-01 09:54:56,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2285 conditions, 1166 events. 711/1166 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5923 event pairs, 117 based on Foata normal form. 0/1097 useless extension candidates. Maximal degree in co-relation 2274. Up to 859 conditions per place. [2023-09-01 09:54:56,369 INFO L137 encePairwiseOnDemand]: 196/199 looper letters, 27 selfloop transitions, 2 changer transitions 2/34 dead transitions. [2023-09-01 09:54:56,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 142 flow [2023-09-01 09:54:56,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:54:56,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:54:56,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2023-09-01 09:54:56,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5209380234505863 [2023-09-01 09:54:56,398 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2023-09-01 09:54:56,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2023-09-01 09:54:56,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:54:56,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2023-09-01 09:54:56,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:56,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:56,413 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:56,415 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 55 flow. Second operand 3 states and 311 transitions. [2023-09-01 09:54:56,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 34 transitions, 142 flow [2023-09-01 09:54:56,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-09-01 09:54:56,419 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2023-09-01 09:54:56,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, 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-09-01 09:54:56,426 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-09-01 09:54:56,427 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2023-09-01 09:54:56,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:56,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:54:56,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:54:56,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:54:56,432 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:54:56,433 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:54:56,433 INFO L85 PathProgramCache]: Analyzing trace with hash -880810399, now seen corresponding path program 1 times [2023-09-01 09:54:56,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:54:56,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719107435] [2023-09-01 09:54:56,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:54:56,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:54:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:54:57,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:54:57,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:54:57,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719107435] [2023-09-01 09:54:57,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719107435] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:54:57,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:54:57,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:54:57,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092131587] [2023-09-01 09:54:57,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:54:57,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:54:57,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:54:57,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:54:57,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:54:57,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 199 [2023-09-01 09:54:57,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:57,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:54:57,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 199 [2023-09-01 09:54:57,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:54:57,648 INFO L130 PetriNetUnfolder]: 1194/1801 cut-off events. [2023-09-01 09:54:57,648 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2023-09-01 09:54:57,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3754 conditions, 1801 events. 1194/1801 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8021 event pairs, 162 based on Foata normal form. 68/1868 useless extension candidates. Maximal degree in co-relation 3744. Up to 1113 conditions per place. [2023-09-01 09:54:57,657 INFO L137 encePairwiseOnDemand]: 188/199 looper letters, 31 selfloop transitions, 10 changer transitions 0/42 dead transitions. [2023-09-01 09:54:57,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 42 transitions, 180 flow [2023-09-01 09:54:57,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:54:57,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:54:57,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 375 transitions. [2023-09-01 09:54:57,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47110552763819097 [2023-09-01 09:54:57,659 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 375 transitions. [2023-09-01 09:54:57,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 375 transitions. [2023-09-01 09:54:57,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:54:57,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 375 transitions. [2023-09-01 09:54:57,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:57,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:57,664 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:57,664 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 4 states and 375 transitions. [2023-09-01 09:54:57,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 42 transitions, 180 flow [2023-09-01 09:54:57,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 42 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:54:57,666 INFO L231 Difference]: Finished difference. Result has 34 places, 29 transitions, 124 flow [2023-09-01 09:54:57,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, 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=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=34, PETRI_TRANSITIONS=29} [2023-09-01 09:54:57,667 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 1 predicate places. [2023-09-01 09:54:57,667 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 124 flow [2023-09-01 09:54:57,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:57,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:54:57,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:54:57,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:54:57,668 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:54:57,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:54:57,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1535368224, now seen corresponding path program 1 times [2023-09-01 09:54:57,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:54:57,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224448233] [2023-09-01 09:54:57,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:54:57,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:54:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:54:58,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:54:58,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:54:58,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224448233] [2023-09-01 09:54:58,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224448233] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:54:58,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:54:58,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:54:58,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618647323] [2023-09-01 09:54:58,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:54:58,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:54:58,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:54:58,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:54:58,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:54:58,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 199 [2023-09-01 09:54:58,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 29 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 85.5) internal successors, (342), 4 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:58,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:54:58,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 199 [2023-09-01 09:54:58,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:54:58,518 INFO L130 PetriNetUnfolder]: 1112/1679 cut-off events. [2023-09-01 09:54:58,519 INFO L131 PetriNetUnfolder]: For 765/765 co-relation queries the response was YES. [2023-09-01 09:54:58,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5049 conditions, 1679 events. 1112/1679 cut-off events. For 765/765 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7369 event pairs, 284 based on Foata normal form. 20/1698 useless extension candidates. Maximal degree in co-relation 5036. Up to 855 conditions per place. [2023-09-01 09:54:58,529 INFO L137 encePairwiseOnDemand]: 189/199 looper letters, 37 selfloop transitions, 10 changer transitions 0/48 dead transitions. [2023-09-01 09:54:58,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 48 transitions, 292 flow [2023-09-01 09:54:58,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:54:58,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:54:58,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 373 transitions. [2023-09-01 09:54:58,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4685929648241206 [2023-09-01 09:54:58,532 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 373 transitions. [2023-09-01 09:54:58,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 373 transitions. [2023-09-01 09:54:58,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:54:58,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 373 transitions. [2023-09-01 09:54:58,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:58,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:58,536 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:58,536 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 124 flow. Second operand 4 states and 373 transitions. [2023-09-01 09:54:58,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 48 transitions, 292 flow [2023-09-01 09:54:58,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 48 transitions, 290 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:54:58,540 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 212 flow [2023-09-01 09:54:58,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=39, PETRI_TRANSITIONS=35} [2023-09-01 09:54:58,541 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2023-09-01 09:54:58,544 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 35 transitions, 212 flow [2023-09-01 09:54:58,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.5) internal successors, (342), 4 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:58,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:54:58,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:54:58,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:54:58,546 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:54:58,547 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:54:58,547 INFO L85 PathProgramCache]: Analyzing trace with hash -390290266, now seen corresponding path program 1 times [2023-09-01 09:54:58,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:54:58,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704055110] [2023-09-01 09:54:58,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:54:58,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:54:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:54:59,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:54:59,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:54:59,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704055110] [2023-09-01 09:54:59,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704055110] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:54:59,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:54:59,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:54:59,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102684267] [2023-09-01 09:54:59,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:54:59,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:54:59,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:54:59,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:54:59,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:54:59,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 199 [2023-09-01 09:54:59,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:59,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:54:59,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 199 [2023-09-01 09:54:59,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:54:59,544 INFO L130 PetriNetUnfolder]: 1660/2544 cut-off events. [2023-09-01 09:54:59,544 INFO L131 PetriNetUnfolder]: For 2713/2713 co-relation queries the response was YES. [2023-09-01 09:54:59,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8870 conditions, 2544 events. 1660/2544 cut-off events. For 2713/2713 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 12702 event pairs, 174 based on Foata normal form. 60/2604 useless extension candidates. Maximal degree in co-relation 8853. Up to 1282 conditions per place. [2023-09-01 09:54:59,561 INFO L137 encePairwiseOnDemand]: 188/199 looper letters, 38 selfloop transitions, 18 changer transitions 30/87 dead transitions. [2023-09-01 09:54:59,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 87 transitions, 697 flow [2023-09-01 09:54:59,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:54:59,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:54:59,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2023-09-01 09:54:59,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4763819095477387 [2023-09-01 09:54:59,567 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 474 transitions. [2023-09-01 09:54:59,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 474 transitions. [2023-09-01 09:54:59,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:54:59,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 474 transitions. [2023-09-01 09:54:59,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 94.8) internal successors, (474), 5 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:59,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:59,572 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:59,572 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 212 flow. Second operand 5 states and 474 transitions. [2023-09-01 09:54:59,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 87 transitions, 697 flow [2023-09-01 09:54:59,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 87 transitions, 685 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-09-01 09:54:59,614 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 263 flow [2023-09-01 09:54:59,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=263, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2023-09-01 09:54:59,616 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 10 predicate places. [2023-09-01 09:54:59,616 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 263 flow [2023-09-01 09:54:59,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:54:59,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:54:59,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:54:59,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:54:59,617 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:54:59,618 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:54:59,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1977339290, now seen corresponding path program 1 times [2023-09-01 09:54:59,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:54:59,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441818672] [2023-09-01 09:54:59,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:54:59,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:54:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:55:00,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:55:00,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:55:00,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441818672] [2023-09-01 09:55:00,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441818672] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:55:00,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:55:00,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:55:00,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274921533] [2023-09-01 09:55:00,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:55:00,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:55:00,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:55:00,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:55:00,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:55:00,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 199 [2023-09-01 09:55:00,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 263 flow. Second operand has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:00,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:55:00,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 199 [2023-09-01 09:55:00,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:55:00,807 INFO L130 PetriNetUnfolder]: 1824/2839 cut-off events. [2023-09-01 09:55:00,807 INFO L131 PetriNetUnfolder]: For 3612/3612 co-relation queries the response was YES. [2023-09-01 09:55:00,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10287 conditions, 2839 events. 1824/2839 cut-off events. For 3612/3612 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 15120 event pairs, 148 based on Foata normal form. 72/2911 useless extension candidates. Maximal degree in co-relation 10268. Up to 1340 conditions per place. [2023-09-01 09:55:00,823 INFO L137 encePairwiseOnDemand]: 188/199 looper letters, 39 selfloop transitions, 27 changer transitions 42/109 dead transitions. [2023-09-01 09:55:00,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 109 transitions, 906 flow [2023-09-01 09:55:00,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:55:00,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:55:00,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 661 transitions. [2023-09-01 09:55:00,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4745154343144293 [2023-09-01 09:55:00,826 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 661 transitions. [2023-09-01 09:55:00,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 661 transitions. [2023-09-01 09:55:00,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:55:00,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 661 transitions. [2023-09-01 09:55:00,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.42857142857143) internal successors, (661), 7 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:00,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:00,831 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:00,831 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 263 flow. Second operand 7 states and 661 transitions. [2023-09-01 09:55:00,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 109 transitions, 906 flow [2023-09-01 09:55:00,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 109 transitions, 820 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-09-01 09:55:00,857 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 406 flow [2023-09-01 09:55:00,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=406, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2023-09-01 09:55:00,857 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 18 predicate places. [2023-09-01 09:55:00,858 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 406 flow [2023-09-01 09:55:00,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:00,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:55:00,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:55:00,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:55:00,859 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:55:00,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:55:00,859 INFO L85 PathProgramCache]: Analyzing trace with hash 326885560, now seen corresponding path program 1 times [2023-09-01 09:55:00,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:55:00,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126243683] [2023-09-01 09:55:00,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:55:00,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:55:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:55:01,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:55:01,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:55:01,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126243683] [2023-09-01 09:55:01,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126243683] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:55:01,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:55:01,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:55:01,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909122303] [2023-09-01 09:55:01,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:55:01,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:55:01,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:55:01,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:55:01,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:55:01,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 199 [2023-09-01 09:55:01,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 406 flow. Second operand has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:01,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:55:01,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 199 [2023-09-01 09:55:01,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:55:01,826 INFO L130 PetriNetUnfolder]: 1126/1785 cut-off events. [2023-09-01 09:55:01,827 INFO L131 PetriNetUnfolder]: For 4085/4088 co-relation queries the response was YES. [2023-09-01 09:55:01,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7045 conditions, 1785 events. 1126/1785 cut-off events. For 4085/4088 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8437 event pairs, 353 based on Foata normal form. 6/1769 useless extension candidates. Maximal degree in co-relation 7021. Up to 1594 conditions per place. [2023-09-01 09:55:01,841 INFO L137 encePairwiseOnDemand]: 193/199 looper letters, 60 selfloop transitions, 13 changer transitions 0/78 dead transitions. [2023-09-01 09:55:01,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 78 transitions, 800 flow [2023-09-01 09:55:01,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:55:01,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:55:01,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 402 transitions. [2023-09-01 09:55:01,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5050251256281407 [2023-09-01 09:55:01,843 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 402 transitions. [2023-09-01 09:55:01,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 402 transitions. [2023-09-01 09:55:01,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:55:01,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 402 transitions. [2023-09-01 09:55:01,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:01,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:01,847 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:01,847 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 406 flow. Second operand 4 states and 402 transitions. [2023-09-01 09:55:01,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 78 transitions, 800 flow [2023-09-01 09:55:01,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 78 transitions, 760 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-09-01 09:55:01,887 INFO L231 Difference]: Finished difference. Result has 50 places, 57 transitions, 531 flow [2023-09-01 09:55:01,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=531, PETRI_PLACES=50, PETRI_TRANSITIONS=57} [2023-09-01 09:55:01,890 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2023-09-01 09:55:01,890 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 57 transitions, 531 flow [2023-09-01 09:55:01,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:01,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:55:01,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:55:01,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:55:01,891 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:55:01,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:55:01,892 INFO L85 PathProgramCache]: Analyzing trace with hash 524132965, now seen corresponding path program 1 times [2023-09-01 09:55:01,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:55:01,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069883471] [2023-09-01 09:55:01,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:55:01,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:55:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:55:02,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:55:02,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:55:02,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069883471] [2023-09-01 09:55:02,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069883471] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:55:02,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:55:02,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:55:02,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892823323] [2023-09-01 09:55:02,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:55:02,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:55:02,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:55:02,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:55:02,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:55:02,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 199 [2023-09-01 09:55:02,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 57 transitions, 531 flow. Second operand has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:02,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:55:02,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 199 [2023-09-01 09:55:02,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:55:03,114 INFO L130 PetriNetUnfolder]: 1911/3026 cut-off events. [2023-09-01 09:55:03,115 INFO L131 PetriNetUnfolder]: For 8291/8343 co-relation queries the response was YES. [2023-09-01 09:55:03,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12723 conditions, 3026 events. 1911/3026 cut-off events. For 8291/8343 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 16308 event pairs, 385 based on Foata normal form. 65/3045 useless extension candidates. Maximal degree in co-relation 12699. Up to 1631 conditions per place. [2023-09-01 09:55:03,148 INFO L137 encePairwiseOnDemand]: 191/199 looper letters, 107 selfloop transitions, 38 changer transitions 0/150 dead transitions. [2023-09-01 09:55:03,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 150 transitions, 1619 flow [2023-09-01 09:55:03,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:55:03,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:55:03,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 605 transitions. [2023-09-01 09:55:03,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5067001675041876 [2023-09-01 09:55:03,151 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 605 transitions. [2023-09-01 09:55:03,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 605 transitions. [2023-09-01 09:55:03,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:55:03,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 605 transitions. [2023-09-01 09:55:03,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:03,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:03,155 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:03,156 INFO L175 Difference]: Start difference. First operand has 50 places, 57 transitions, 531 flow. Second operand 6 states and 605 transitions. [2023-09-01 09:55:03,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 150 transitions, 1619 flow [2023-09-01 09:55:03,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 150 transitions, 1619 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 09:55:03,174 INFO L231 Difference]: Finished difference. Result has 59 places, 90 transitions, 1079 flow [2023-09-01 09:55:03,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1079, PETRI_PLACES=59, PETRI_TRANSITIONS=90} [2023-09-01 09:55:03,175 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 26 predicate places. [2023-09-01 09:55:03,175 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 90 transitions, 1079 flow [2023-09-01 09:55:03,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:03,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:55:03,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:55:03,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:55:03,176 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:55:03,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:55:03,177 INFO L85 PathProgramCache]: Analyzing trace with hash 524036245, now seen corresponding path program 2 times [2023-09-01 09:55:03,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:55:03,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910991412] [2023-09-01 09:55:03,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:55:03,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:55:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:55:03,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:55:03,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:55:03,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910991412] [2023-09-01 09:55:03,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910991412] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:55:03,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:55:03,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:55:03,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966107664] [2023-09-01 09:55:03,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:55:03,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:55:03,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:55:03,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:55:03,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:55:03,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 199 [2023-09-01 09:55:03,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 90 transitions, 1079 flow. Second operand has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:03,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:55:03,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 199 [2023-09-01 09:55:03,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:55:04,294 INFO L130 PetriNetUnfolder]: 2046/3253 cut-off events. [2023-09-01 09:55:04,294 INFO L131 PetriNetUnfolder]: For 15003/15205 co-relation queries the response was YES. [2023-09-01 09:55:04,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16128 conditions, 3253 events. 2046/3253 cut-off events. For 15003/15205 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 18017 event pairs, 420 based on Foata normal form. 233/3435 useless extension candidates. Maximal degree in co-relation 16098. Up to 2589 conditions per place. [2023-09-01 09:55:04,323 INFO L137 encePairwiseOnDemand]: 192/199 looper letters, 85 selfloop transitions, 38 changer transitions 0/128 dead transitions. [2023-09-01 09:55:04,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 128 transitions, 1637 flow [2023-09-01 09:55:04,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:55:04,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:55:04,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 598 transitions. [2023-09-01 09:55:04,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5008375209380235 [2023-09-01 09:55:04,327 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 598 transitions. [2023-09-01 09:55:04,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 598 transitions. [2023-09-01 09:55:04,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:55:04,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 598 transitions. [2023-09-01 09:55:04,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:04,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:04,331 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:04,331 INFO L175 Difference]: Start difference. First operand has 59 places, 90 transitions, 1079 flow. Second operand 6 states and 598 transitions. [2023-09-01 09:55:04,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 128 transitions, 1637 flow [2023-09-01 09:55:04,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 128 transitions, 1615 flow, removed 9 selfloop flow, removed 1 redundant places. [2023-09-01 09:55:04,355 INFO L231 Difference]: Finished difference. Result has 64 places, 103 transitions, 1362 flow [2023-09-01 09:55:04,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1362, PETRI_PLACES=64, PETRI_TRANSITIONS=103} [2023-09-01 09:55:04,358 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 31 predicate places. [2023-09-01 09:55:04,358 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 103 transitions, 1362 flow [2023-09-01 09:55:04,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:04,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:55:04,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:55:04,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:55:04,359 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:55:04,360 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:55:04,360 INFO L85 PathProgramCache]: Analyzing trace with hash -673821146, now seen corresponding path program 1 times [2023-09-01 09:55:04,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:55:04,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933841962] [2023-09-01 09:55:04,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:55:04,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:55:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:55:04,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:55:04,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:55:04,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933841962] [2023-09-01 09:55:04,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933841962] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:55:04,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:55:04,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:55:04,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839212880] [2023-09-01 09:55:04,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:55:04,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:55:04,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:55:04,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:55:04,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:55:04,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 199 [2023-09-01 09:55:04,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 103 transitions, 1362 flow. Second operand has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:04,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:55:04,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 199 [2023-09-01 09:55:04,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:55:05,065 INFO L130 PetriNetUnfolder]: 1324/2214 cut-off events. [2023-09-01 09:55:05,065 INFO L131 PetriNetUnfolder]: For 20287/20738 co-relation queries the response was YES. [2023-09-01 09:55:05,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11917 conditions, 2214 events. 1324/2214 cut-off events. For 20287/20738 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 12937 event pairs, 146 based on Foata normal form. 655/2856 useless extension candidates. Maximal degree in co-relation 11885. Up to 1310 conditions per place. [2023-09-01 09:55:05,080 INFO L137 encePairwiseOnDemand]: 193/199 looper letters, 147 selfloop transitions, 7 changer transitions 55/217 dead transitions. [2023-09-01 09:55:05,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 217 transitions, 3344 flow [2023-09-01 09:55:05,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:55:05,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:55:05,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 497 transitions. [2023-09-01 09:55:05,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4994974874371859 [2023-09-01 09:55:05,083 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 497 transitions. [2023-09-01 09:55:05,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 497 transitions. [2023-09-01 09:55:05,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:55:05,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 497 transitions. [2023-09-01 09:55:05,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:05,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:05,087 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:05,087 INFO L175 Difference]: Start difference. First operand has 64 places, 103 transitions, 1362 flow. Second operand 5 states and 497 transitions. [2023-09-01 09:55:05,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 217 transitions, 3344 flow [2023-09-01 09:55:05,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 217 transitions, 3147 flow, removed 24 selfloop flow, removed 8 redundant places. [2023-09-01 09:55:05,109 INFO L231 Difference]: Finished difference. Result has 63 places, 93 transitions, 1144 flow [2023-09-01 09:55:05,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=1058, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1144, PETRI_PLACES=63, PETRI_TRANSITIONS=93} [2023-09-01 09:55:05,110 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 30 predicate places. [2023-09-01 09:55:05,110 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 93 transitions, 1144 flow [2023-09-01 09:55:05,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:05,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:55:05,112 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:55:05,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:55:05,112 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:55:05,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:55:05,113 INFO L85 PathProgramCache]: Analyzing trace with hash 228211204, now seen corresponding path program 1 times [2023-09-01 09:55:05,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:55:05,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500022556] [2023-09-01 09:55:05,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:55:05,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:55:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:55:05,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:55:05,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:55:05,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500022556] [2023-09-01 09:55:05,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500022556] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:55:05,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:55:05,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:55:05,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843295247] [2023-09-01 09:55:05,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:55:05,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:55:05,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:55:05,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:55:05,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:55:05,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 199 [2023-09-01 09:55:05,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 93 transitions, 1144 flow. Second operand has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:05,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:55:05,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 199 [2023-09-01 09:55:05,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:55:05,702 INFO L130 PetriNetUnfolder]: 949/1680 cut-off events. [2023-09-01 09:55:05,702 INFO L131 PetriNetUnfolder]: For 15899/16304 co-relation queries the response was YES. [2023-09-01 09:55:05,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9707 conditions, 1680 events. 949/1680 cut-off events. For 15899/16304 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 10032 event pairs, 50 based on Foata normal form. 491/2158 useless extension candidates. Maximal degree in co-relation 9677. Up to 825 conditions per place. [2023-09-01 09:55:05,715 INFO L137 encePairwiseOnDemand]: 193/199 looper letters, 152 selfloop transitions, 13 changer transitions 58/231 dead transitions. [2023-09-01 09:55:05,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 231 transitions, 3343 flow [2023-09-01 09:55:05,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:55:05,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:55:05,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 693 transitions. [2023-09-01 09:55:05,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49748743718592964 [2023-09-01 09:55:05,719 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 693 transitions. [2023-09-01 09:55:05,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 693 transitions. [2023-09-01 09:55:05,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:55:05,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 693 transitions. [2023-09-01 09:55:05,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.0) internal successors, (693), 7 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:05,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:05,725 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:05,725 INFO L175 Difference]: Start difference. First operand has 63 places, 93 transitions, 1144 flow. Second operand 7 states and 693 transitions. [2023-09-01 09:55:05,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 231 transitions, 3343 flow [2023-09-01 09:55:05,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 231 transitions, 3339 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:55:05,762 INFO L231 Difference]: Finished difference. Result has 71 places, 91 transitions, 1120 flow [2023-09-01 09:55:05,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1120, PETRI_PLACES=71, PETRI_TRANSITIONS=91} [2023-09-01 09:55:05,764 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 38 predicate places. [2023-09-01 09:55:05,764 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 91 transitions, 1120 flow [2023-09-01 09:55:05,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:05,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:55:05,765 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:55:05,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 09:55:05,765 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:55:05,766 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:55:05,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1991755047, now seen corresponding path program 1 times [2023-09-01 09:55:05,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:55:05,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031011493] [2023-09-01 09:55:05,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:55:05,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:55:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:55:06,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:55:06,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:55:06,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031011493] [2023-09-01 09:55:06,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031011493] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:55:06,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:55:06,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:55:06,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342234806] [2023-09-01 09:55:06,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:55:06,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:55:06,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:55:06,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:55:06,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:55:06,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 199 [2023-09-01 09:55:06,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 91 transitions, 1120 flow. Second operand has 6 states, 6 states have (on average 91.66666666666667) internal successors, (550), 6 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:06,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:55:06,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 199 [2023-09-01 09:55:06,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:55:06,422 INFO L130 PetriNetUnfolder]: 856/1518 cut-off events. [2023-09-01 09:55:06,423 INFO L131 PetriNetUnfolder]: For 14351/14697 co-relation queries the response was YES. [2023-09-01 09:55:06,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9383 conditions, 1518 events. 856/1518 cut-off events. For 14351/14697 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 9179 event pairs, 42 based on Foata normal form. 327/1832 useless extension candidates. Maximal degree in co-relation 9349. Up to 736 conditions per place. [2023-09-01 09:55:06,435 INFO L137 encePairwiseOnDemand]: 193/199 looper letters, 143 selfloop transitions, 17 changer transitions 57/225 dead transitions. [2023-09-01 09:55:06,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 225 transitions, 3302 flow [2023-09-01 09:55:06,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-01 09:55:06,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-09-01 09:55:06,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 871 transitions. [2023-09-01 09:55:06,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.486320491345617 [2023-09-01 09:55:06,439 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 871 transitions. [2023-09-01 09:55:06,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 871 transitions. [2023-09-01 09:55:06,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:55:06,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 871 transitions. [2023-09-01 09:55:06,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.77777777777777) internal successors, (871), 9 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:06,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 199.0) internal successors, (1990), 10 states have internal predecessors, (1990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:06,445 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 199.0) internal successors, (1990), 10 states have internal predecessors, (1990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:06,445 INFO L175 Difference]: Start difference. First operand has 71 places, 91 transitions, 1120 flow. Second operand 9 states and 871 transitions. [2023-09-01 09:55:06,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 225 transitions, 3302 flow [2023-09-01 09:55:06,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 225 transitions, 3244 flow, removed 23 selfloop flow, removed 3 redundant places. [2023-09-01 09:55:06,512 INFO L231 Difference]: Finished difference. Result has 79 places, 87 transitions, 1026 flow [2023-09-01 09:55:06,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=970, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1026, PETRI_PLACES=79, PETRI_TRANSITIONS=87} [2023-09-01 09:55:06,513 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 46 predicate places. [2023-09-01 09:55:06,513 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 87 transitions, 1026 flow [2023-09-01 09:55:06,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.66666666666667) internal successors, (550), 6 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:55:06,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:55:06,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:55:06,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 09:55:06,514 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:55:06,514 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:55:06,515 INFO L85 PathProgramCache]: Analyzing trace with hash 617437737, now seen corresponding path program 1 times [2023-09-01 09:55:06,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:55:06,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711542518] [2023-09-01 09:55:06,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:55:06,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:55:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:55:06,569 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:55:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:55:06,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:55:06,641 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:55:06,642 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-09-01 09:55:06,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-09-01 09:55:06,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-09-01 09:55:06,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-09-01 09:55:06,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-09-01 09:55:06,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-09-01 09:55:06,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-09-01 09:55:06,645 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:55:06,650 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:55:06,651 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:55:06,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:55:06 BasicIcfg [2023-09-01 09:55:06,728 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:55:06,729 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:55:06,729 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:55:06,729 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:55:06,729 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:54:51" (3/4) ... [2023-09-01 09:55:06,731 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:55:06,817 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:55:06,817 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:55:06,818 INFO L158 Benchmark]: Toolchain (without parser) took 17030.62ms. Allocated memory was 67.1MB in the beginning and 438.3MB in the end (delta: 371.2MB). Free memory was 43.7MB in the beginning and 347.3MB in the end (delta: -303.7MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. [2023-09-01 09:55:06,818 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 54.5MB. Free memory was 32.4MB in the beginning and 32.4MB in the end (delta: 54.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:55:06,819 INFO L158 Benchmark]: CACSL2BoogieTranslator took 591.67ms. Allocated memory is still 67.1MB. Free memory was 43.5MB in the beginning and 37.2MB in the end (delta: 6.3MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2023-09-01 09:55:06,819 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.07ms. Allocated memory is still 67.1MB. Free memory was 37.2MB in the beginning and 34.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-09-01 09:55:06,819 INFO L158 Benchmark]: Boogie Preprocessor took 49.75ms. Allocated memory is still 67.1MB. Free memory was 34.3MB in the beginning and 32.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:55:06,820 INFO L158 Benchmark]: RCFGBuilder took 766.49ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 32.5MB in the beginning and 44.9MB in the end (delta: -12.4MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2023-09-01 09:55:06,820 INFO L158 Benchmark]: TraceAbstraction took 15462.97ms. Allocated memory was 81.8MB in the beginning and 438.3MB in the end (delta: 356.5MB). Free memory was 44.3MB in the beginning and 356.8MB in the end (delta: -312.5MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. [2023-09-01 09:55:06,820 INFO L158 Benchmark]: Witness Printer took 88.90ms. Allocated memory is still 438.3MB. Free memory was 356.8MB in the beginning and 347.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-09-01 09:55:06,822 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.21ms. Allocated memory is still 54.5MB. Free memory was 32.4MB in the beginning and 32.4MB in the end (delta: 54.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 591.67ms. Allocated memory is still 67.1MB. Free memory was 43.5MB in the beginning and 37.2MB in the end (delta: 6.3MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.07ms. Allocated memory is still 67.1MB. Free memory was 37.2MB in the beginning and 34.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.75ms. Allocated memory is still 67.1MB. Free memory was 34.3MB in the beginning and 32.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 766.49ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 32.5MB in the beginning and 44.9MB in the end (delta: -12.4MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15462.97ms. Allocated memory was 81.8MB in the beginning and 438.3MB in the end (delta: 356.5MB). Free memory was 44.3MB in the beginning and 356.8MB in the end (delta: -312.5MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. * Witness Printer took 88.90ms. Allocated memory is still 438.3MB. Free memory was 356.8MB in the beginning and 347.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: 4.1s, 112 PlacesBefore, 33 PlacesAfterwards, 104 TransitionsBefore, 23 TransitionsAfterwards, 1906 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 92 TotalNumberOfCompositions, 4689 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2154, independent: 1998, independent conditional: 0, independent unconditional: 1998, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1045, independent: 987, independent conditional: 0, independent unconditional: 987, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2154, independent: 1011, independent conditional: 0, independent unconditional: 1011, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 1045, unknown conditional: 0, unknown unconditional: 1045] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 54, Positive conditional cache size: 0, Positive unconditional cache size: 54, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, 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; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1876; [L819] FCALL, FORK 0 pthread_create(&t1876, ((void *)0), P0, ((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(&t1876, ((void *)0), P0, ((void *)0))=-2, t1876={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L820] 0 pthread_t t1877; [L821] FCALL, FORK 0 pthread_create(&t1877, ((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(&t1877, ((void *)0), P1, ((void *)0))=-1, t1876={5:0}, t1877={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L822] 0 pthread_t t1878; [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L823] FCALL, FORK 0 pthread_create(&t1878, ((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(&t1878, ((void *)0), P2, ((void *)0))=0, t1876={5:0}, t1877={6:0}, t1878={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L773] 2 y = 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L790] 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L793] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L741] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876={5:0}, t1877={6:0}, t1878={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 [L851] 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=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - 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: 819]: 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: 823]: 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: 821]: 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, 134 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: 15.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 585 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 428 mSDsluCounter, 261 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 157 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1021 IncrementalHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 104 mSDtfsCounter, 1021 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1362occurred in iteration=8, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 1263 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-09-01 09:55:06,857 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