./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix040.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix040.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 9adb0e975425d9a1b173bce1a766592f39d0541cd50cefd6e228e1140c2f9f3e --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 16:50:30,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:50:30,535 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:50:30,560 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:50:30,560 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:50:30,561 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:50:30,562 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:50:30,563 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:50:30,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:50:30,565 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:50:30,565 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:50:30,566 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:50:30,566 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:50:30,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:50:30,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:50:30,568 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:50:30,569 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:50:30,569 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:50:30,570 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:50:30,572 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:50:30,572 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:50:30,573 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:50:30,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:50:30,574 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:50:30,577 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:50:30,577 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:50:30,577 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:50:30,578 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:50:30,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:50:30,578 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:50:30,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:50:30,579 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:50:30,580 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:50:30,580 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:50:30,581 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:50:30,581 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:50:30,582 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:50:30,582 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:50:30,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:50:30,583 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:50:30,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:50:30,584 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 16:50:30,599 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:50:30,599 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:50:30,599 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:50:30,600 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:50:30,600 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:50:30,600 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:50:30,601 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:50:30,601 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:50:30,601 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:50:30,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:50:30,601 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:50:30,601 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:50:30,602 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:50:30,602 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:50:30,602 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:50:30,602 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:50:30,602 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:50:30,602 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:50:30,602 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:50:30,603 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:50:30,603 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:50:30,603 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:50:30,603 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:50:30,603 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:50:30,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:50:30,604 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:50:30,604 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:50:30,604 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:50:30,604 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:50:30,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:50:30,604 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:50:30,604 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:50:30,605 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:50:30,605 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:50:30,605 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:50:30,605 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 -> 9adb0e975425d9a1b173bce1a766592f39d0541cd50cefd6e228e1140c2f9f3e Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 16:50:30,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:50:30,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:50:30,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:50:30,807 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:50:30,808 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:50:30,809 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix040.opt.i [2023-08-30 16:50:31,771 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:50:31,953 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:50:31,962 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040.opt.i [2023-08-30 16:50:31,973 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9dec284b/bd60d5322cac48488c26360e2d8989c7/FLAGb76ec15cc [2023-08-30 16:50:31,983 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9dec284b/bd60d5322cac48488c26360e2d8989c7 [2023-08-30 16:50:31,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:50:31,992 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:50:31,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:50:31,994 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:50:31,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:50:31,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:50:31" (1/1) ... [2023-08-30 16:50:31,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d2b80e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:31, skipping insertion in model container [2023-08-30 16:50:31,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:50:31" (1/1) ... [2023-08-30 16:50:32,003 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:50:32,048 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:50:32,176 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/mix040.opt.i[944,957] [2023-08-30 16:50:32,339 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:50:32,349 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:50:32,357 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/mix040.opt.i[944,957] [2023-08-30 16:50:32,395 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:50:32,423 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:50:32,424 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:50:32,428 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:50:32,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:32 WrapperNode [2023-08-30 16:50:32,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:50:32,429 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:50:32,429 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:50:32,429 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:50:32,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:32" (1/1) ... [2023-08-30 16:50:32,458 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:32" (1/1) ... [2023-08-30 16:50:32,472 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2023-08-30 16:50:32,473 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:50:32,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:50:32,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:50:32,473 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:50:32,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:32" (1/1) ... [2023-08-30 16:50:32,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:32" (1/1) ... [2023-08-30 16:50:32,491 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:32" (1/1) ... [2023-08-30 16:50:32,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:32" (1/1) ... [2023-08-30 16:50:32,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:32" (1/1) ... [2023-08-30 16:50:32,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:32" (1/1) ... [2023-08-30 16:50:32,499 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:32" (1/1) ... [2023-08-30 16:50:32,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:32" (1/1) ... [2023-08-30 16:50:32,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:50:32,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:50:32,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:50:32,503 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:50:32,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:32" (1/1) ... [2023-08-30 16:50:32,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:50:32,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:50:32,539 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 16:50:32,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 16:50:32,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:50:32,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:50:32,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:50:32,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:50:32,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:50:32,568 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:50:32,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:50:32,570 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:50:32,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:50:32,571 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 16:50:32,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 16:50:32,571 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 16:50:32,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 16:50:32,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:50:32,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:50:32,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:50:32,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:50:32,572 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 16:50:32,684 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:50:32,685 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:50:32,918 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:50:33,033 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:50:33,033 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:50:33,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:50:33 BoogieIcfgContainer [2023-08-30 16:50:33,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:50:33,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:50:33,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:50:33,042 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:50:33,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:50:31" (1/3) ... [2023-08-30 16:50:33,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@300d149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:50:33, skipping insertion in model container [2023-08-30 16:50:33,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:32" (2/3) ... [2023-08-30 16:50:33,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@300d149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:50:33, skipping insertion in model container [2023-08-30 16:50:33,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:50:33" (3/3) ... [2023-08-30 16:50:33,044 INFO L112 eAbstractionObserver]: Analyzing ICFG mix040.opt.i [2023-08-30 16:50:33,048 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:50:33,054 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:50:33,055 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:50:33,055 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:50:33,102 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:50:33,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2023-08-30 16:50:33,179 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2023-08-30 16:50:33,179 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:50:33,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-08-30 16:50:33,184 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2023-08-30 16:50:33,189 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2023-08-30 16:50:33,192 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:50:33,198 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2023-08-30 16:50:33,201 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2023-08-30 16:50:33,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2023-08-30 16:50:33,221 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2023-08-30 16:50:33,222 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:50:33,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-08-30 16:50:33,223 INFO L119 LiptonReduction]: Number of co-enabled transitions 2816 [2023-08-30 16:50:36,283 INFO L134 LiptonReduction]: Checked pairs total: 6600 [2023-08-30 16:50:36,283 INFO L136 LiptonReduction]: Total number of compositions: 108 [2023-08-30 16:50:36,298 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:50:36,303 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;@39e4c325, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:50:36,304 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-30 16:50:36,316 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2023-08-30 16:50:36,319 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:50:36,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:36,320 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:36,321 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 16:50:36,324 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:36,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1463241210, now seen corresponding path program 1 times [2023-08-30 16:50:36,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:36,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168973606] [2023-08-30 16:50:36,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:36,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:36,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:36,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:36,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168973606] [2023-08-30 16:50:36,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168973606] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:36,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:36,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:50:36,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816377447] [2023-08-30 16:50:36,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:36,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:50:36,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:36,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:50:36,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:50:36,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 237 [2023-08-30 16:50:36,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 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 16:50:36,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:36,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 237 [2023-08-30 16:50:36,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:37,207 INFO L130 PetriNetUnfolder]: 2891/4508 cut-off events. [2023-08-30 16:50:37,207 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2023-08-30 16:50:37,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8608 conditions, 4508 events. 2891/4508 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 26768 event pairs, 668 based on Foata normal form. 144/4360 useless extension candidates. Maximal degree in co-relation 8596. Up to 2980 conditions per place. [2023-08-30 16:50:37,224 INFO L137 encePairwiseOnDemand]: 233/237 looper letters, 31 selfloop transitions, 2 changer transitions 4/41 dead transitions. [2023-08-30 16:50:37,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 168 flow [2023-08-30 16:50:37,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:50:37,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:50:37,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-08-30 16:50:37,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5457102672292545 [2023-08-30 16:50:37,233 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-08-30 16:50:37,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-08-30 16:50:37,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:37,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-08-30 16:50:37,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:37,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:37,241 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:37,242 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 388 transitions. [2023-08-30 16:50:37,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 168 flow [2023-08-30 16:50:37,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 164 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 16:50:37,246 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 64 flow [2023-08-30 16:50:37,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2023-08-30 16:50:37,249 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-08-30 16:50:37,249 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 64 flow [2023-08-30 16:50:37,249 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 16:50:37,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:37,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:37,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:50:37,250 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 16:50:37,250 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:37,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1798587667, now seen corresponding path program 1 times [2023-08-30 16:50:37,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:37,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126349203] [2023-08-30 16:50:37,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:37,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:37,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:37,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:37,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126349203] [2023-08-30 16:50:37,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126349203] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:37,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:37,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:50:37,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776840314] [2023-08-30 16:50:37,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:37,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:50:37,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:37,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:50:37,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:50:37,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 237 [2023-08-30 16:50:37,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:37,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:37,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 237 [2023-08-30 16:50:37,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:38,598 INFO L130 PetriNetUnfolder]: 10895/15040 cut-off events. [2023-08-30 16:50:38,598 INFO L131 PetriNetUnfolder]: For 554/554 co-relation queries the response was YES. [2023-08-30 16:50:38,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30938 conditions, 15040 events. 10895/15040 cut-off events. For 554/554 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 78549 event pairs, 3371 based on Foata normal form. 652/15692 useless extension candidates. Maximal degree in co-relation 30928. Up to 7839 conditions per place. [2023-08-30 16:50:38,650 INFO L137 encePairwiseOnDemand]: 227/237 looper letters, 39 selfloop transitions, 8 changer transitions 29/76 dead transitions. [2023-08-30 16:50:38,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 76 transitions, 326 flow [2023-08-30 16:50:38,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:50:38,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:50:38,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 603 transitions. [2023-08-30 16:50:38,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5088607594936709 [2023-08-30 16:50:38,652 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 603 transitions. [2023-08-30 16:50:38,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 603 transitions. [2023-08-30 16:50:38,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:38,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 603 transitions. [2023-08-30 16:50:38,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:38,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:38,656 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:38,657 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 64 flow. Second operand 5 states and 603 transitions. [2023-08-30 16:50:38,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 76 transitions, 326 flow [2023-08-30 16:50:38,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 76 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:50:38,665 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 140 flow [2023-08-30 16:50:38,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=140, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-08-30 16:50:38,665 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2023-08-30 16:50:38,665 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 140 flow [2023-08-30 16:50:38,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:38,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:38,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:38,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:50:38,666 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 16:50:38,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:38,667 INFO L85 PathProgramCache]: Analyzing trace with hash -78402104, now seen corresponding path program 1 times [2023-08-30 16:50:38,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:38,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46848791] [2023-08-30 16:50:38,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:38,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:38,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:38,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:38,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46848791] [2023-08-30 16:50:38,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46848791] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:38,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:38,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:50:38,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463599485] [2023-08-30 16:50:38,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:38,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:50:38,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:38,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:50:38,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:50:38,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 237 [2023-08-30 16:50:38,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:38,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:38,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 237 [2023-08-30 16:50:38,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:39,870 INFO L130 PetriNetUnfolder]: 9965/13882 cut-off events. [2023-08-30 16:50:39,870 INFO L131 PetriNetUnfolder]: For 10862/10862 co-relation queries the response was YES. [2023-08-30 16:50:39,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40358 conditions, 13882 events. 9965/13882 cut-off events. For 10862/10862 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 74745 event pairs, 919 based on Foata normal form. 608/14490 useless extension candidates. Maximal degree in co-relation 40344. Up to 6985 conditions per place. [2023-08-30 16:50:39,938 INFO L137 encePairwiseOnDemand]: 227/237 looper letters, 56 selfloop transitions, 12 changer transitions 45/113 dead transitions. [2023-08-30 16:50:39,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 113 transitions, 686 flow [2023-08-30 16:50:39,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:50:39,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:50:39,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 840 transitions. [2023-08-30 16:50:39,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5063291139240507 [2023-08-30 16:50:39,940 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 840 transitions. [2023-08-30 16:50:39,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 840 transitions. [2023-08-30 16:50:39,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:39,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 840 transitions. [2023-08-30 16:50:39,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:39,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:39,945 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:39,946 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 140 flow. Second operand 7 states and 840 transitions. [2023-08-30 16:50:39,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 113 transitions, 686 flow [2023-08-30 16:50:39,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 113 transitions, 632 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:50:39,976 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 240 flow [2023-08-30 16:50:39,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=240, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-08-30 16:50:39,978 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2023-08-30 16:50:39,980 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 240 flow [2023-08-30 16:50:39,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:39,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:39,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:39,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:50:39,981 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 16:50:39,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:39,982 INFO L85 PathProgramCache]: Analyzing trace with hash -78379040, now seen corresponding path program 1 times [2023-08-30 16:50:39,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:39,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682316823] [2023-08-30 16:50:39,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:39,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:40,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:40,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:40,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682316823] [2023-08-30 16:50:40,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682316823] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:40,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:40,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:50:40,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840077014] [2023-08-30 16:50:40,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:40,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:50:40,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:40,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:50:40,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:50:40,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 237 [2023-08-30 16:50:40,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 240 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 16:50:40,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:40,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 237 [2023-08-30 16:50:40,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:40,872 INFO L130 PetriNetUnfolder]: 7567/11014 cut-off events. [2023-08-30 16:50:40,873 INFO L131 PetriNetUnfolder]: For 25514/25768 co-relation queries the response was YES. [2023-08-30 16:50:40,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35172 conditions, 11014 events. 7567/11014 cut-off events. For 25514/25768 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 63963 event pairs, 3019 based on Foata normal form. 610/11315 useless extension candidates. Maximal degree in co-relation 35152. Up to 8454 conditions per place. [2023-08-30 16:50:40,924 INFO L137 encePairwiseOnDemand]: 232/237 looper letters, 46 selfloop transitions, 6 changer transitions 22/84 dead transitions. [2023-08-30 16:50:40,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 84 transitions, 572 flow [2023-08-30 16:50:40,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:50:40,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:50:40,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 626 transitions. [2023-08-30 16:50:40,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5282700421940928 [2023-08-30 16:50:40,926 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 626 transitions. [2023-08-30 16:50:40,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 626 transitions. [2023-08-30 16:50:40,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:40,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 626 transitions. [2023-08-30 16:50:40,928 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 16:50:40,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:40,930 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:40,930 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 240 flow. Second operand 5 states and 626 transitions. [2023-08-30 16:50:40,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 84 transitions, 572 flow [2023-08-30 16:50:40,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 84 transitions, 568 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-30 16:50:40,976 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 310 flow [2023-08-30 16:50:40,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=310, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-08-30 16:50:40,977 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2023-08-30 16:50:40,977 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 310 flow [2023-08-30 16:50:40,977 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 16:50:40,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:40,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:40,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:50:40,978 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 16:50:40,978 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:40,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1864480203, now seen corresponding path program 1 times [2023-08-30 16:50:40,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:40,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303828273] [2023-08-30 16:50:40,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:40,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:41,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:41,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:41,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303828273] [2023-08-30 16:50:41,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303828273] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:41,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:41,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:50:41,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157055585] [2023-08-30 16:50:41,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:41,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:50:41,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:41,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:50:41,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:50:41,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 237 [2023-08-30 16:50:41,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 310 flow. Second operand has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:41,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:41,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 237 [2023-08-30 16:50:41,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:42,047 INFO L130 PetriNetUnfolder]: 8371/11680 cut-off events. [2023-08-30 16:50:42,047 INFO L131 PetriNetUnfolder]: For 31134/31134 co-relation queries the response was YES. [2023-08-30 16:50:42,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40253 conditions, 11680 events. 8371/11680 cut-off events. For 31134/31134 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 58338 event pairs, 1791 based on Foata normal form. 432/12112 useless extension candidates. Maximal degree in co-relation 40228. Up to 4811 conditions per place. [2023-08-30 16:50:42,105 INFO L137 encePairwiseOnDemand]: 227/237 looper letters, 61 selfloop transitions, 17 changer transitions 36/114 dead transitions. [2023-08-30 16:50:42,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 114 transitions, 926 flow [2023-08-30 16:50:42,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:50:42,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:50:42,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 822 transitions. [2023-08-30 16:50:42,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49547920433996384 [2023-08-30 16:50:42,108 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 822 transitions. [2023-08-30 16:50:42,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 822 transitions. [2023-08-30 16:50:42,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:42,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 822 transitions. [2023-08-30 16:50:42,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.42857142857143) internal successors, (822), 7 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:42,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:42,112 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:42,112 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 310 flow. Second operand 7 states and 822 transitions. [2023-08-30 16:50:42,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 114 transitions, 926 flow [2023-08-30 16:50:42,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 114 transitions, 896 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-08-30 16:50:42,171 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 476 flow [2023-08-30 16:50:42,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=476, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2023-08-30 16:50:42,172 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2023-08-30 16:50:42,172 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 476 flow [2023-08-30 16:50:42,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:42,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:42,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:42,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:50:42,173 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 16:50:42,173 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:42,174 INFO L85 PathProgramCache]: Analyzing trace with hash -451298365, now seen corresponding path program 1 times [2023-08-30 16:50:42,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:42,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963087474] [2023-08-30 16:50:42,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:42,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:42,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:42,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:42,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963087474] [2023-08-30 16:50:42,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963087474] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:42,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:42,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:50:42,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759698977] [2023-08-30 16:50:42,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:42,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:50:42,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:42,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:50:42,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:50:42,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 237 [2023-08-30 16:50:42,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 476 flow. Second operand has 5 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:42,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:42,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 237 [2023-08-30 16:50:42,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:43,305 INFO L130 PetriNetUnfolder]: 9913/13958 cut-off events. [2023-08-30 16:50:43,305 INFO L131 PetriNetUnfolder]: For 56972/56972 co-relation queries the response was YES. [2023-08-30 16:50:43,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51773 conditions, 13958 events. 9913/13958 cut-off events. For 56972/56972 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 75076 event pairs, 1755 based on Foata normal form. 336/14294 useless extension candidates. Maximal degree in co-relation 51744. Up to 5508 conditions per place. [2023-08-30 16:50:43,361 INFO L137 encePairwiseOnDemand]: 227/237 looper letters, 60 selfloop transitions, 29 changer transitions 34/123 dead transitions. [2023-08-30 16:50:43,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 123 transitions, 1086 flow [2023-08-30 16:50:43,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:50:43,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:50:43,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 831 transitions. [2023-08-30 16:50:43,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5009041591320073 [2023-08-30 16:50:43,363 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 831 transitions. [2023-08-30 16:50:43,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 831 transitions. [2023-08-30 16:50:43,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:43,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 831 transitions. [2023-08-30 16:50:43,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.71428571428571) internal successors, (831), 7 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:43,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:43,367 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:43,367 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 476 flow. Second operand 7 states and 831 transitions. [2023-08-30 16:50:43,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 123 transitions, 1086 flow [2023-08-30 16:50:43,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 123 transitions, 1056 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-08-30 16:50:43,546 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 639 flow [2023-08-30 16:50:43,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=639, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2023-08-30 16:50:43,548 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 26 predicate places. [2023-08-30 16:50:43,549 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 639 flow [2023-08-30 16:50:43,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:43,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:43,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:43,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:50:43,550 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 16:50:43,550 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:43,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1224494794, now seen corresponding path program 1 times [2023-08-30 16:50:43,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:43,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155457728] [2023-08-30 16:50:43,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:43,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:43,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:43,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:43,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155457728] [2023-08-30 16:50:43,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155457728] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:43,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:43,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:50:43,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478791164] [2023-08-30 16:50:43,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:43,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:50:43,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:43,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:50:43,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:50:43,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 237 [2023-08-30 16:50:43,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 639 flow. Second operand has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:43,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:43,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 237 [2023-08-30 16:50:43,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:44,341 INFO L130 PetriNetUnfolder]: 5953/8863 cut-off events. [2023-08-30 16:50:44,342 INFO L131 PetriNetUnfolder]: For 41871/42939 co-relation queries the response was YES. [2023-08-30 16:50:44,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32683 conditions, 8863 events. 5953/8863 cut-off events. For 41871/42939 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 54223 event pairs, 1313 based on Foata normal form. 888/9283 useless extension candidates. Maximal degree in co-relation 32648. Up to 6041 conditions per place. [2023-08-30 16:50:44,380 INFO L137 encePairwiseOnDemand]: 230/237 looper letters, 92 selfloop transitions, 10 changer transitions 11/136 dead transitions. [2023-08-30 16:50:44,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 136 transitions, 1581 flow [2023-08-30 16:50:44,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:50:44,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:50:44,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 601 transitions. [2023-08-30 16:50:44,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5071729957805907 [2023-08-30 16:50:44,382 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 601 transitions. [2023-08-30 16:50:44,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 601 transitions. [2023-08-30 16:50:44,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:44,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 601 transitions. [2023-08-30 16:50:44,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.2) internal successors, (601), 5 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:44,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:44,385 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:44,385 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 639 flow. Second operand 5 states and 601 transitions. [2023-08-30 16:50:44,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 136 transitions, 1581 flow [2023-08-30 16:50:44,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 136 transitions, 1553 flow, removed 14 selfloop flow, removed 5 redundant places. [2023-08-30 16:50:44,424 INFO L231 Difference]: Finished difference. Result has 67 places, 68 transitions, 698 flow [2023-08-30 16:50:44,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=698, PETRI_PLACES=67, PETRI_TRANSITIONS=68} [2023-08-30 16:50:44,425 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2023-08-30 16:50:44,425 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 698 flow [2023-08-30 16:50:44,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:44,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:44,426 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 16:50:44,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:50:44,426 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 16:50:44,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:44,426 INFO L85 PathProgramCache]: Analyzing trace with hash 76552396, now seen corresponding path program 1 times [2023-08-30 16:50:44,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:44,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950005333] [2023-08-30 16:50:44,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:44,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:44,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:44,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:44,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950005333] [2023-08-30 16:50:44,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950005333] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:44,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:44,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:50:44,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735349704] [2023-08-30 16:50:44,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:44,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:50:44,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:44,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:50:44,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:50:44,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 237 [2023-08-30 16:50:44,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 698 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 16:50:44,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:44,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 237 [2023-08-30 16:50:44,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:45,395 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([376] L830-->L837: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_89 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_22 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_89 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_90 256) 0)))) (.cse0 (and .cse4 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_89) v_~z$w_buff1_used~0_88) (= v_~z~0_52 (ite .cse2 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_46 v_~z~0_53))) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_88 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_22) v_~z$r_buff1_thd4~0_21) (= (ite .cse2 0 v_~z$w_buff0_used~0_90) v_~z$w_buff0_used~0_89) (= v_~z$r_buff0_thd4~0_32 (ite .cse0 0 v_~z$r_buff0_thd4~0_33))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_22, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_89, ~z$w_buff1~0=v_~z$w_buff1~0_46, ~z~0=v_~z~0_53} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_89, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_88, ~z$w_buff1~0=v_~z$w_buff1~0_46, ~z~0=v_~z~0_52} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][80], [Black: 186#(= ~__unbuffered_p3_EAX~0 0), Black: 187#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), P3Thread1of1ForFork2InUse, 102#P0EXITtrue, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 158#true, Black: 208#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 200#true, Black: 203#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 149#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 152#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 150#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 228#(= ~x~0 1), 202#(= ~y~0 1), Black: 221#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 218#(= ~__unbuffered_cnt~0 0), Black: 219#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 132#L837true, 59#P2EXITtrue, Black: 161#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 160#(= ~y~0 0), Black: 179#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 176#(= ~x~0 0), 78#L872true, 31#L771true, 184#true, 216#true]) [2023-08-30 16:50:45,396 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 16:50:45,396 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 16:50:45,396 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 16:50:45,396 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 16:50:45,411 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([376] L830-->L837: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_89 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_22 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_89 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_90 256) 0)))) (.cse0 (and .cse4 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_89) v_~z$w_buff1_used~0_88) (= v_~z~0_52 (ite .cse2 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_46 v_~z~0_53))) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_88 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_22) v_~z$r_buff1_thd4~0_21) (= (ite .cse2 0 v_~z$w_buff0_used~0_90) v_~z$w_buff0_used~0_89) (= v_~z$r_buff0_thd4~0_32 (ite .cse0 0 v_~z$r_buff0_thd4~0_33))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_22, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_89, ~z$w_buff1~0=v_~z$w_buff1~0_46, ~z~0=v_~z~0_53} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_89, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_88, ~z$w_buff1~0=v_~z$w_buff1~0_46, ~z~0=v_~z~0_52} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][80], [Black: 186#(= ~__unbuffered_p3_EAX~0 0), Black: 187#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), P3Thread1of1ForFork2InUse, 102#P0EXITtrue, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 54#L3true, 158#true, Black: 208#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 203#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 202#(= ~y~0 1), Black: 149#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 152#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 150#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 228#(= ~x~0 1), Black: 221#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 218#(= ~__unbuffered_cnt~0 0), 132#L837true, 59#P2EXITtrue, Black: 161#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 108#P1EXITtrue, Black: 160#(= ~y~0 0), 219#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 200#true, Black: 179#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 176#(= ~x~0 0), 184#true]) [2023-08-30 16:50:45,411 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 16:50:45,411 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 16:50:45,411 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 16:50:45,411 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 16:50:45,425 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L771-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork3_#res.offset_7| 0) (= |v_P1Thread1of1ForFork3_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_34 1) v_~__unbuffered_cnt~0_33)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_7|, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0][43], [161#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 186#(= ~__unbuffered_p3_EAX~0 0), Black: 184#true, P3Thread1of1ForFork2InUse, 102#P0EXITtrue, P1Thread1of1ForFork3InUse, 187#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, Black: 208#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 200#true, Black: 203#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 147#true, 48#L830true, Black: 152#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 228#(= ~x~0 1), Black: 150#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 202#(= ~y~0 1), Black: 221#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 218#(= ~__unbuffered_cnt~0 0), Black: 219#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 59#P2EXITtrue, Black: 160#(= ~y~0 0), 108#P1EXITtrue, Black: 158#true, Black: 179#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 78#L872true, Black: 176#(= ~x~0 0), 216#true]) [2023-08-30 16:50:45,425 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 16:50:45,425 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 16:50:45,425 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 16:50:45,426 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 16:50:45,537 INFO L130 PetriNetUnfolder]: 8394/12804 cut-off events. [2023-08-30 16:50:45,537 INFO L131 PetriNetUnfolder]: For 66515/67545 co-relation queries the response was YES. [2023-08-30 16:50:45,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58666 conditions, 12804 events. 8394/12804 cut-off events. For 66515/67545 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 84598 event pairs, 3505 based on Foata normal form. 394/12491 useless extension candidates. Maximal degree in co-relation 58631. Up to 5977 conditions per place. [2023-08-30 16:50:45,586 INFO L137 encePairwiseOnDemand]: 233/237 looper letters, 63 selfloop transitions, 12 changer transitions 28/115 dead transitions. [2023-08-30 16:50:45,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 115 transitions, 1222 flow [2023-08-30 16:50:45,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:50:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:50:45,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 622 transitions. [2023-08-30 16:50:45,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5248945147679325 [2023-08-30 16:50:45,588 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 622 transitions. [2023-08-30 16:50:45,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 622 transitions. [2023-08-30 16:50:45,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:45,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 622 transitions. [2023-08-30 16:50:45,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:45,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:45,591 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:45,591 INFO L175 Difference]: Start difference. First operand has 67 places, 68 transitions, 698 flow. Second operand 5 states and 622 transitions. [2023-08-30 16:50:45,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 115 transitions, 1222 flow [2023-08-30 16:50:45,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 115 transitions, 1209 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-30 16:50:45,670 INFO L231 Difference]: Finished difference. Result has 73 places, 63 transitions, 667 flow [2023-08-30 16:50:45,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=667, PETRI_PLACES=73, PETRI_TRANSITIONS=63} [2023-08-30 16:50:45,671 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places. [2023-08-30 16:50:45,671 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 63 transitions, 667 flow [2023-08-30 16:50:45,671 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 16:50:45,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:45,672 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 16:50:45,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:50:45,672 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 16:50:45,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:45,672 INFO L85 PathProgramCache]: Analyzing trace with hash 662538984, now seen corresponding path program 1 times [2023-08-30 16:50:45,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:45,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061402747] [2023-08-30 16:50:45,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:45,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:45,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:45,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:45,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061402747] [2023-08-30 16:50:45,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061402747] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:45,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:45,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:50:45,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046445682] [2023-08-30 16:50:45,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:45,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:50:45,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:45,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:50:45,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:50:45,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 237 [2023-08-30 16:50:45,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 63 transitions, 667 flow. Second operand has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:45,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:45,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 237 [2023-08-30 16:50:45,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:46,618 INFO L130 PetriNetUnfolder]: 5309/8342 cut-off events. [2023-08-30 16:50:46,618 INFO L131 PetriNetUnfolder]: For 38024/39926 co-relation queries the response was YES. [2023-08-30 16:50:46,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36308 conditions, 8342 events. 5309/8342 cut-off events. For 38024/39926 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 55843 event pairs, 512 based on Foata normal form. 1118/9084 useless extension candidates. Maximal degree in co-relation 36270. Up to 3535 conditions per place. [2023-08-30 16:50:46,652 INFO L137 encePairwiseOnDemand]: 230/237 looper letters, 123 selfloop transitions, 18 changer transitions 16/176 dead transitions. [2023-08-30 16:50:46,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 176 transitions, 2154 flow [2023-08-30 16:50:46,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:50:46,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:50:46,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 841 transitions. [2023-08-30 16:50:46,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069318866787221 [2023-08-30 16:50:46,658 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 841 transitions. [2023-08-30 16:50:46,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 841 transitions. [2023-08-30 16:50:46,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:46,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 841 transitions. [2023-08-30 16:50:46,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.14285714285714) internal successors, (841), 7 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:46,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:46,666 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:46,667 INFO L175 Difference]: Start difference. First operand has 73 places, 63 transitions, 667 flow. Second operand 7 states and 841 transitions. [2023-08-30 16:50:46,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 176 transitions, 2154 flow [2023-08-30 16:50:46,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 176 transitions, 2083 flow, removed 18 selfloop flow, removed 3 redundant places. [2023-08-30 16:50:46,705 INFO L231 Difference]: Finished difference. Result has 77 places, 72 transitions, 776 flow [2023-08-30 16:50:46,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=776, PETRI_PLACES=77, PETRI_TRANSITIONS=72} [2023-08-30 16:50:46,706 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 35 predicate places. [2023-08-30 16:50:46,706 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 72 transitions, 776 flow [2023-08-30 16:50:46,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:46,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:46,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:46,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:50:46,707 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 16:50:46,707 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:46,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1840798192, now seen corresponding path program 1 times [2023-08-30 16:50:46,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:46,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81350226] [2023-08-30 16:50:46,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:46,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:46,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:46,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:46,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:46,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81350226] [2023-08-30 16:50:46,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81350226] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:46,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:46,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:50:46,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521097985] [2023-08-30 16:50:46,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:46,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:50:46,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:46,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:50:46,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:50:46,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 237 [2023-08-30 16:50:46,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 72 transitions, 776 flow. Second operand has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:46,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:46,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 237 [2023-08-30 16:50:46,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:47,662 INFO L130 PetriNetUnfolder]: 4668/7408 cut-off events. [2023-08-30 16:50:47,662 INFO L131 PetriNetUnfolder]: For 39727/43227 co-relation queries the response was YES. [2023-08-30 16:50:47,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37468 conditions, 7408 events. 4668/7408 cut-off events. For 39727/43227 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 50095 event pairs, 243 based on Foata normal form. 1154/8220 useless extension candidates. Maximal degree in co-relation 37428. Up to 3229 conditions per place. [2023-08-30 16:50:47,688 INFO L137 encePairwiseOnDemand]: 230/237 looper letters, 124 selfloop transitions, 26 changer transitions 39/207 dead transitions. [2023-08-30 16:50:47,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 207 transitions, 2524 flow [2023-08-30 16:50:47,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 16:50:47,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 16:50:47,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1080 transitions. [2023-08-30 16:50:47,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5063291139240507 [2023-08-30 16:50:47,691 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1080 transitions. [2023-08-30 16:50:47,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1080 transitions. [2023-08-30 16:50:47,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:47,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1080 transitions. [2023-08-30 16:50:47,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.0) internal successors, (1080), 9 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:47,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 237.0) internal successors, (2370), 10 states have internal predecessors, (2370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:47,696 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 237.0) internal successors, (2370), 10 states have internal predecessors, (2370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:47,696 INFO L175 Difference]: Start difference. First operand has 77 places, 72 transitions, 776 flow. Second operand 9 states and 1080 transitions. [2023-08-30 16:50:47,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 207 transitions, 2524 flow [2023-08-30 16:50:47,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 207 transitions, 2471 flow, removed 19 selfloop flow, removed 3 redundant places. [2023-08-30 16:50:47,987 INFO L231 Difference]: Finished difference. Result has 85 places, 79 transitions, 875 flow [2023-08-30 16:50:47,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=875, PETRI_PLACES=85, PETRI_TRANSITIONS=79} [2023-08-30 16:50:47,988 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 43 predicate places. [2023-08-30 16:50:47,988 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 79 transitions, 875 flow [2023-08-30 16:50:47,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:47,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:47,989 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 16:50:47,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:50:47,989 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 16:50:47,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:47,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1284982509, now seen corresponding path program 1 times [2023-08-30 16:50:47,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:47,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878518050] [2023-08-30 16:50:47,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:47,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:48,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:48,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:48,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878518050] [2023-08-30 16:50:48,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878518050] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:48,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:48,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:50:48,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868391383] [2023-08-30 16:50:48,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:48,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:50:48,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:48,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:50:48,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:50:48,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 237 [2023-08-30 16:50:48,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 79 transitions, 875 flow. Second operand has 7 states, 7 states have (on average 110.85714285714286) internal successors, (776), 7 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:48,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:48,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 237 [2023-08-30 16:50:48,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:48,893 INFO L130 PetriNetUnfolder]: 4392/7047 cut-off events. [2023-08-30 16:50:48,893 INFO L131 PetriNetUnfolder]: For 43038/45327 co-relation queries the response was YES. [2023-08-30 16:50:48,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36128 conditions, 7047 events. 4392/7047 cut-off events. For 43038/45327 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 48316 event pairs, 222 based on Foata normal form. 778/7485 useless extension candidates. Maximal degree in co-relation 36085. Up to 2065 conditions per place. [2023-08-30 16:50:48,917 INFO L137 encePairwiseOnDemand]: 230/237 looper letters, 70 selfloop transitions, 24 changer transitions 102/206 dead transitions. [2023-08-30 16:50:48,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 206 transitions, 2555 flow [2023-08-30 16:50:48,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 16:50:48,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 16:50:48,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1296 transitions. [2023-08-30 16:50:48,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49712313003452246 [2023-08-30 16:50:48,920 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1296 transitions. [2023-08-30 16:50:48,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1296 transitions. [2023-08-30 16:50:48,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:48,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1296 transitions. [2023-08-30 16:50:48,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 117.81818181818181) internal successors, (1296), 11 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:48,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 237.0) internal successors, (2844), 12 states have internal predecessors, (2844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:48,925 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 237.0) internal successors, (2844), 12 states have internal predecessors, (2844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:48,925 INFO L175 Difference]: Start difference. First operand has 85 places, 79 transitions, 875 flow. Second operand 11 states and 1296 transitions. [2023-08-30 16:50:48,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 206 transitions, 2555 flow [2023-08-30 16:50:49,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 206 transitions, 2410 flow, removed 47 selfloop flow, removed 9 redundant places. [2023-08-30 16:50:49,451 INFO L231 Difference]: Finished difference. Result has 89 places, 55 transitions, 512 flow [2023-08-30 16:50:49,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=512, PETRI_PLACES=89, PETRI_TRANSITIONS=55} [2023-08-30 16:50:49,452 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 47 predicate places. [2023-08-30 16:50:49,452 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 55 transitions, 512 flow [2023-08-30 16:50:49,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.85714285714286) internal successors, (776), 7 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:49,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:49,452 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] [2023-08-30 16:50:49,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 16:50:49,452 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 16:50:49,453 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:49,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1835478294, now seen corresponding path program 1 times [2023-08-30 16:50:49,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:49,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807517926] [2023-08-30 16:50:49,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:49,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:49,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:49,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:49,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807517926] [2023-08-30 16:50:49,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807517926] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:49,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:49,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:50:49,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276046024] [2023-08-30 16:50:49,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:49,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:50:49,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:49,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:50:49,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:50:49,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 237 [2023-08-30 16:50:49,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 55 transitions, 512 flow. Second operand has 5 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:49,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:49,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 237 [2023-08-30 16:50:49,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:49,853 INFO L130 PetriNetUnfolder]: 843/1439 cut-off events. [2023-08-30 16:50:49,853 INFO L131 PetriNetUnfolder]: For 7949/7949 co-relation queries the response was YES. [2023-08-30 16:50:49,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7314 conditions, 1439 events. 843/1439 cut-off events. For 7949/7949 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7015 event pairs, 142 based on Foata normal form. 1/1440 useless extension candidates. Maximal degree in co-relation 7272. Up to 798 conditions per place. [2023-08-30 16:50:49,858 INFO L137 encePairwiseOnDemand]: 226/237 looper letters, 63 selfloop transitions, 17 changer transitions 27/107 dead transitions. [2023-08-30 16:50:49,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 107 transitions, 1131 flow [2023-08-30 16:50:49,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:50:49,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:50:49,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 679 transitions. [2023-08-30 16:50:49,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47749648382559773 [2023-08-30 16:50:49,860 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 679 transitions. [2023-08-30 16:50:49,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 679 transitions. [2023-08-30 16:50:49,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:49,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 679 transitions. [2023-08-30 16:50:49,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:49,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 237.0) internal successors, (1659), 7 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:49,864 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 237.0) internal successors, (1659), 7 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:49,864 INFO L175 Difference]: Start difference. First operand has 89 places, 55 transitions, 512 flow. Second operand 6 states and 679 transitions. [2023-08-30 16:50:49,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 107 transitions, 1131 flow [2023-08-30 16:50:49,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 107 transitions, 824 flow, removed 74 selfloop flow, removed 22 redundant places. [2023-08-30 16:50:49,880 INFO L231 Difference]: Finished difference. Result has 72 places, 56 transitions, 414 flow [2023-08-30 16:50:49,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=414, PETRI_PLACES=72, PETRI_TRANSITIONS=56} [2023-08-30 16:50:49,880 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places. [2023-08-30 16:50:49,880 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 414 flow [2023-08-30 16:50:49,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:49,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:49,881 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] [2023-08-30 16:50:49,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 16:50:49,881 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 16:50:49,881 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:49,882 INFO L85 PathProgramCache]: Analyzing trace with hash -497408542, now seen corresponding path program 2 times [2023-08-30 16:50:49,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:49,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992110135] [2023-08-30 16:50:49,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:49,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:50,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:50,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:50,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992110135] [2023-08-30 16:50:50,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992110135] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:50,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:50,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:50:50,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952409434] [2023-08-30 16:50:50,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:50,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:50:50,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:50,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:50:50,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:50:50,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 237 [2023-08-30 16:50:50,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 56 transitions, 414 flow. Second operand has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:50,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:50,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 237 [2023-08-30 16:50:50,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:50,136 INFO L130 PetriNetUnfolder]: 414/745 cut-off events. [2023-08-30 16:50:50,136 INFO L131 PetriNetUnfolder]: For 2526/2555 co-relation queries the response was YES. [2023-08-30 16:50:50,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3213 conditions, 745 events. 414/745 cut-off events. For 2526/2555 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3114 event pairs, 82 based on Foata normal form. 18/753 useless extension candidates. Maximal degree in co-relation 3192. Up to 375 conditions per place. [2023-08-30 16:50:50,138 INFO L137 encePairwiseOnDemand]: 233/237 looper letters, 36 selfloop transitions, 1 changer transitions 48/88 dead transitions. [2023-08-30 16:50:50,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 88 transitions, 748 flow [2023-08-30 16:50:50,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:50:50,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:50:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 605 transitions. [2023-08-30 16:50:50,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.510548523206751 [2023-08-30 16:50:50,140 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 605 transitions. [2023-08-30 16:50:50,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 605 transitions. [2023-08-30 16:50:50,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:50,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 605 transitions. [2023-08-30 16:50:50,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:50,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:50,143 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:50,143 INFO L175 Difference]: Start difference. First operand has 72 places, 56 transitions, 414 flow. Second operand 5 states and 605 transitions. [2023-08-30 16:50:50,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 88 transitions, 748 flow [2023-08-30 16:50:50,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 88 transitions, 730 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-08-30 16:50:50,148 INFO L231 Difference]: Finished difference. Result has 66 places, 38 transitions, 237 flow [2023-08-30 16:50:50,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=66, PETRI_TRANSITIONS=38} [2023-08-30 16:50:50,149 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2023-08-30 16:50:50,149 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 38 transitions, 237 flow [2023-08-30 16:50:50,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:50,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:50,149 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] [2023-08-30 16:50:50,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 16:50:50,150 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 16:50:50,150 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:50,150 INFO L85 PathProgramCache]: Analyzing trace with hash 421074394, now seen corresponding path program 3 times [2023-08-30 16:50:50,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:50,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464624818] [2023-08-30 16:50:50,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:50,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:50,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:50,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:50,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464624818] [2023-08-30 16:50:50,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464624818] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:50,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:50,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:50:50,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302696777] [2023-08-30 16:50:50,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:50,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:50:50,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:50,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:50:50,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:50:50,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 237 [2023-08-30 16:50:50,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 38 transitions, 237 flow. Second operand has 7 states, 7 states have (on average 103.71428571428571) internal successors, (726), 7 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:50,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:50,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 237 [2023-08-30 16:50:50,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:50,675 INFO L130 PetriNetUnfolder]: 118/238 cut-off events. [2023-08-30 16:50:50,675 INFO L131 PetriNetUnfolder]: For 866/866 co-relation queries the response was YES. [2023-08-30 16:50:50,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 238 events. 118/238 cut-off events. For 866/866 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 783 event pairs, 2 based on Foata normal form. 1/239 useless extension candidates. Maximal degree in co-relation 1049. Up to 81 conditions per place. [2023-08-30 16:50:50,676 INFO L137 encePairwiseOnDemand]: 225/237 looper letters, 42 selfloop transitions, 9 changer transitions 26/77 dead transitions. [2023-08-30 16:50:50,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 77 transitions, 650 flow [2023-08-30 16:50:50,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 16:50:50,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 16:50:50,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 946 transitions. [2023-08-30 16:50:50,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4435067979371777 [2023-08-30 16:50:50,678 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 946 transitions. [2023-08-30 16:50:50,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 946 transitions. [2023-08-30 16:50:50,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:50,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 946 transitions. [2023-08-30 16:50:50,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 105.11111111111111) internal successors, (946), 9 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:50,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 237.0) internal successors, (2370), 10 states have internal predecessors, (2370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:50,683 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 237.0) internal successors, (2370), 10 states have internal predecessors, (2370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:50,683 INFO L175 Difference]: Start difference. First operand has 66 places, 38 transitions, 237 flow. Second operand 9 states and 946 transitions. [2023-08-30 16:50:50,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 77 transitions, 650 flow [2023-08-30 16:50:50,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 77 transitions, 530 flow, removed 9 selfloop flow, removed 17 redundant places. [2023-08-30 16:50:50,685 INFO L231 Difference]: Finished difference. Result has 58 places, 38 transitions, 197 flow [2023-08-30 16:50:50,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=197, PETRI_PLACES=58, PETRI_TRANSITIONS=38} [2023-08-30 16:50:50,686 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2023-08-30 16:50:50,686 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 38 transitions, 197 flow [2023-08-30 16:50:50,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 103.71428571428571) internal successors, (726), 7 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:50,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:50,687 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] [2023-08-30 16:50:50,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 16:50:50,687 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 16:50:50,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:50,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1354382608, now seen corresponding path program 4 times [2023-08-30 16:50:50,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:50,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552382933] [2023-08-30 16:50:50,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:50,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:50:50,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:50:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:50:50,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:50:50,757 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:50:50,757 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-30 16:50:50,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-30 16:50:50,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-30 16:50:50,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-30 16:50:50,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-30 16:50:50,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-30 16:50:50,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-30 16:50:50,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 16:50:50,761 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:50,765 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:50:50,765 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:50:50,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:50:50 BasicIcfg [2023-08-30 16:50:50,833 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:50:50,833 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:50:50,834 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:50:50,834 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:50:50,834 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:50:33" (3/4) ... [2023-08-30 16:50:50,835 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:50:50,900 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:50:50,900 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:50:50,901 INFO L158 Benchmark]: Toolchain (without parser) took 18908.78ms. Allocated memory was 83.9MB in the beginning and 2.1GB in the end (delta: 2.1GB). Free memory was 58.9MB in the beginning and 810.8MB in the end (delta: -751.9MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2023-08-30 16:50:50,901 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 58.7MB. Free memory was 36.1MB in the beginning and 36.0MB in the end (delta: 40.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:50:50,901 INFO L158 Benchmark]: CACSL2BoogieTranslator took 435.57ms. Allocated memory is still 83.9MB. Free memory was 58.7MB in the beginning and 55.6MB in the end (delta: 3.1MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2023-08-30 16:50:50,901 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.72ms. Allocated memory is still 83.9MB. Free memory was 55.6MB in the beginning and 53.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:50:50,901 INFO L158 Benchmark]: Boogie Preprocessor took 29.32ms. Allocated memory is still 83.9MB. Free memory was 53.1MB in the beginning and 51.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:50:50,902 INFO L158 Benchmark]: RCFGBuilder took 532.04ms. Allocated memory is still 83.9MB. Free memory was 51.0MB in the beginning and 48.4MB in the end (delta: 2.7MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2023-08-30 16:50:50,902 INFO L158 Benchmark]: TraceAbstraction took 17797.02ms. Allocated memory was 83.9MB in the beginning and 2.1GB in the end (delta: 2.1GB). Free memory was 47.9MB in the beginning and 826.6MB in the end (delta: -778.7MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2023-08-30 16:50:50,902 INFO L158 Benchmark]: Witness Printer took 66.81ms. Allocated memory is still 2.1GB. Free memory was 826.6MB in the beginning and 810.8MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-30 16:50:50,905 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.14ms. Allocated memory is still 58.7MB. Free memory was 36.1MB in the beginning and 36.0MB in the end (delta: 40.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 435.57ms. Allocated memory is still 83.9MB. Free memory was 58.7MB in the beginning and 55.6MB in the end (delta: 3.1MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.72ms. Allocated memory is still 83.9MB. Free memory was 55.6MB in the beginning and 53.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.32ms. Allocated memory is still 83.9MB. Free memory was 53.1MB in the beginning and 51.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 532.04ms. Allocated memory is still 83.9MB. Free memory was 51.0MB in the beginning and 48.4MB in the end (delta: 2.7MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17797.02ms. Allocated memory was 83.9MB in the beginning and 2.1GB in the end (delta: 2.1GB). Free memory was 47.9MB in the beginning and 826.6MB in the end (delta: -778.7MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 66.81ms. Allocated memory is still 2.1GB. Free memory was 826.6MB in the beginning and 810.8MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 136 PlacesBefore, 42 PlacesAfterwards, 125 TransitionsBefore, 30 TransitionsAfterwards, 2816 CoEnabledTransitionPairs, 6 FixpointIterations, 43 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 108 TotalNumberOfCompositions, 6600 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3336, independent: 3158, independent conditional: 0, independent unconditional: 3158, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1543, independent: 1506, independent conditional: 0, independent unconditional: 1506, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3336, independent: 1652, independent conditional: 0, independent unconditional: 1652, dependent: 141, dependent conditional: 0, dependent unconditional: 141, unknown: 1543, unknown conditional: 0, unknown unconditional: 1543] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 127, Positive conditional cache size: 0, Positive unconditional cache size: 127, 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_p2_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; [L854] 0 pthread_t t1061; [L855] FCALL, FORK 0 pthread_create(&t1061, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_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(&t1061, ((void *)0), P0, ((void *)0))=-3, t1061={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] [L856] 0 pthread_t t1062; [L857] FCALL, FORK 0 pthread_create(&t1062, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_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(&t1062, ((void *)0), P1, ((void *)0))=-2, t1061={5:0}, t1062={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] [L858] 0 pthread_t t1063; [L859] FCALL, FORK 0 pthread_create(&t1063, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_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(&t1063, ((void *)0), P2, ((void *)0))=-1, t1061={5:0}, t1062={6:0}, t1063={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] [L860] 0 pthread_t t1064; [L861] FCALL, FORK 0 pthread_create(&t1064, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_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(&t1064, ((void *)0), P3, ((void *)0))=0, t1061={5:0}, t1062={6:0}, t1063={7:0}, t1064={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] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L814] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L814] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 [L823] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L826] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L829] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p2_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=1, 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_p2_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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L767] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_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=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L782] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_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=2, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L790] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L791] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L792] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 __unbuffered_p2_EAX = z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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$$choice2=1, x=2, y=2, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L832] 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) [L833] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L834] 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 [L835] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L836] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_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$$choice2=1, x=2, y=2, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 4 return 0; [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L865] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L865] RET 0 assume_abort_if_not(main$tmp_guard0) [L867] 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) [L868] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L869] 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 [L870] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L871] 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_p2_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, t1061={5:0}, t1062={6:0}, t1063={7:0}, t1064={3:0}, weak$$choice2=1, x=2, y=2, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L874] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=1, x=2, y=2, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 861]: 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: 857]: 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: 855]: 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: 859]: 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, 164 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: 17.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 898 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 724 mSDsluCounter, 423 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 307 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1888 IncrementalHoareTripleChecker+Invalid, 1982 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 116 mSDtfsCounter, 1888 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=875occurred in iteration=10, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 236 ConstructedInterpolants, 0 QuantifiedInterpolants, 1253 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 16:50:50,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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