./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe020_rmo.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --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/safe020_rmo.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 d52a8576f41904f21a1a217cd81ed2d36ac8928d5a02d745a0c93a101e2535cf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 23:20:51,119 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 23:20:51,120 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 23:20:51,144 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 23:20:51,145 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 23:20:51,146 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 23:20:51,147 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 23:20:51,149 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 23:20:51,151 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 23:20:51,152 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 23:20:51,153 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 23:20:51,154 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 23:20:51,154 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 23:20:51,155 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 23:20:51,156 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 23:20:51,161 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 23:20:51,163 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 23:20:51,166 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 23:20:51,168 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 23:20:51,171 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 23:20:51,177 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 23:20:51,178 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 23:20:51,182 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 23:20:51,194 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 23:20:51,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 23:20:51,207 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 23:20:51,208 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 23:20:51,209 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 23:20:51,209 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 23:20:51,210 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 23:20:51,213 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 23:20:51,214 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 23:20:51,215 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 23:20:51,216 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 23:20:51,218 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 23:20:51,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 23:20:51,220 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 23:20:51,220 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 23:20:51,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 23:20:51,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 23:20:51,222 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 23:20:51,223 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 23:20:51,252 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 23:20:51,253 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 23:20:51,254 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 23:20:51,254 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 23:20:51,255 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 23:20:51,255 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 23:20:51,256 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 23:20:51,256 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 23:20:51,256 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 23:20:51,257 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 23:20:51,257 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 23:20:51,258 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 23:20:51,258 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 23:20:51,258 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 23:20:51,258 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 23:20:51,258 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 23:20:51,259 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 23:20:51,259 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 23:20:51,259 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 23:20:51,259 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 23:20:51,259 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 23:20:51,260 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 23:20:51,260 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 23:20:51,260 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 23:20:51,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:20:51,260 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 23:20:51,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 23:20:51,261 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 23:20:51,261 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 23:20:51,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 23:20:51,261 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 23:20:51,261 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 23:20:51,262 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 23:20:51,262 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 23:20:51,262 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 23:20:51,262 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 -> d52a8576f41904f21a1a217cd81ed2d36ac8928d5a02d745a0c93a101e2535cf 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 -> TOGETHER [2023-08-30 23:20:51,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 23:20:51,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 23:20:51,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 23:20:51,651 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 23:20:51,651 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 23:20:51,653 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe020_rmo.i [2023-08-30 23:20:52,913 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 23:20:53,219 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 23:20:53,224 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe020_rmo.i [2023-08-30 23:20:53,249 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea3ad6405/f3fcb8a787504d50975c1c5857a2434d/FLAG61208dfde [2023-08-30 23:20:53,272 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea3ad6405/f3fcb8a787504d50975c1c5857a2434d [2023-08-30 23:20:53,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 23:20:53,276 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 23:20:53,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 23:20:53,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 23:20:53,283 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 23:20:53,283 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:20:53" (1/1) ... [2023-08-30 23:20:53,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c003169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:20:53, skipping insertion in model container [2023-08-30 23:20:53,286 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:20:53" (1/1) ... [2023-08-30 23:20:53,293 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 23:20:53,343 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 23:20:53,513 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/safe020_rmo.i[988,1001] [2023-08-30 23:20:53,727 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:20:53,744 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 23:20:53,756 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/safe020_rmo.i[988,1001] [2023-08-30 23:20:53,800 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:20:53,830 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:20:53,830 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:20:53,836 INFO L208 MainTranslator]: Completed translation [2023-08-30 23:20:53,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:20:53 WrapperNode [2023-08-30 23:20:53,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 23:20:53,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 23:20:53,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 23:20:53,838 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 23:20:53,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:20:53" (1/1) ... [2023-08-30 23:20:53,877 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:20:53" (1/1) ... [2023-08-30 23:20:53,916 INFO L138 Inliner]: procedures = 176, calls = 75, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 136 [2023-08-30 23:20:53,921 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 23:20:53,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 23:20:53,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 23:20:53,923 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 23:20:53,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:20:53" (1/1) ... [2023-08-30 23:20:53,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:20:53" (1/1) ... [2023-08-30 23:20:53,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:20:53" (1/1) ... [2023-08-30 23:20:53,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:20:53" (1/1) ... [2023-08-30 23:20:53,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:20:53" (1/1) ... [2023-08-30 23:20:53,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:20:53" (1/1) ... [2023-08-30 23:20:53,983 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:20:53" (1/1) ... [2023-08-30 23:20:53,984 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:20:53" (1/1) ... [2023-08-30 23:20:53,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 23:20:53,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 23:20:53,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 23:20:53,989 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 23:20:53,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:20:53" (1/1) ... [2023-08-30 23:20:53,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:20:54,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 23:20:54,025 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 23:20:54,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 23:20:54,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 23:20:54,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 23:20:54,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 23:20:54,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 23:20:54,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 23:20:54,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 23:20:54,064 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 23:20:54,064 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 23:20:54,064 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 23:20:54,064 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 23:20:54,065 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 23:20:54,065 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 23:20:54,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 23:20:54,065 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 23:20:54,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 23:20:54,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 23:20:54,067 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 23:20:54,202 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 23:20:54,209 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 23:20:54,674 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 23:20:54,961 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 23:20:54,962 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 23:20:54,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:20:54 BoogieIcfgContainer [2023-08-30 23:20:54,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 23:20:54,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 23:20:54,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 23:20:54,969 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 23:20:54,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 11:20:53" (1/3) ... [2023-08-30 23:20:54,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27629128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:20:54, skipping insertion in model container [2023-08-30 23:20:54,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:20:53" (2/3) ... [2023-08-30 23:20:54,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27629128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:20:54, skipping insertion in model container [2023-08-30 23:20:54,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:20:54" (3/3) ... [2023-08-30 23:20:54,971 INFO L112 eAbstractionObserver]: Analyzing ICFG safe020_rmo.i [2023-08-30 23:20:54,978 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 23:20:54,986 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 23:20:54,987 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-30 23:20:54,988 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 23:20:55,065 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 23:20:55,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 123 transitions, 261 flow [2023-08-30 23:20:55,159 INFO L130 PetriNetUnfolder]: 2/120 cut-off events. [2023-08-30 23:20:55,160 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:20:55,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 120 events. 2/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2023-08-30 23:20:55,164 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 123 transitions, 261 flow [2023-08-30 23:20:55,168 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 108 transitions, 225 flow [2023-08-30 23:20:55,172 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 23:20:55,183 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 108 transitions, 225 flow [2023-08-30 23:20:55,185 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 108 transitions, 225 flow [2023-08-30 23:20:55,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 108 transitions, 225 flow [2023-08-30 23:20:55,222 INFO L130 PetriNetUnfolder]: 1/108 cut-off events. [2023-08-30 23:20:55,223 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:20:55,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 1/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 39 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2023-08-30 23:20:55,226 INFO L119 LiptonReduction]: Number of co-enabled transitions 1138 [2023-08-30 23:21:00,507 INFO L134 LiptonReduction]: Checked pairs total: 3288 [2023-08-30 23:21:00,508 INFO L136 LiptonReduction]: Total number of compositions: 91 [2023-08-30 23:21:00,520 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 23:21:00,526 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;@1b090fc5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 23:21:00,527 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-30 23:21:00,533 INFO L130 PetriNetUnfolder]: 1/21 cut-off events. [2023-08-30 23:21:00,533 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:21:00,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:21:00,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:21:00,535 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 23:21:00,539 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:21:00,539 INFO L85 PathProgramCache]: Analyzing trace with hash 766666763, now seen corresponding path program 1 times [2023-08-30 23:21:00,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:21:00,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048565480] [2023-08-30 23:21:00,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:21:00,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:21:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:21:00,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:21:00,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:21:00,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048565480] [2023-08-30 23:21:00,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048565480] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:21:00,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:21:00,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:21:00,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271400674] [2023-08-30 23:21:00,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:21:00,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 23:21:00,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:21:00,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 23:21:00,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 23:21:00,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 214 [2023-08-30 23:21:00,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 53 flow. Second operand has 2 states, 2 states have (on average 116.0) internal successors, (232), 2 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:00,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:21:00,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 214 [2023-08-30 23:21:00,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:21:01,227 INFO L130 PetriNetUnfolder]: 855/1292 cut-off events. [2023-08-30 23:21:01,228 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-30 23:21:01,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2619 conditions, 1292 events. 855/1292 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5364 event pairs, 855 based on Foata normal form. 64/1264 useless extension candidates. Maximal degree in co-relation 2608. Up to 1281 conditions per place. [2023-08-30 23:21:01,241 INFO L137 encePairwiseOnDemand]: 213/214 looper letters, 19 selfloop transitions, 0 changer transitions 1/21 dead transitions. [2023-08-30 23:21:01,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 21 transitions, 91 flow [2023-08-30 23:21:01,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 23:21:01,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 23:21:01,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 243 transitions. [2023-08-30 23:21:01,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5677570093457944 [2023-08-30 23:21:01,258 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 243 transitions. [2023-08-30 23:21:01,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 243 transitions. [2023-08-30 23:21:01,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:21:01,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 243 transitions. [2023-08-30 23:21:01,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 121.5) internal successors, (243), 2 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:01,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:01,273 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:01,275 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 53 flow. Second operand 2 states and 243 transitions. [2023-08-30 23:21:01,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 21 transitions, 91 flow [2023-08-30 23:21:01,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 21 transitions, 88 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 23:21:01,280 INFO L231 Difference]: Finished difference. Result has 29 places, 20 transitions, 46 flow [2023-08-30 23:21:01,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=46, PETRI_PLACES=29, PETRI_TRANSITIONS=20} [2023-08-30 23:21:01,285 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2023-08-30 23:21:01,285 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 46 flow [2023-08-30 23:21:01,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 116.0) internal successors, (232), 2 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:01,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:21:01,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:21:01,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 23:21:01,290 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 23:21:01,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:21:01,299 INFO L85 PathProgramCache]: Analyzing trace with hash 767028099, now seen corresponding path program 1 times [2023-08-30 23:21:01,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:21:01,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039321930] [2023-08-30 23:21:01,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:21:01,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:21:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:21:01,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:21:01,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:21:01,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039321930] [2023-08-30 23:21:01,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039321930] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:21:01,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:21:01,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:21:01,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85680173] [2023-08-30 23:21:01,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:21:01,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:21:01,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:21:01,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:21:01,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:21:01,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 214 [2023-08-30 23:21:01,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 46 flow. Second operand has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:01,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:21:01,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 214 [2023-08-30 23:21:01,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:21:02,196 INFO L130 PetriNetUnfolder]: 963/1468 cut-off events. [2023-08-30 23:21:02,197 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:21:02,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2981 conditions, 1468 events. 963/1468 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6157 event pairs, 293 based on Foata normal form. 80/1548 useless extension candidates. Maximal degree in co-relation 2978. Up to 1213 conditions per place. [2023-08-30 23:21:02,204 INFO L137 encePairwiseOnDemand]: 209/214 looper letters, 29 selfloop transitions, 3 changer transitions 17/49 dead transitions. [2023-08-30 23:21:02,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 49 transitions, 206 flow [2023-08-30 23:21:02,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:21:02,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:21:02,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2023-08-30 23:21:02,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5476635514018692 [2023-08-30 23:21:02,210 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 586 transitions. [2023-08-30 23:21:02,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 586 transitions. [2023-08-30 23:21:02,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:21:02,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 586 transitions. [2023-08-30 23:21:02,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:02,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:02,218 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:02,218 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 46 flow. Second operand 5 states and 586 transitions. [2023-08-30 23:21:02,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 49 transitions, 206 flow [2023-08-30 23:21:02,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 49 transitions, 206 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 23:21:02,220 INFO L231 Difference]: Finished difference. Result has 35 places, 22 transitions, 73 flow [2023-08-30 23:21:02,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=73, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2023-08-30 23:21:02,221 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2023-08-30 23:21:02,221 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 73 flow [2023-08-30 23:21:02,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:02,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:21:02,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:21:02,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 23:21:02,223 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 23:21:02,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:21:02,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1991950769, now seen corresponding path program 1 times [2023-08-30 23:21:02,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:21:02,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038573833] [2023-08-30 23:21:02,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:21:02,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:21:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:21:02,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:21:02,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:21:02,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038573833] [2023-08-30 23:21:02,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038573833] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:21:02,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:21:02,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:21:02,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350205496] [2023-08-30 23:21:02,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:21:02,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:21:02,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:21:02,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:21:02,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:21:02,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 214 [2023-08-30 23:21:02,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 22 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:02,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:21:02,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 214 [2023-08-30 23:21:02,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:21:02,841 INFO L130 PetriNetUnfolder]: 769/1230 cut-off events. [2023-08-30 23:21:02,841 INFO L131 PetriNetUnfolder]: For 513/513 co-relation queries the response was YES. [2023-08-30 23:21:02,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2974 conditions, 1230 events. 769/1230 cut-off events. For 513/513 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5241 event pairs, 199 based on Foata normal form. 60/1290 useless extension candidates. Maximal degree in co-relation 2967. Up to 831 conditions per place. [2023-08-30 23:21:02,848 INFO L137 encePairwiseOnDemand]: 210/214 looper letters, 26 selfloop transitions, 2 changer transitions 14/44 dead transitions. [2023-08-30 23:21:02,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 206 flow [2023-08-30 23:21:02,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:21:02,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:21:02,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2023-08-30 23:21:02,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5542056074766355 [2023-08-30 23:21:02,851 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 593 transitions. [2023-08-30 23:21:02,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 593 transitions. [2023-08-30 23:21:02,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:21:02,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 593 transitions. [2023-08-30 23:21:02,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:02,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:02,856 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:02,856 INFO L175 Difference]: Start difference. First operand has 35 places, 22 transitions, 73 flow. Second operand 5 states and 593 transitions. [2023-08-30 23:21:02,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 206 flow [2023-08-30 23:21:02,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 200 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 23:21:02,862 INFO L231 Difference]: Finished difference. Result has 38 places, 22 transitions, 80 flow [2023-08-30 23:21:02,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, 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=5, PETRI_FLOW=80, PETRI_PLACES=38, PETRI_TRANSITIONS=22} [2023-08-30 23:21:02,864 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2023-08-30 23:21:02,867 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 22 transitions, 80 flow [2023-08-30 23:21:02,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:02,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:21:02,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:21:02,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 23:21:02,868 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 23:21:02,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:21:02,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1321479272, now seen corresponding path program 1 times [2023-08-30 23:21:02,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:21:02,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081527471] [2023-08-30 23:21:02,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:21:02,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:21:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:21:04,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:21:04,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:21:04,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081527471] [2023-08-30 23:21:04,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081527471] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:21:04,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:21:04,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:21:04,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540529544] [2023-08-30 23:21:04,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:21:04,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:21:04,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:21:04,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:21:04,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:21:04,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 214 [2023-08-30 23:21:04,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 22 transitions, 80 flow. Second operand has 7 states, 7 states have (on average 101.71428571428571) internal successors, (712), 7 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:04,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:21:04,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 214 [2023-08-30 23:21:04,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:21:04,573 INFO L130 PetriNetUnfolder]: 732/1179 cut-off events. [2023-08-30 23:21:04,573 INFO L131 PetriNetUnfolder]: For 948/948 co-relation queries the response was YES. [2023-08-30 23:21:04,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3011 conditions, 1179 events. 732/1179 cut-off events. For 948/948 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5016 event pairs, 346 based on Foata normal form. 60/1239 useless extension candidates. Maximal degree in co-relation 3002. Up to 918 conditions per place. [2023-08-30 23:21:04,581 INFO L137 encePairwiseOnDemand]: 208/214 looper letters, 32 selfloop transitions, 6 changer transitions 14/54 dead transitions. [2023-08-30 23:21:04,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 275 flow [2023-08-30 23:21:04,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:21:04,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:21:04,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 652 transitions. [2023-08-30 23:21:04,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5077881619937694 [2023-08-30 23:21:04,588 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 652 transitions. [2023-08-30 23:21:04,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 652 transitions. [2023-08-30 23:21:04,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:21:04,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 652 transitions. [2023-08-30 23:21:04,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:04,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:04,593 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:04,594 INFO L175 Difference]: Start difference. First operand has 38 places, 22 transitions, 80 flow. Second operand 6 states and 652 transitions. [2023-08-30 23:21:04,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 275 flow [2023-08-30 23:21:04,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 54 transitions, 265 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-30 23:21:04,600 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 114 flow [2023-08-30 23:21:04,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=114, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2023-08-30 23:21:04,602 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2023-08-30 23:21:04,602 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 114 flow [2023-08-30 23:21:04,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.71428571428571) internal successors, (712), 7 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:04,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:21:04,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:21:04,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 23:21:04,603 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 23:21:04,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:21:04,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1982159922, now seen corresponding path program 1 times [2023-08-30 23:21:04,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:21:04,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972572270] [2023-08-30 23:21:04,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:21:04,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:21:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:21:05,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:21:05,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:21:05,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972572270] [2023-08-30 23:21:05,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972572270] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:21:05,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:21:05,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:21:05,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543272850] [2023-08-30 23:21:05,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:21:05,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:21:05,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:21:05,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:21:05,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:21:05,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 214 [2023-08-30 23:21:05,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 114 flow. Second operand has 6 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:05,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:21:05,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 214 [2023-08-30 23:21:05,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:21:06,204 INFO L130 PetriNetUnfolder]: 1202/1924 cut-off events. [2023-08-30 23:21:06,204 INFO L131 PetriNetUnfolder]: For 1890/1904 co-relation queries the response was YES. [2023-08-30 23:21:06,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5255 conditions, 1924 events. 1202/1924 cut-off events. For 1890/1904 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 9647 event pairs, 405 based on Foata normal form. 59/1958 useless extension candidates. Maximal degree in co-relation 5244. Up to 1171 conditions per place. [2023-08-30 23:21:06,218 INFO L137 encePairwiseOnDemand]: 203/214 looper letters, 35 selfloop transitions, 14 changer transitions 12/63 dead transitions. [2023-08-30 23:21:06,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 63 transitions, 344 flow [2023-08-30 23:21:06,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:21:06,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:21:06,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 771 transitions. [2023-08-30 23:21:06,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5146862483311081 [2023-08-30 23:21:06,221 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 771 transitions. [2023-08-30 23:21:06,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 771 transitions. [2023-08-30 23:21:06,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:21:06,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 771 transitions. [2023-08-30 23:21:06,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.14285714285714) internal successors, (771), 7 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:06,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:06,227 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:06,227 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 114 flow. Second operand 7 states and 771 transitions. [2023-08-30 23:21:06,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 63 transitions, 344 flow [2023-08-30 23:21:06,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 63 transitions, 336 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-30 23:21:06,235 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 215 flow [2023-08-30 23:21:06,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=215, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2023-08-30 23:21:06,237 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2023-08-30 23:21:06,237 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 215 flow [2023-08-30 23:21:06,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:06,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:21:06,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:21:06,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 23:21:06,239 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 23:21:06,239 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:21:06,239 INFO L85 PathProgramCache]: Analyzing trace with hash -389600180, now seen corresponding path program 2 times [2023-08-30 23:21:06,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:21:06,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012462337] [2023-08-30 23:21:06,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:21:06,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:21:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:21:07,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:21:07,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:21:07,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012462337] [2023-08-30 23:21:07,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012462337] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:21:07,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:21:07,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 23:21:07,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625873904] [2023-08-30 23:21:07,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:21:07,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 23:21:07,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:21:07,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 23:21:07,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-30 23:21:07,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 214 [2023-08-30 23:21:07,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 215 flow. Second operand has 9 states, 9 states have (on average 99.44444444444444) internal successors, (895), 9 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:07,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:21:07,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 214 [2023-08-30 23:21:07,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:21:08,323 INFO L130 PetriNetUnfolder]: 1056/1725 cut-off events. [2023-08-30 23:21:08,323 INFO L131 PetriNetUnfolder]: For 3036/3054 co-relation queries the response was YES. [2023-08-30 23:21:08,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5708 conditions, 1725 events. 1056/1725 cut-off events. For 3036/3054 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8391 event pairs, 400 based on Foata normal form. 40/1757 useless extension candidates. Maximal degree in co-relation 5693. Up to 1310 conditions per place. [2023-08-30 23:21:08,336 INFO L137 encePairwiseOnDemand]: 209/214 looper letters, 46 selfloop transitions, 11 changer transitions 12/71 dead transitions. [2023-08-30 23:21:08,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 71 transitions, 509 flow [2023-08-30 23:21:08,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:21:08,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:21:08,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 635 transitions. [2023-08-30 23:21:08,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4945482866043614 [2023-08-30 23:21:08,339 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 635 transitions. [2023-08-30 23:21:08,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 635 transitions. [2023-08-30 23:21:08,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:21:08,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 635 transitions. [2023-08-30 23:21:08,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:08,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:08,344 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:08,344 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 215 flow. Second operand 6 states and 635 transitions. [2023-08-30 23:21:08,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 71 transitions, 509 flow [2023-08-30 23:21:08,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 71 transitions, 502 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-30 23:21:08,355 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 284 flow [2023-08-30 23:21:08,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=284, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2023-08-30 23:21:08,360 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 21 predicate places. [2023-08-30 23:21:08,361 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 284 flow [2023-08-30 23:21:08,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 99.44444444444444) internal successors, (895), 9 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:08,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:21:08,362 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:21:08,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 23:21:08,362 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 23:21:08,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:21:08,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1623774651, now seen corresponding path program 1 times [2023-08-30 23:21:08,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:21:08,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724367138] [2023-08-30 23:21:08,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:21:08,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:21:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:21:08,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:21:08,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:21:08,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724367138] [2023-08-30 23:21:08,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724367138] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:21:08,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:21:08,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:21:08,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110610750] [2023-08-30 23:21:08,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:21:08,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:21:08,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:21:08,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:21:08,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:21:08,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 214 [2023-08-30 23:21:08,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:08,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:21:08,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 214 [2023-08-30 23:21:08,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:21:08,765 INFO L130 PetriNetUnfolder]: 595/1016 cut-off events. [2023-08-30 23:21:08,765 INFO L131 PetriNetUnfolder]: For 2074/2079 co-relation queries the response was YES. [2023-08-30 23:21:08,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3638 conditions, 1016 events. 595/1016 cut-off events. For 2074/2079 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4609 event pairs, 146 based on Foata normal form. 43/1050 useless extension candidates. Maximal degree in co-relation 3621. Up to 848 conditions per place. [2023-08-30 23:21:08,773 INFO L137 encePairwiseOnDemand]: 209/214 looper letters, 62 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2023-08-30 23:21:08,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 68 transitions, 600 flow [2023-08-30 23:21:08,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:21:08,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:21:08,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2023-08-30 23:21:08,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5514018691588785 [2023-08-30 23:21:08,775 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2023-08-30 23:21:08,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2023-08-30 23:21:08,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:21:08,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2023-08-30 23:21:08,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:08,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:08,779 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:08,779 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 284 flow. Second operand 3 states and 354 transitions. [2023-08-30 23:21:08,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 68 transitions, 600 flow [2023-08-30 23:21:08,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 68 transitions, 567 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-08-30 23:21:08,785 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 289 flow [2023-08-30 23:21:08,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=289, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2023-08-30 23:21:08,786 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 18 predicate places. [2023-08-30 23:21:08,786 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 289 flow [2023-08-30 23:21:08,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:08,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:21:08,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:21:08,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 23:21:08,787 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 23:21:08,787 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:21:08,787 INFO L85 PathProgramCache]: Analyzing trace with hash 790437399, now seen corresponding path program 1 times [2023-08-30 23:21:08,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:21:08,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436970993] [2023-08-30 23:21:08,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:21:08,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:21:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:21:09,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:21:09,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:21:09,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436970993] [2023-08-30 23:21:09,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436970993] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:21:09,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:21:09,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:21:09,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866037898] [2023-08-30 23:21:09,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:21:09,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:21:09,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:21:09,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:21:09,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:21:09,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 214 [2023-08-30 23:21:09,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 289 flow. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:09,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:21:09,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 214 [2023-08-30 23:21:09,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:21:09,213 INFO L130 PetriNetUnfolder]: 282/537 cut-off events. [2023-08-30 23:21:09,214 INFO L131 PetriNetUnfolder]: For 872/877 co-relation queries the response was YES. [2023-08-30 23:21:09,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2086 conditions, 537 events. 282/537 cut-off events. For 872/877 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2277 event pairs, 47 based on Foata normal form. 56/590 useless extension candidates. Maximal degree in co-relation 2071. Up to 206 conditions per place. [2023-08-30 23:21:09,218 INFO L137 encePairwiseOnDemand]: 209/214 looper letters, 77 selfloop transitions, 7 changer transitions 0/86 dead transitions. [2023-08-30 23:21:09,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 86 transitions, 731 flow [2023-08-30 23:21:09,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:21:09,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:21:09,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 472 transitions. [2023-08-30 23:21:09,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5514018691588785 [2023-08-30 23:21:09,221 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 472 transitions. [2023-08-30 23:21:09,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 472 transitions. [2023-08-30 23:21:09,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:21:09,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 472 transitions. [2023-08-30 23:21:09,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:09,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:09,225 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:09,225 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 289 flow. Second operand 4 states and 472 transitions. [2023-08-30 23:21:09,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 86 transitions, 731 flow [2023-08-30 23:21:09,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 86 transitions, 713 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 23:21:09,230 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 318 flow [2023-08-30 23:21:09,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=318, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2023-08-30 23:21:09,232 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 20 predicate places. [2023-08-30 23:21:09,232 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 318 flow [2023-08-30 23:21:09,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:09,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:21:09,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:21:09,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 23:21:09,233 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 23:21:09,234 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:21:09,234 INFO L85 PathProgramCache]: Analyzing trace with hash 2002347906, now seen corresponding path program 1 times [2023-08-30 23:21:09,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:21:09,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590702337] [2023-08-30 23:21:09,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:21:09,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:21:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:21:09,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:21:09,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:21:09,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590702337] [2023-08-30 23:21:09,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590702337] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:21:09,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:21:09,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:21:09,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972357402] [2023-08-30 23:21:09,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:21:09,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:21:09,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:21:09,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:21:09,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:21:09,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 214 [2023-08-30 23:21:09,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 318 flow. Second operand has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:09,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:21:09,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 214 [2023-08-30 23:21:09,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:21:09,685 INFO L130 PetriNetUnfolder]: 218/418 cut-off events. [2023-08-30 23:21:09,686 INFO L131 PetriNetUnfolder]: For 954/959 co-relation queries the response was YES. [2023-08-30 23:21:09,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1755 conditions, 418 events. 218/418 cut-off events. For 954/959 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1730 event pairs, 35 based on Foata normal form. 24/440 useless extension candidates. Maximal degree in co-relation 1740. Up to 177 conditions per place. [2023-08-30 23:21:09,689 INFO L137 encePairwiseOnDemand]: 209/214 looper letters, 74 selfloop transitions, 10 changer transitions 0/86 dead transitions. [2023-08-30 23:21:09,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 86 transitions, 741 flow [2023-08-30 23:21:09,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:21:09,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:21:09,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 579 transitions. [2023-08-30 23:21:09,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5411214953271029 [2023-08-30 23:21:09,692 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 579 transitions. [2023-08-30 23:21:09,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 579 transitions. [2023-08-30 23:21:09,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:21:09,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 579 transitions. [2023-08-30 23:21:09,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:09,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:09,699 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:09,699 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 318 flow. Second operand 5 states and 579 transitions. [2023-08-30 23:21:09,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 86 transitions, 741 flow [2023-08-30 23:21:09,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 86 transitions, 683 flow, removed 11 selfloop flow, removed 5 redundant places. [2023-08-30 23:21:09,705 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 307 flow [2023-08-30 23:21:09,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=307, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2023-08-30 23:21:09,706 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 20 predicate places. [2023-08-30 23:21:09,706 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 307 flow [2023-08-30 23:21:09,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:09,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:21:09,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:21:09,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 23:21:09,707 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 23:21:09,708 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:21:09,708 INFO L85 PathProgramCache]: Analyzing trace with hash -468819531, now seen corresponding path program 1 times [2023-08-30 23:21:09,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:21:09,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767960833] [2023-08-30 23:21:09,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:21:09,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:21:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:21:10,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:21:10,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:21:10,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767960833] [2023-08-30 23:21:10,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767960833] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:21:10,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:21:10,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:21:10,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943586641] [2023-08-30 23:21:10,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:21:10,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:21:10,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:21:10,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:21:10,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:21:10,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 214 [2023-08-30 23:21:10,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 307 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:10,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:21:10,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 214 [2023-08-30 23:21:10,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:21:10,182 INFO L130 PetriNetUnfolder]: 315/594 cut-off events. [2023-08-30 23:21:10,183 INFO L131 PetriNetUnfolder]: For 1530/1530 co-relation queries the response was YES. [2023-08-30 23:21:10,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2463 conditions, 594 events. 315/594 cut-off events. For 1530/1530 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2579 event pairs, 103 based on Foata normal form. 1/595 useless extension candidates. Maximal degree in co-relation 2450. Up to 372 conditions per place. [2023-08-30 23:21:10,186 INFO L137 encePairwiseOnDemand]: 210/214 looper letters, 39 selfloop transitions, 2 changer transitions 30/71 dead transitions. [2023-08-30 23:21:10,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 609 flow [2023-08-30 23:21:10,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:21:10,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:21:10,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 460 transitions. [2023-08-30 23:21:10,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5373831775700935 [2023-08-30 23:21:10,188 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 460 transitions. [2023-08-30 23:21:10,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 460 transitions. [2023-08-30 23:21:10,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:21:10,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 460 transitions. [2023-08-30 23:21:10,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:10,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:10,192 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:10,192 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 307 flow. Second operand 4 states and 460 transitions. [2023-08-30 23:21:10,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 609 flow [2023-08-30 23:21:10,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 71 transitions, 559 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-30 23:21:10,197 INFO L231 Difference]: Finished difference. Result has 53 places, 34 transitions, 201 flow [2023-08-30 23:21:10,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=201, PETRI_PLACES=53, PETRI_TRANSITIONS=34} [2023-08-30 23:21:10,198 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 22 predicate places. [2023-08-30 23:21:10,198 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 34 transitions, 201 flow [2023-08-30 23:21:10,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:10,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:21:10,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:21:10,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 23:21:10,199 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 23:21:10,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:21:10,200 INFO L85 PathProgramCache]: Analyzing trace with hash -941378337, now seen corresponding path program 2 times [2023-08-30 23:21:10,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:21:10,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638044883] [2023-08-30 23:21:10,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:21:10,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:21:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:21:11,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:21:11,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:21:11,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638044883] [2023-08-30 23:21:11,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638044883] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:21:11,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:21:11,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 23:21:11,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352664628] [2023-08-30 23:21:11,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:21:11,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 23:21:11,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:21:11,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 23:21:11,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-30 23:21:11,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 214 [2023-08-30 23:21:11,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 34 transitions, 201 flow. Second operand has 9 states, 9 states have (on average 105.11111111111111) internal successors, (946), 9 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:11,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:21:11,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 214 [2023-08-30 23:21:11,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:21:12,201 INFO L130 PetriNetUnfolder]: 155/331 cut-off events. [2023-08-30 23:21:12,201 INFO L131 PetriNetUnfolder]: For 568/568 co-relation queries the response was YES. [2023-08-30 23:21:12,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1303 conditions, 331 events. 155/331 cut-off events. For 568/568 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1387 event pairs, 37 based on Foata normal form. 1/332 useless extension candidates. Maximal degree in co-relation 1288. Up to 151 conditions per place. [2023-08-30 23:21:12,203 INFO L137 encePairwiseOnDemand]: 207/214 looper letters, 40 selfloop transitions, 6 changer transitions 22/69 dead transitions. [2023-08-30 23:21:12,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 69 transitions, 524 flow [2023-08-30 23:21:12,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:21:12,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:21:12,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 761 transitions. [2023-08-30 23:21:12,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5080106809078772 [2023-08-30 23:21:12,207 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 761 transitions. [2023-08-30 23:21:12,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 761 transitions. [2023-08-30 23:21:12,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:21:12,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 761 transitions. [2023-08-30 23:21:12,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.71428571428571) internal successors, (761), 7 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:12,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:12,212 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:12,213 INFO L175 Difference]: Start difference. First operand has 53 places, 34 transitions, 201 flow. Second operand 7 states and 761 transitions. [2023-08-30 23:21:12,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 69 transitions, 524 flow [2023-08-30 23:21:12,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 69 transitions, 476 flow, removed 9 selfloop flow, removed 9 redundant places. [2023-08-30 23:21:12,217 INFO L231 Difference]: Finished difference. Result has 52 places, 35 transitions, 200 flow [2023-08-30 23:21:12,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=200, PETRI_PLACES=52, PETRI_TRANSITIONS=35} [2023-08-30 23:21:12,218 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 21 predicate places. [2023-08-30 23:21:12,218 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 35 transitions, 200 flow [2023-08-30 23:21:12,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 105.11111111111111) internal successors, (946), 9 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:21:12,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:21:12,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:21:12,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 23:21:12,219 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 23:21:12,219 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:21:12,219 INFO L85 PathProgramCache]: Analyzing trace with hash 247753307, now seen corresponding path program 3 times [2023-08-30 23:21:12,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:21:12,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021865020] [2023-08-30 23:21:12,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:21:12,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:21:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:21:12,308 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 23:21:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:21:12,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 23:21:12,397 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 23:21:12,398 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-30 23:21:12,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-08-30 23:21:12,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-08-30 23:21:12,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-08-30 23:21:12,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 23:21:12,403 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:21:12,408 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 23:21:12,408 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 23:21:12,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 11:21:12 BasicIcfg [2023-08-30 23:21:12,510 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 23:21:12,510 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 23:21:12,510 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 23:21:12,511 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 23:21:12,511 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:20:54" (3/4) ... [2023-08-30 23:21:12,513 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 23:21:12,600 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 23:21:12,601 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 23:21:12,601 INFO L158 Benchmark]: Toolchain (without parser) took 19325.20ms. Allocated memory was 102.8MB in the beginning and 415.2MB in the end (delta: 312.5MB). Free memory was 80.7MB in the beginning and 331.7MB in the end (delta: -251.0MB). Peak memory consumption was 61.0MB. Max. memory is 16.1GB. [2023-08-30 23:21:12,601 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 62.9MB. Free memory is still 40.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 23:21:12,602 INFO L158 Benchmark]: CACSL2BoogieTranslator took 557.62ms. Allocated memory is still 102.8MB. Free memory was 80.7MB in the beginning and 56.5MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-08-30 23:21:12,602 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.07ms. Allocated memory is still 102.8MB. Free memory was 56.5MB in the beginning and 81.5MB in the end (delta: -25.0MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. [2023-08-30 23:21:12,602 INFO L158 Benchmark]: Boogie Preprocessor took 65.75ms. Allocated memory is still 102.8MB. Free memory was 81.5MB in the beginning and 78.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:21:12,602 INFO L158 Benchmark]: RCFGBuilder took 976.11ms. Allocated memory is still 102.8MB. Free memory was 78.9MB in the beginning and 49.9MB in the end (delta: 29.0MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. [2023-08-30 23:21:12,603 INFO L158 Benchmark]: TraceAbstraction took 17543.70ms. Allocated memory was 102.8MB in the beginning and 415.2MB in the end (delta: 312.5MB). Free memory was 49.3MB in the beginning and 346.4MB in the end (delta: -297.1MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2023-08-30 23:21:12,603 INFO L158 Benchmark]: Witness Printer took 90.27ms. Allocated memory is still 415.2MB. Free memory was 346.4MB in the beginning and 331.7MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-08-30 23:21:12,604 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.24ms. Allocated memory is still 62.9MB. Free memory is still 40.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 557.62ms. Allocated memory is still 102.8MB. Free memory was 80.7MB in the beginning and 56.5MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.07ms. Allocated memory is still 102.8MB. Free memory was 56.5MB in the beginning and 81.5MB in the end (delta: -25.0MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.75ms. Allocated memory is still 102.8MB. Free memory was 81.5MB in the beginning and 78.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 976.11ms. Allocated memory is still 102.8MB. Free memory was 78.9MB in the beginning and 49.9MB in the end (delta: 29.0MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. * TraceAbstraction took 17543.70ms. Allocated memory was 102.8MB in the beginning and 415.2MB in the end (delta: 312.5MB). Free memory was 49.3MB in the beginning and 346.4MB in the end (delta: -297.1MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * Witness Printer took 90.27ms. Allocated memory is still 415.2MB. Free memory was 346.4MB in the beginning and 331.7MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 117 PlacesBefore, 31 PlacesAfterwards, 108 TransitionsBefore, 22 TransitionsAfterwards, 1138 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 91 TotalNumberOfCompositions, 3288 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1153, independent: 982, independent conditional: 0, independent unconditional: 982, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 576, independent: 542, independent conditional: 0, independent unconditional: 542, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1153, independent: 440, independent conditional: 0, independent unconditional: 440, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 576, unknown conditional: 0, unknown unconditional: 576] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 42, Positive conditional cache size: 0, Positive unconditional cache size: 42, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2269; [L850] FCALL, FORK 0 pthread_create(&t2269, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2269, ((void *)0), P0, ((void *)0))=-1, t2269={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_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={3:0}, y=0] [L851] 0 pthread_t t2270; [L852] FCALL, FORK 0 pthread_create(&t2270, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2270, ((void *)0), P1, ((void *)0))=0, t2269={6:0}, t2270={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_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={3:0}, y=0] [L853] 0 pthread_t t2271; [L854] FCALL, FORK 0 pthread_create(&t2271, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2271, ((void *)0), P2, ((void *)0))=1, t2269={6:0}, t2270={7:0}, t2271={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_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={3:0}, y=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 x$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(x) [L809] 3 x$mem_tmp = x [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] EXPR 3 \read(x) [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L811] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L812] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L813] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L814] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L816] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L818] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L819] EXPR 3 \read(x) [L819] 3 __unbuffered_p2_EAX = x [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] 3 x = x$flush_delayed ? x$mem_tmp : x [L821] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, 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={3:0}, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, 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={3:0}, y=1] [L759] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, 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={3:0}, y=2] [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 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) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 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 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, 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={3:0}, y=2] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, 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={3:0}, y=2] [L789] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, 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={3:0}, y=2] [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 \read(x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 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) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 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 [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 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_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, 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={3:0}, y=2] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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={3:0}, y=2] [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 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) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 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 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2269={6:0}, t2270={7:0}, t2271={5:0}, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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={3:0}, y=2] [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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={3:0}, y=2] - UnprovableResult [Line: 852]: 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: 850]: 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: 854]: 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, 147 locations, 4 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: 17.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 616 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 472 mSDsluCounter, 473 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 458 mSDsCounter, 139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1475 IncrementalHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 139 mSolverCounterUnsat, 15 mSDtfsCounter, 1475 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=318occurred in iteration=8, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 174 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 143 ConstructedInterpolants, 0 QuantifiedInterpolants, 1495 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-08-30 23:21:12,628 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