./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix044.opt.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/mix044.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb408c890b0d52a937687fd58d564d57121120b7f4647156375768e776a678b4 --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:14:13,202 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 23:14:13,204 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 23:14:13,244 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 23:14:13,254 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 23:14:13,257 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 23:14:13,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 23:14:13,260 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 23:14:13,263 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 23:14:13,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 23:14:13,266 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 23:14:13,268 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 23:14:13,269 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 23:14:13,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 23:14:13,274 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 23:14:13,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 23:14:13,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 23:14:13,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 23:14:13,279 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 23:14:13,281 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 23:14:13,283 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 23:14:13,287 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 23:14:13,288 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 23:14:13,289 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 23:14:13,291 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 23:14:13,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 23:14:13,297 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 23:14:13,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 23:14:13,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 23:14:13,299 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 23:14:13,300 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 23:14:13,301 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 23:14:13,302 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 23:14:13,303 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 23:14:13,304 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 23:14:13,304 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 23:14:13,305 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 23:14:13,305 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 23:14:13,306 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 23:14:13,306 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 23:14:13,307 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 23:14:13,308 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:14:13,339 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 23:14:13,339 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 23:14:13,340 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 23:14:13,340 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 23:14:13,341 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 23:14:13,341 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 23:14:13,342 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 23:14:13,342 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 23:14:13,342 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 23:14:13,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 23:14:13,343 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 23:14:13,343 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 23:14:13,343 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 23:14:13,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 23:14:13,344 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 23:14:13,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 23:14:13,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 23:14:13,344 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 23:14:13,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 23:14:13,344 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 23:14:13,345 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 23:14:13,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 23:14:13,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 23:14:13,345 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 23:14:13,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:14:13,346 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 23:14:13,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 23:14:13,346 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 23:14:13,346 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 23:14:13,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 23:14:13,346 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 23:14:13,347 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 23:14:13,347 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 23:14:13,347 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 23:14:13,347 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 23:14:13,347 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 -> bb408c890b0d52a937687fd58d564d57121120b7f4647156375768e776a678b4 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:14:13,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 23:14:13,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 23:14:13,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 23:14:13,691 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 23:14:13,691 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 23:14:13,692 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044.opt.i [2023-08-30 23:14:14,947 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 23:14:15,214 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 23:14:15,215 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044.opt.i [2023-08-30 23:14:15,227 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53e26fb93/abca77d129e34e63bc5e055194bafe86/FLAG69cbc5cba [2023-08-30 23:14:15,242 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53e26fb93/abca77d129e34e63bc5e055194bafe86 [2023-08-30 23:14:15,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 23:14:15,246 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 23:14:15,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 23:14:15,247 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 23:14:15,250 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 23:14:15,251 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:14:15" (1/1) ... [2023-08-30 23:14:15,252 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37058f3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:15, skipping insertion in model container [2023-08-30 23:14:15,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:14:15" (1/1) ... [2023-08-30 23:14:15,257 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 23:14:15,288 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 23:14:15,462 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/mix044.opt.i[944,957] [2023-08-30 23:14:15,684 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:14:15,698 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 23:14:15,708 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/mix044.opt.i[944,957] [2023-08-30 23:14:15,800 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:14:15,841 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:14:15,841 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:14:15,846 INFO L208 MainTranslator]: Completed translation [2023-08-30 23:14:15,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:15 WrapperNode [2023-08-30 23:14:15,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 23:14:15,847 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 23:14:15,847 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 23:14:15,847 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 23:14:15,852 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:14:15" (1/1) ... [2023-08-30 23:14:15,865 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:14:15" (1/1) ... [2023-08-30 23:14:15,893 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 168 [2023-08-30 23:14:15,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 23:14:15,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 23:14:15,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 23:14:15,894 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 23:14:15,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:15" (1/1) ... [2023-08-30 23:14:15,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:15" (1/1) ... [2023-08-30 23:14:15,907 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:15" (1/1) ... [2023-08-30 23:14:15,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:15" (1/1) ... [2023-08-30 23:14:15,915 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:15" (1/1) ... [2023-08-30 23:14:15,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:15" (1/1) ... [2023-08-30 23:14:15,918 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:15" (1/1) ... [2023-08-30 23:14:15,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:15" (1/1) ... [2023-08-30 23:14:15,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 23:14:15,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 23:14:15,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 23:14:15,924 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 23:14:15,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:15" (1/1) ... [2023-08-30 23:14:15,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:14:15,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 23:14:15,997 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:14:15,999 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:14:16,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 23:14:16,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 23:14:16,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 23:14:16,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 23:14:16,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 23:14:16,033 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 23:14:16,033 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 23:14:16,033 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 23:14:16,033 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 23:14:16,033 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 23:14:16,033 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 23:14:16,034 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 23:14:16,034 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 23:14:16,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 23:14:16,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 23:14:16,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 23:14:16,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 23:14:16,037 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:14:16,203 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 23:14:16,205 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 23:14:16,534 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 23:14:16,676 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 23:14:16,677 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 23:14:16,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:14:16 BoogieIcfgContainer [2023-08-30 23:14:16,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 23:14:16,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 23:14:16,681 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 23:14:16,684 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 23:14:16,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 11:14:15" (1/3) ... [2023-08-30 23:14:16,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1aedf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:14:16, skipping insertion in model container [2023-08-30 23:14:16,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:15" (2/3) ... [2023-08-30 23:14:16,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1aedf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:14:16, skipping insertion in model container [2023-08-30 23:14:16,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:14:16" (3/3) ... [2023-08-30 23:14:16,687 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044.opt.i [2023-08-30 23:14:16,694 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 23:14:16,702 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 23:14:16,702 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 23:14:16,702 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 23:14:16,752 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 23:14:16,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2023-08-30 23:14:16,824 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2023-08-30 23:14:16,824 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:14:16,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-30 23:14:16,829 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2023-08-30 23:14:16,833 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2023-08-30 23:14:16,836 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 23:14:16,843 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2023-08-30 23:14:16,845 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2023-08-30 23:14:16,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2023-08-30 23:14:16,870 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2023-08-30 23:14:16,870 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:14:16,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-30 23:14:16,873 INFO L119 LiptonReduction]: Number of co-enabled transitions 2936 [2023-08-30 23:14:20,718 INFO L134 LiptonReduction]: Checked pairs total: 7888 [2023-08-30 23:14:20,719 INFO L136 LiptonReduction]: Total number of compositions: 108 [2023-08-30 23:14:20,731 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 23:14:20,737 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;@10c5d0d8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 23:14:20,738 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-30 23:14:20,744 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2023-08-30 23:14:20,744 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:14:20,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:20,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:14:20,745 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:20,749 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:20,750 INFO L85 PathProgramCache]: Analyzing trace with hash -549343229, now seen corresponding path program 1 times [2023-08-30 23:14:20,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:20,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947394773] [2023-08-30 23:14:20,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:20,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:14:21,194 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:14:21,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:14:21,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947394773] [2023-08-30 23:14:21,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947394773] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:14:21,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:14:21,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:14:21,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322793943] [2023-08-30 23:14:21,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:14:21,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:14:21,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:14:21,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:14:21,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:14:21,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 238 [2023-08-30 23:14:21,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 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:14:21,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:14:21,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 238 [2023-08-30 23:14:21,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:14:21,866 INFO L130 PetriNetUnfolder]: 3632/5266 cut-off events. [2023-08-30 23:14:21,867 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2023-08-30 23:14:21,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10359 conditions, 5266 events. 3632/5266 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 29262 event pairs, 668 based on Foata normal form. 180/5073 useless extension candidates. Maximal degree in co-relation 10347. Up to 3973 conditions per place. [2023-08-30 23:14:21,895 INFO L137 encePairwiseOnDemand]: 234/238 looper letters, 32 selfloop transitions, 2 changer transitions 4/42 dead transitions. [2023-08-30 23:14:21,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 172 flow [2023-08-30 23:14:21,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:14:21,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:14:21,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2023-08-30 23:14:21,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5448179271708683 [2023-08-30 23:14:21,910 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2023-08-30 23:14:21,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2023-08-30 23:14:21,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:14:21,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2023-08-30 23:14:21,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 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:14:21,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 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:14:21,922 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 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:14:21,924 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 389 transitions. [2023-08-30 23:14:21,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 172 flow [2023-08-30 23:14:21,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 23:14:21,930 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 66 flow [2023-08-30 23:14:21,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-08-30 23:14:21,934 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-08-30 23:14:21,935 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 66 flow [2023-08-30 23:14:21,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 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:14:21,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:21,936 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:14:21,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 23:14:21,936 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:21,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:21,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1655972183, now seen corresponding path program 1 times [2023-08-30 23:14:21,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:21,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444973915] [2023-08-30 23:14:21,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:21,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:14:23,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:14:23,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:14:23,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444973915] [2023-08-30 23:14:23,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444973915] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:14:23,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:14:23,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:14:23,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050217263] [2023-08-30 23:14:23,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:14:23,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:14:23,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:14:23,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:14:23,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:14:23,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 238 [2023-08-30 23:14:23,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 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:14:23,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:14:23,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 238 [2023-08-30 23:14:23,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:14:24,635 INFO L130 PetriNetUnfolder]: 9099/12592 cut-off events. [2023-08-30 23:14:24,635 INFO L131 PetriNetUnfolder]: For 526/526 co-relation queries the response was YES. [2023-08-30 23:14:24,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25954 conditions, 12592 events. 9099/12592 cut-off events. For 526/526 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 66681 event pairs, 1345 based on Foata normal form. 572/13162 useless extension candidates. Maximal degree in co-relation 25944. Up to 7953 conditions per place. [2023-08-30 23:14:24,702 INFO L137 encePairwiseOnDemand]: 226/238 looper letters, 52 selfloop transitions, 12 changer transitions 39/104 dead transitions. [2023-08-30 23:14:24,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 104 transitions, 446 flow [2023-08-30 23:14:24,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:14:24,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:14:24,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 827 transitions. [2023-08-30 23:14:24,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4963985594237695 [2023-08-30 23:14:24,708 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 827 transitions. [2023-08-30 23:14:24,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 827 transitions. [2023-08-30 23:14:24,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:14:24,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 827 transitions. [2023-08-30 23:14:24,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.14285714285714) internal successors, (827), 7 states have internal predecessors, (827), 0 states have call successors, (0), 0 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:14:24,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 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:14:24,716 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 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:14:24,717 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 7 states and 827 transitions. [2023-08-30 23:14:24,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 104 transitions, 446 flow [2023-08-30 23:14:24,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 104 transitions, 432 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:14:24,722 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 157 flow [2023-08-30 23:14:24,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=157, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2023-08-30 23:14:24,723 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2023-08-30 23:14:24,723 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 157 flow [2023-08-30 23:14:24,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 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:14:24,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:24,724 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:14:24,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 23:14:24,725 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:24,727 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:24,728 INFO L85 PathProgramCache]: Analyzing trace with hash 204418508, now seen corresponding path program 1 times [2023-08-30 23:14:24,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:24,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6458915] [2023-08-30 23:14:24,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:24,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:14:25,112 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:14:25,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:14:25,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6458915] [2023-08-30 23:14:25,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6458915] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:14:25,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:14:25,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:14:25,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905592165] [2023-08-30 23:14:25,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:14:25,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:14:25,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:14:25,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:14:25,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:14:25,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 238 [2023-08-30 23:14:25,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 157 flow. Second operand has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 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:14:25,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:14:25,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 238 [2023-08-30 23:14:25,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:14:26,189 INFO L130 PetriNetUnfolder]: 6321/9196 cut-off events. [2023-08-30 23:14:26,189 INFO L131 PetriNetUnfolder]: For 7051/7179 co-relation queries the response was YES. [2023-08-30 23:14:26,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26780 conditions, 9196 events. 6321/9196 cut-off events. For 7051/7179 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 52065 event pairs, 1986 based on Foata normal form. 414/9431 useless extension candidates. Maximal degree in co-relation 26765. Up to 4858 conditions per place. [2023-08-30 23:14:26,268 INFO L137 encePairwiseOnDemand]: 234/238 looper letters, 40 selfloop transitions, 3 changer transitions 24/74 dead transitions. [2023-08-30 23:14:26,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 74 transitions, 428 flow [2023-08-30 23:14:26,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:14:26,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:14:26,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 623 transitions. [2023-08-30 23:14:26,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5235294117647059 [2023-08-30 23:14:26,271 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 623 transitions. [2023-08-30 23:14:26,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 623 transitions. [2023-08-30 23:14:26,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:14:26,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 623 transitions. [2023-08-30 23:14:26,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 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:14:26,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 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:14:26,276 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 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:14:26,277 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 157 flow. Second operand 5 states and 623 transitions. [2023-08-30 23:14:26,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 74 transitions, 428 flow [2023-08-30 23:14:26,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 74 transitions, 424 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 23:14:26,340 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 168 flow [2023-08-30 23:14:26,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2023-08-30 23:14:26,341 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2023-08-30 23:14:26,342 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 168 flow [2023-08-30 23:14:26,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 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:14:26,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:26,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:14:26,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 23:14:26,343 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:26,343 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:26,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1952092458, now seen corresponding path program 1 times [2023-08-30 23:14:26,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:26,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758459631] [2023-08-30 23:14:26,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:26,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:14:27,312 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:14:27,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:14:27,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758459631] [2023-08-30 23:14:27,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758459631] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:14:27,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:14:27,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:14:27,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840700008] [2023-08-30 23:14:27,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:14:27,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:14:27,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:14:27,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:14:27,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:14:27,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 238 [2023-08-30 23:14:27,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 168 flow. Second operand has 7 states, 7 states have (on average 107.14285714285714) internal successors, (750), 7 states have internal predecessors, (750), 0 states have call successors, (0), 0 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:14:27,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:14:27,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 238 [2023-08-30 23:14:27,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:14:28,766 INFO L130 PetriNetUnfolder]: 8945/12459 cut-off events. [2023-08-30 23:14:28,767 INFO L131 PetriNetUnfolder]: For 9236/9242 co-relation queries the response was YES. [2023-08-30 23:14:28,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38484 conditions, 12459 events. 8945/12459 cut-off events. For 9236/9242 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 63385 event pairs, 1422 based on Foata normal form. 346/12802 useless extension candidates. Maximal degree in co-relation 38466. Up to 7809 conditions per place. [2023-08-30 23:14:28,861 INFO L137 encePairwiseOnDemand]: 227/238 looper letters, 82 selfloop transitions, 23 changer transitions 31/138 dead transitions. [2023-08-30 23:14:28,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 138 transitions, 867 flow [2023-08-30 23:14:28,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 23:14:28,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 23:14:28,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 936 transitions. [2023-08-30 23:14:28,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49159663865546216 [2023-08-30 23:14:28,869 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 936 transitions. [2023-08-30 23:14:28,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 936 transitions. [2023-08-30 23:14:28,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:14:28,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 936 transitions. [2023-08-30 23:14:28,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 0 states have call successors, (0), 0 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:14:28,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 238.0) internal successors, (2142), 9 states have internal predecessors, (2142), 0 states have call successors, (0), 0 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:14:28,877 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 238.0) internal successors, (2142), 9 states have internal predecessors, (2142), 0 states have call successors, (0), 0 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:14:28,877 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 168 flow. Second operand 8 states and 936 transitions. [2023-08-30 23:14:28,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 138 transitions, 867 flow [2023-08-30 23:14:28,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 138 transitions, 849 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-30 23:14:28,945 INFO L231 Difference]: Finished difference. Result has 55 places, 59 transitions, 384 flow [2023-08-30 23:14:28,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=384, PETRI_PLACES=55, PETRI_TRANSITIONS=59} [2023-08-30 23:14:28,946 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places. [2023-08-30 23:14:28,946 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 59 transitions, 384 flow [2023-08-30 23:14:28,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.14285714285714) internal successors, (750), 7 states have internal predecessors, (750), 0 states have call successors, (0), 0 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:14:28,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:28,947 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:14:28,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 23:14:28,947 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:28,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:28,948 INFO L85 PathProgramCache]: Analyzing trace with hash -474076863, now seen corresponding path program 1 times [2023-08-30 23:14:28,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:28,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852195258] [2023-08-30 23:14:28,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:28,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:14:29,473 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:14:29,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:14:29,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852195258] [2023-08-30 23:14:29,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852195258] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:14:29,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:14:29,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:14:29,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347587829] [2023-08-30 23:14:29,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:14:29,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:14:29,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:14:29,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:14:29,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:14:29,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 238 [2023-08-30 23:14:29,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 59 transitions, 384 flow. Second operand has 7 states, 7 states have (on average 113.42857142857143) internal successors, (794), 7 states have internal predecessors, (794), 0 states have call successors, (0), 0 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:14:29,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:14:29,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 238 [2023-08-30 23:14:29,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:14:30,824 INFO L130 PetriNetUnfolder]: 7728/11089 cut-off events. [2023-08-30 23:14:30,824 INFO L131 PetriNetUnfolder]: For 16751/17094 co-relation queries the response was YES. [2023-08-30 23:14:30,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40119 conditions, 11089 events. 7728/11089 cut-off events. For 16751/17094 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 61097 event pairs, 1643 based on Foata normal form. 215/11041 useless extension candidates. Maximal degree in co-relation 40098. Up to 7477 conditions per place. [2023-08-30 23:14:30,959 INFO L137 encePairwiseOnDemand]: 230/238 looper letters, 75 selfloop transitions, 24 changer transitions 11/118 dead transitions. [2023-08-30 23:14:30,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 118 transitions, 939 flow [2023-08-30 23:14:30,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:14:30,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:14:30,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 729 transitions. [2023-08-30 23:14:30,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5105042016806722 [2023-08-30 23:14:30,963 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 729 transitions. [2023-08-30 23:14:30,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 729 transitions. [2023-08-30 23:14:30,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:14:30,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 729 transitions. [2023-08-30 23:14:30,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 0 states have call successors, (0), 0 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:14:30,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 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:14:30,968 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 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:14:30,968 INFO L175 Difference]: Start difference. First operand has 55 places, 59 transitions, 384 flow. Second operand 6 states and 729 transitions. [2023-08-30 23:14:30,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 118 transitions, 939 flow [2023-08-30 23:14:30,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 118 transitions, 927 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-30 23:14:31,002 INFO L231 Difference]: Finished difference. Result has 60 places, 73 transitions, 578 flow [2023-08-30 23:14:31,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=578, PETRI_PLACES=60, PETRI_TRANSITIONS=73} [2023-08-30 23:14:31,005 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 17 predicate places. [2023-08-30 23:14:31,005 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 73 transitions, 578 flow [2023-08-30 23:14:31,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.42857142857143) internal successors, (794), 7 states have internal predecessors, (794), 0 states have call successors, (0), 0 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:14:31,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:31,006 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:14:31,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 23:14:31,006 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:31,007 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:31,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1159661577, now seen corresponding path program 2 times [2023-08-30 23:14:31,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:31,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109940416] [2023-08-30 23:14:31,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:31,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:14:31,486 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:14:31,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:14:31,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109940416] [2023-08-30 23:14:31,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109940416] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:14:31,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:14:31,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:14:31,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836222279] [2023-08-30 23:14:31,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:14:31,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:14:31,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:14:31,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:14:31,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:14:31,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 238 [2023-08-30 23:14:31,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 73 transitions, 578 flow. Second operand has 7 states, 7 states have (on average 114.42857142857143) internal successors, (801), 7 states have internal predecessors, (801), 0 states have call successors, (0), 0 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:14:31,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:14:31,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 238 [2023-08-30 23:14:31,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:14:32,708 INFO L130 PetriNetUnfolder]: 7877/11306 cut-off events. [2023-08-30 23:14:32,708 INFO L131 PetriNetUnfolder]: For 26965/27312 co-relation queries the response was YES. [2023-08-30 23:14:32,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45146 conditions, 11306 events. 7877/11306 cut-off events. For 26965/27312 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 62494 event pairs, 1644 based on Foata normal form. 219/11262 useless extension candidates. Maximal degree in co-relation 45121. Up to 7462 conditions per place. [2023-08-30 23:14:32,784 INFO L137 encePairwiseOnDemand]: 230/238 looper letters, 79 selfloop transitions, 24 changer transitions 19/130 dead transitions. [2023-08-30 23:14:32,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 130 transitions, 1160 flow [2023-08-30 23:14:32,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:14:32,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:14:32,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 854 transitions. [2023-08-30 23:14:32,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5126050420168067 [2023-08-30 23:14:32,787 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 854 transitions. [2023-08-30 23:14:32,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 854 transitions. [2023-08-30 23:14:32,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:14:32,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 854 transitions. [2023-08-30 23:14:32,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 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:14:32,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 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:14:32,793 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 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:14:32,793 INFO L175 Difference]: Start difference. First operand has 60 places, 73 transitions, 578 flow. Second operand 7 states and 854 transitions. [2023-08-30 23:14:32,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 130 transitions, 1160 flow [2023-08-30 23:14:32,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 130 transitions, 1133 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-30 23:14:32,841 INFO L231 Difference]: Finished difference. Result has 66 places, 77 transitions, 675 flow [2023-08-30 23:14:32,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=675, PETRI_PLACES=66, PETRI_TRANSITIONS=77} [2023-08-30 23:14:32,841 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2023-08-30 23:14:32,842 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 77 transitions, 675 flow [2023-08-30 23:14:32,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.42857142857143) internal successors, (801), 7 states have internal predecessors, (801), 0 states have call successors, (0), 0 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:14:32,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:32,842 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:14:32,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 23:14:32,843 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:32,843 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:32,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1077438417, now seen corresponding path program 3 times [2023-08-30 23:14:32,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:32,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591424655] [2023-08-30 23:14:32,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:32,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:14:33,334 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:14:33,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:14:33,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591424655] [2023-08-30 23:14:33,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591424655] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:14:33,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:14:33,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:14:33,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236876893] [2023-08-30 23:14:33,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:14:33,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:14:33,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:14:33,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:14:33,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:14:33,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 238 [2023-08-30 23:14:33,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 77 transitions, 675 flow. Second operand has 7 states, 7 states have (on average 115.42857142857143) internal successors, (808), 7 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:33,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:14:33,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 238 [2023-08-30 23:14:33,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:14:34,510 INFO L130 PetriNetUnfolder]: 7627/10980 cut-off events. [2023-08-30 23:14:34,511 INFO L131 PetriNetUnfolder]: For 36168/36515 co-relation queries the response was YES. [2023-08-30 23:14:34,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46026 conditions, 10980 events. 7627/10980 cut-off events. For 36168/36515 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 60926 event pairs, 1587 based on Foata normal form. 219/10936 useless extension candidates. Maximal degree in co-relation 45998. Up to 7246 conditions per place. [2023-08-30 23:14:34,603 INFO L137 encePairwiseOnDemand]: 230/238 looper letters, 72 selfloop transitions, 30 changer transitions 11/121 dead transitions. [2023-08-30 23:14:34,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 121 transitions, 1179 flow [2023-08-30 23:14:34,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:14:34,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:14:34,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 740 transitions. [2023-08-30 23:14:34,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5182072829131653 [2023-08-30 23:14:34,606 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 740 transitions. [2023-08-30 23:14:34,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 740 transitions. [2023-08-30 23:14:34,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:14:34,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 740 transitions. [2023-08-30 23:14:34,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.33333333333333) internal successors, (740), 6 states have internal predecessors, (740), 0 states have call successors, (0), 0 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:14:34,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 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:14:34,611 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 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:14:34,611 INFO L175 Difference]: Start difference. First operand has 66 places, 77 transitions, 675 flow. Second operand 6 states and 740 transitions. [2023-08-30 23:14:34,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 121 transitions, 1179 flow [2023-08-30 23:14:34,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 121 transitions, 1133 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-30 23:14:34,680 INFO L231 Difference]: Finished difference. Result has 67 places, 81 transitions, 779 flow [2023-08-30 23:14:34,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=779, PETRI_PLACES=67, PETRI_TRANSITIONS=81} [2023-08-30 23:14:34,681 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places. [2023-08-30 23:14:34,681 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 81 transitions, 779 flow [2023-08-30 23:14:34,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.42857142857143) internal successors, (808), 7 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:34,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:34,682 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:14:34,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 23:14:34,682 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:34,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:34,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1645715443, now seen corresponding path program 1 times [2023-08-30 23:14:34,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:34,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071001384] [2023-08-30 23:14:34,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:34,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:14:34,945 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:14:34,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:14:34,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071001384] [2023-08-30 23:14:34,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071001384] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:14:34,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:14:34,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:14:34,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165651113] [2023-08-30 23:14:34,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:14:34,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:14:34,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:14:34,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:14:34,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:14:34,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 238 [2023-08-30 23:14:34,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 81 transitions, 779 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 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:14:34,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:14:34,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 238 [2023-08-30 23:14:34,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:14:35,753 INFO L130 PetriNetUnfolder]: 4508/6598 cut-off events. [2023-08-30 23:14:35,754 INFO L131 PetriNetUnfolder]: For 32694/33178 co-relation queries the response was YES. [2023-08-30 23:14:35,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29657 conditions, 6598 events. 4508/6598 cut-off events. For 32694/33178 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 36010 event pairs, 1156 based on Foata normal form. 186/6571 useless extension candidates. Maximal degree in co-relation 29628. Up to 5472 conditions per place. [2023-08-30 23:14:35,809 INFO L137 encePairwiseOnDemand]: 232/238 looper letters, 109 selfloop transitions, 5 changer transitions 0/124 dead transitions. [2023-08-30 23:14:35,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 124 transitions, 1395 flow [2023-08-30 23:14:35,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:14:35,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:14:35,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2023-08-30 23:14:35,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5280112044817927 [2023-08-30 23:14:35,811 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 377 transitions. [2023-08-30 23:14:35,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 377 transitions. [2023-08-30 23:14:35,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:14:35,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 377 transitions. [2023-08-30 23:14:35,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 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:14:35,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 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:14:35,814 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 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:14:35,815 INFO L175 Difference]: Start difference. First operand has 67 places, 81 transitions, 779 flow. Second operand 3 states and 377 transitions. [2023-08-30 23:14:35,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 124 transitions, 1395 flow [2023-08-30 23:14:35,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 124 transitions, 1323 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-08-30 23:14:35,857 INFO L231 Difference]: Finished difference. Result has 65 places, 85 transitions, 758 flow [2023-08-30 23:14:35,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=758, PETRI_PLACES=65, PETRI_TRANSITIONS=85} [2023-08-30 23:14:35,858 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 22 predicate places. [2023-08-30 23:14:35,858 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 85 transitions, 758 flow [2023-08-30 23:14:35,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 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:14:35,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:35,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:14:35,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 23:14:35,859 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:35,860 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:35,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1074154877, now seen corresponding path program 1 times [2023-08-30 23:14:35,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:35,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850115571] [2023-08-30 23:14:35,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:35,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:14:36,069 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:14:36,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:14:36,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850115571] [2023-08-30 23:14:36,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850115571] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:14:36,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:14:36,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:14:36,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278098509] [2023-08-30 23:14:36,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:14:36,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:14:36,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:14:36,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:14:36,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:14:36,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 238 [2023-08-30 23:14:36,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 85 transitions, 758 flow. Second operand has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 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:14:36,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:14:36,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 238 [2023-08-30 23:14:36,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:14:36,610 INFO L130 PetriNetUnfolder]: 2300/3570 cut-off events. [2023-08-30 23:14:36,611 INFO L131 PetriNetUnfolder]: For 15915/16213 co-relation queries the response was YES. [2023-08-30 23:14:36,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16632 conditions, 3570 events. 2300/3570 cut-off events. For 15915/16213 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 19101 event pairs, 390 based on Foata normal form. 311/3776 useless extension candidates. Maximal degree in co-relation 16603. Up to 1842 conditions per place. [2023-08-30 23:14:36,638 INFO L137 encePairwiseOnDemand]: 232/238 looper letters, 137 selfloop transitions, 9 changer transitions 0/156 dead transitions. [2023-08-30 23:14:36,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 156 transitions, 1692 flow [2023-08-30 23:14:36,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:14:36,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:14:36,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 504 transitions. [2023-08-30 23:14:36,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2023-08-30 23:14:36,641 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 504 transitions. [2023-08-30 23:14:36,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 504 transitions. [2023-08-30 23:14:36,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:14:36,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 504 transitions. [2023-08-30 23:14:36,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 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:14:36,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 0 states have call successors, (0), 0 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:14:36,645 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 0 states have call successors, (0), 0 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:14:36,645 INFO L175 Difference]: Start difference. First operand has 65 places, 85 transitions, 758 flow. Second operand 4 states and 504 transitions. [2023-08-30 23:14:36,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 156 transitions, 1692 flow [2023-08-30 23:14:36,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 156 transitions, 1687 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 23:14:36,665 INFO L231 Difference]: Finished difference. Result has 68 places, 82 transitions, 728 flow [2023-08-30 23:14:36,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=728, PETRI_PLACES=68, PETRI_TRANSITIONS=82} [2023-08-30 23:14:36,666 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places. [2023-08-30 23:14:36,666 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 82 transitions, 728 flow [2023-08-30 23:14:36,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 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:14:36,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:36,667 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:14:36,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 23:14:36,667 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:36,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:36,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1460207544, now seen corresponding path program 1 times [2023-08-30 23:14:36,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:36,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264296050] [2023-08-30 23:14:36,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:36,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:14:37,435 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:14:37,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:14:37,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264296050] [2023-08-30 23:14:37,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264296050] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:14:37,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:14:37,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:14:37,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046820450] [2023-08-30 23:14:37,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:14:37,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:14:37,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:14:37,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:14:37,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:14:37,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 238 [2023-08-30 23:14:37,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 82 transitions, 728 flow. Second operand has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 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:14:37,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:14:37,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 238 [2023-08-30 23:14:37,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:14:38,209 INFO L130 PetriNetUnfolder]: 3818/5861 cut-off events. [2023-08-30 23:14:38,209 INFO L131 PetriNetUnfolder]: For 24376/24517 co-relation queries the response was YES. [2023-08-30 23:14:38,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28863 conditions, 5861 events. 3818/5861 cut-off events. For 24376/24517 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 31878 event pairs, 357 based on Foata normal form. 130/5974 useless extension candidates. Maximal degree in co-relation 28832. Up to 2662 conditions per place. [2023-08-30 23:14:38,251 INFO L137 encePairwiseOnDemand]: 225/238 looper letters, 125 selfloop transitions, 36 changer transitions 46/209 dead transitions. [2023-08-30 23:14:38,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 209 transitions, 2171 flow [2023-08-30 23:14:38,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:14:38,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:14:38,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 808 transitions. [2023-08-30 23:14:38,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4849939975990396 [2023-08-30 23:14:38,254 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 808 transitions. [2023-08-30 23:14:38,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 808 transitions. [2023-08-30 23:14:38,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:14:38,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 808 transitions. [2023-08-30 23:14:38,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.42857142857143) internal successors, (808), 7 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:38,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 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:14:38,260 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 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:14:38,260 INFO L175 Difference]: Start difference. First operand has 68 places, 82 transitions, 728 flow. Second operand 7 states and 808 transitions. [2023-08-30 23:14:38,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 209 transitions, 2171 flow [2023-08-30 23:14:38,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 209 transitions, 2109 flow, removed 15 selfloop flow, removed 2 redundant places. [2023-08-30 23:14:38,294 INFO L231 Difference]: Finished difference. Result has 77 places, 94 transitions, 994 flow [2023-08-30 23:14:38,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=994, PETRI_PLACES=77, PETRI_TRANSITIONS=94} [2023-08-30 23:14:38,295 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places. [2023-08-30 23:14:38,295 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 94 transitions, 994 flow [2023-08-30 23:14:38,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 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:14:38,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:38,295 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:14:38,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 23:14:38,296 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:38,296 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:38,296 INFO L85 PathProgramCache]: Analyzing trace with hash 2059721732, now seen corresponding path program 2 times [2023-08-30 23:14:38,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:38,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607462470] [2023-08-30 23:14:38,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:38,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:14:38,492 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:14:38,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:14:38,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607462470] [2023-08-30 23:14:38,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607462470] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:14:38,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:14:38,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:14:38,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275798135] [2023-08-30 23:14:38,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:14:38,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:14:38,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:14:38,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:14:38,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:14:38,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 238 [2023-08-30 23:14:38,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 94 transitions, 994 flow. Second operand has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 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:14:38,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:14:38,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 238 [2023-08-30 23:14:38,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:14:39,197 INFO L130 PetriNetUnfolder]: 3978/6499 cut-off events. [2023-08-30 23:14:39,197 INFO L131 PetriNetUnfolder]: For 36941/37381 co-relation queries the response was YES. [2023-08-30 23:14:39,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33315 conditions, 6499 events. 3978/6499 cut-off events. For 36941/37381 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 40909 event pairs, 1179 based on Foata normal form. 176/6532 useless extension candidates. Maximal degree in co-relation 33279. Up to 3108 conditions per place. [2023-08-30 23:14:39,232 INFO L137 encePairwiseOnDemand]: 234/238 looper letters, 102 selfloop transitions, 8 changer transitions 36/154 dead transitions. [2023-08-30 23:14:39,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 154 transitions, 1801 flow [2023-08-30 23:14:39,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:14:39,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:14:39,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 626 transitions. [2023-08-30 23:14:39,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5260504201680672 [2023-08-30 23:14:39,235 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 626 transitions. [2023-08-30 23:14:39,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 626 transitions. [2023-08-30 23:14:39,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:14:39,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 626 transitions. [2023-08-30 23:14:39,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 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:14:39,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 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:14:39,239 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 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:14:39,239 INFO L175 Difference]: Start difference. First operand has 77 places, 94 transitions, 994 flow. Second operand 5 states and 626 transitions. [2023-08-30 23:14:39,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 154 transitions, 1801 flow [2023-08-30 23:14:39,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 154 transitions, 1783 flow, removed 9 selfloop flow, removed 1 redundant places. [2023-08-30 23:14:39,310 INFO L231 Difference]: Finished difference. Result has 82 places, 90 transitions, 951 flow [2023-08-30 23:14:39,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=978, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=951, PETRI_PLACES=82, PETRI_TRANSITIONS=90} [2023-08-30 23:14:39,311 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places. [2023-08-30 23:14:39,311 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 90 transitions, 951 flow [2023-08-30 23:14:39,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 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:14:39,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:39,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:14:39,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 23:14:39,312 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:39,312 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:39,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1290639021, now seen corresponding path program 1 times [2023-08-30 23:14:39,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:39,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170510283] [2023-08-30 23:14:39,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:39,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:14:39,515 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:14:39,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:14:39,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170510283] [2023-08-30 23:14:39,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170510283] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:14:39,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:14:39,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:14:39,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371745875] [2023-08-30 23:14:39,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:14:39,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:14:39,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:14:39,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:14:39,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:14:39,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 238 [2023-08-30 23:14:39,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 90 transitions, 951 flow. Second operand has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 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:14:39,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:14:39,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 238 [2023-08-30 23:14:39,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:14:39,978 INFO L130 PetriNetUnfolder]: 2367/3866 cut-off events. [2023-08-30 23:14:39,978 INFO L131 PetriNetUnfolder]: For 26062/26774 co-relation queries the response was YES. [2023-08-30 23:14:39,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19928 conditions, 3866 events. 2367/3866 cut-off events. For 26062/26774 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 23631 event pairs, 236 based on Foata normal form. 505/4244 useless extension candidates. Maximal degree in co-relation 19889. Up to 1491 conditions per place. [2023-08-30 23:14:39,999 INFO L137 encePairwiseOnDemand]: 232/238 looper letters, 133 selfloop transitions, 13 changer transitions 19/176 dead transitions. [2023-08-30 23:14:39,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 176 transitions, 2279 flow [2023-08-30 23:14:40,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:14:40,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:14:40,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 629 transitions. [2023-08-30 23:14:40,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2023-08-30 23:14:40,002 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 629 transitions. [2023-08-30 23:14:40,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 629 transitions. [2023-08-30 23:14:40,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:14:40,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 629 transitions. [2023-08-30 23:14:40,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.8) internal successors, (629), 5 states have internal predecessors, (629), 0 states have call successors, (0), 0 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:14:40,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 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:14:40,006 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 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:14:40,006 INFO L175 Difference]: Start difference. First operand has 82 places, 90 transitions, 951 flow. Second operand 5 states and 629 transitions. [2023-08-30 23:14:40,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 176 transitions, 2279 flow [2023-08-30 23:14:40,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 176 transitions, 1996 flow, removed 47 selfloop flow, removed 11 redundant places. [2023-08-30 23:14:40,040 INFO L231 Difference]: Finished difference. Result has 74 places, 82 transitions, 768 flow [2023-08-30 23:14:40,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=768, PETRI_PLACES=74, PETRI_TRANSITIONS=82} [2023-08-30 23:14:40,041 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 31 predicate places. [2023-08-30 23:14:40,041 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 82 transitions, 768 flow [2023-08-30 23:14:40,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 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:14:40,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:40,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:14:40,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 23:14:40,042 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:40,042 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:40,042 INFO L85 PathProgramCache]: Analyzing trace with hash 755482843, now seen corresponding path program 1 times [2023-08-30 23:14:40,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:40,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264284351] [2023-08-30 23:14:40,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:40,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:14:40,251 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:14:40,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:14:40,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264284351] [2023-08-30 23:14:40,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264284351] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:14:40,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:14:40,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:14:40,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9394] [2023-08-30 23:14:40,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:14:40,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:14:40,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:14:40,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:14:40,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:14:40,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 238 [2023-08-30 23:14:40,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 82 transitions, 768 flow. Second operand has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 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:14:40,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:14:40,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 238 [2023-08-30 23:14:40,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:14:40,624 INFO L130 PetriNetUnfolder]: 2155/3441 cut-off events. [2023-08-30 23:14:40,624 INFO L131 PetriNetUnfolder]: For 18435/18988 co-relation queries the response was YES. [2023-08-30 23:14:40,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17706 conditions, 3441 events. 2155/3441 cut-off events. For 18435/18988 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 20516 event pairs, 215 based on Foata normal form. 223/3553 useless extension candidates. Maximal degree in co-relation 17672. Up to 1353 conditions per place. [2023-08-30 23:14:40,637 INFO L137 encePairwiseOnDemand]: 232/238 looper letters, 71 selfloop transitions, 17 changer transitions 77/170 dead transitions. [2023-08-30 23:14:40,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 170 transitions, 1959 flow [2023-08-30 23:14:40,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:14:40,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:14:40,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 741 transitions. [2023-08-30 23:14:40,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5189075630252101 [2023-08-30 23:14:40,640 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 741 transitions. [2023-08-30 23:14:40,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 741 transitions. [2023-08-30 23:14:40,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:14:40,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 741 transitions. [2023-08-30 23:14:40,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.5) internal successors, (741), 6 states have internal predecessors, (741), 0 states have call successors, (0), 0 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:14:40,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 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:14:40,645 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 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:14:40,645 INFO L175 Difference]: Start difference. First operand has 74 places, 82 transitions, 768 flow. Second operand 6 states and 741 transitions. [2023-08-30 23:14:40,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 170 transitions, 1959 flow [2023-08-30 23:14:40,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 170 transitions, 1852 flow, removed 37 selfloop flow, removed 5 redundant places. [2023-08-30 23:14:40,721 INFO L231 Difference]: Finished difference. Result has 75 places, 56 transitions, 451 flow [2023-08-30 23:14:40,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=451, PETRI_PLACES=75, PETRI_TRANSITIONS=56} [2023-08-30 23:14:40,722 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places. [2023-08-30 23:14:40,722 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 56 transitions, 451 flow [2023-08-30 23:14:40,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 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:14:40,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:40,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:14:40,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 23:14:40,723 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:40,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:40,724 INFO L85 PathProgramCache]: Analyzing trace with hash -254432024, now seen corresponding path program 1 times [2023-08-30 23:14:40,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:40,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432607613] [2023-08-30 23:14:40,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:40,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:14:41,449 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:14:41,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:14:41,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432607613] [2023-08-30 23:14:41,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432607613] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:14:41,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:14:41,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:14:41,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603494567] [2023-08-30 23:14:41,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:14:41,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:14:41,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:14:41,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:14:41,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:14:41,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 238 [2023-08-30 23:14:41,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 56 transitions, 451 flow. Second operand has 6 states, 6 states have (on average 105.33333333333333) internal successors, (632), 6 states have internal predecessors, (632), 0 states have call successors, (0), 0 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:14:41,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:14:41,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 238 [2023-08-30 23:14:41,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:14:41,796 INFO L130 PetriNetUnfolder]: 604/1048 cut-off events. [2023-08-30 23:14:41,796 INFO L131 PetriNetUnfolder]: For 4052/4058 co-relation queries the response was YES. [2023-08-30 23:14:41,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5197 conditions, 1048 events. 604/1048 cut-off events. For 4052/4058 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4956 event pairs, 71 based on Foata normal form. 1/1047 useless extension candidates. Maximal degree in co-relation 5166. Up to 528 conditions per place. [2023-08-30 23:14:41,800 INFO L137 encePairwiseOnDemand]: 228/238 looper letters, 50 selfloop transitions, 6 changer transitions 65/122 dead transitions. [2023-08-30 23:14:41,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 122 transitions, 1202 flow [2023-08-30 23:14:41,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:14:41,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:14:41,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 774 transitions. [2023-08-30 23:14:41,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4645858343337335 [2023-08-30 23:14:41,811 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 774 transitions. [2023-08-30 23:14:41,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 774 transitions. [2023-08-30 23:14:41,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:14:41,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 774 transitions. [2023-08-30 23:14:41,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.57142857142857) internal successors, (774), 7 states have internal predecessors, (774), 0 states have call successors, (0), 0 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:14:41,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 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:14:41,816 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 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:14:41,816 INFO L175 Difference]: Start difference. First operand has 75 places, 56 transitions, 451 flow. Second operand 7 states and 774 transitions. [2023-08-30 23:14:41,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 122 transitions, 1202 flow [2023-08-30 23:14:41,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 122 transitions, 951 flow, removed 52 selfloop flow, removed 14 redundant places. [2023-08-30 23:14:41,828 INFO L231 Difference]: Finished difference. Result has 69 places, 43 transitions, 249 flow [2023-08-30 23:14:41,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=249, PETRI_PLACES=69, PETRI_TRANSITIONS=43} [2023-08-30 23:14:41,828 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places. [2023-08-30 23:14:41,829 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 43 transitions, 249 flow [2023-08-30 23:14:41,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.33333333333333) internal successors, (632), 6 states have internal predecessors, (632), 0 states have call successors, (0), 0 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:14:41,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:41,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:14:41,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 23:14:41,830 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:41,830 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:41,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1541948962, now seen corresponding path program 2 times [2023-08-30 23:14:41,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:41,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044302623] [2023-08-30 23:14:41,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:41,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:14:41,864 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 23:14:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:14:41,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 23:14:41,921 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 23:14:41,921 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-30 23:14:41,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-30 23:14:41,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-30 23:14:41,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-30 23:14:41,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-30 23:14:41,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-30 23:14:41,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-30 23:14:41,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 23:14:41,924 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:14:41,929 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 23:14:41,929 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 23:14:42,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 11:14:42 BasicIcfg [2023-08-30 23:14:42,004 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 23:14:42,004 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 23:14:42,004 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 23:14:42,004 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 23:14:42,005 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:14:16" (3/4) ... [2023-08-30 23:14:42,006 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 23:14:42,071 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 23:14:42,071 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 23:14:42,072 INFO L158 Benchmark]: Toolchain (without parser) took 26825.57ms. Allocated memory was 73.4MB in the beginning and 2.6GB in the end (delta: 2.6GB). Free memory was 48.9MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 935.5MB. Max. memory is 16.1GB. [2023-08-30 23:14:42,072 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 73.4MB. Free memory was 49.8MB in the beginning and 49.7MB in the end (delta: 94.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 23:14:42,072 INFO L158 Benchmark]: CACSL2BoogieTranslator took 599.48ms. Allocated memory was 73.4MB in the beginning and 90.2MB in the end (delta: 16.8MB). Free memory was 48.7MB in the beginning and 60.9MB in the end (delta: -12.1MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2023-08-30 23:14:42,073 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.36ms. Allocated memory is still 90.2MB. Free memory was 60.9MB in the beginning and 58.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 23:14:42,073 INFO L158 Benchmark]: Boogie Preprocessor took 29.01ms. Allocated memory is still 90.2MB. Free memory was 58.1MB in the beginning and 56.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 23:14:42,073 INFO L158 Benchmark]: RCFGBuilder took 755.07ms. Allocated memory is still 90.2MB. Free memory was 56.0MB in the beginning and 47.0MB in the end (delta: 8.9MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2023-08-30 23:14:42,073 INFO L158 Benchmark]: TraceAbstraction took 25322.77ms. Allocated memory was 90.2MB in the beginning and 2.6GB in the end (delta: 2.6GB). Free memory was 46.6MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 900.5MB. Max. memory is 16.1GB. [2023-08-30 23:14:42,074 INFO L158 Benchmark]: Witness Printer took 67.04ms. Allocated memory is still 2.6GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-08-30 23:14:42,075 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 73.4MB. Free memory was 49.8MB in the beginning and 49.7MB in the end (delta: 94.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 599.48ms. Allocated memory was 73.4MB in the beginning and 90.2MB in the end (delta: 16.8MB). Free memory was 48.7MB in the beginning and 60.9MB in the end (delta: -12.1MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.36ms. Allocated memory is still 90.2MB. Free memory was 60.9MB in the beginning and 58.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.01ms. Allocated memory is still 90.2MB. Free memory was 58.1MB in the beginning and 56.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 755.07ms. Allocated memory is still 90.2MB. Free memory was 56.0MB in the beginning and 47.0MB in the end (delta: 8.9MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * TraceAbstraction took 25322.77ms. Allocated memory was 90.2MB in the beginning and 2.6GB in the end (delta: 2.6GB). Free memory was 46.6MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 900.5MB. Max. memory is 16.1GB. * Witness Printer took 67.04ms. Allocated memory is still 2.6GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 137 PlacesBefore, 43 PlacesAfterwards, 126 TransitionsBefore, 31 TransitionsAfterwards, 2936 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 108 TotalNumberOfCompositions, 7888 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3778, independent: 3557, independent conditional: 0, independent unconditional: 3557, dependent: 221, dependent conditional: 0, dependent unconditional: 221, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1560, independent: 1528, independent conditional: 0, independent unconditional: 1528, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3778, independent: 2029, independent conditional: 0, independent unconditional: 2029, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 1560, unknown conditional: 0, unknown unconditional: 1560] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 139, Positive conditional cache size: 0, Positive unconditional cache size: 139, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1165; [L847] FCALL, FORK 0 pthread_create(&t1165, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1165, ((void *)0), P0, ((void *)0))=-3, t1165={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1166; [L849] FCALL, FORK 0 pthread_create(&t1166, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1166, ((void *)0), P1, ((void *)0))=-2, t1165={5:0}, t1166={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1167; [L851] FCALL, FORK 0 pthread_create(&t1167, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1167, ((void *)0), P2, ((void *)0))=-1, t1165={5:0}, t1166={6:0}, t1167={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L852] 0 pthread_t t1168; [L853] FCALL, FORK 0 pthread_create(&t1168, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1168, ((void *)0), P3, ((void *)0))=0, t1165={5:0}, t1166={6:0}, t1167={7:0}, t1168={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L815] 4 a = 1 [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1165={5:0}, t1166={6:0}, t1167={7:0}, t1168={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 847]: 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: 851]: 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: 849]: 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: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 166 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 25.1s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 14.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 871 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 711 mSDsluCounter, 562 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 501 mSDsCounter, 133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2143 IncrementalHoareTripleChecker+Invalid, 2276 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 133 mSolverCounterUnsat, 61 mSDtfsCounter, 2143 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=994occurred in iteration=10, InterpolantAutomatonStates: 79, 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.5s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 272 NumberOfCodeBlocks, 272 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 1611 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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:14:42,098 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