./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix037.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/mix037.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 be02b321ccd6bac38d207cd4c595c173c1a2ce3b705272ff0087ad749834a1ef --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:12,100 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:50:12,101 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:50:12,133 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:50:12,137 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:50:12,140 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:50:12,141 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:50:12,143 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:50:12,145 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:50:12,149 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:50:12,150 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:50:12,152 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:50:12,152 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:50:12,154 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:50:12,155 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:50:12,159 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:50:12,160 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:50:12,161 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:50:12,164 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:50:12,166 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:50:12,168 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:50:12,178 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:50:12,179 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:50:12,179 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:50:12,183 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:50:12,187 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:50:12,187 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:50:12,188 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:50:12,188 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:50:12,190 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:50:12,190 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:50:12,191 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:50:12,192 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:50:12,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:50:12,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:50:12,194 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:50:12,195 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:50:12,195 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:50:12,195 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:50:12,196 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:50:12,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:50:12,198 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:12,222 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:50:12,223 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:50:12,224 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:50:12,224 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:50:12,225 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:50:12,225 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:50:12,225 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:50:12,225 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:50:12,225 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:50:12,226 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:50:12,226 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:50:12,227 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:50:12,227 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:50:12,227 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:50:12,227 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:50:12,227 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:50:12,227 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:50:12,227 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:50:12,228 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:50:12,228 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:50:12,228 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:50:12,228 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:50:12,228 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:50:12,228 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:50:12,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:50:12,229 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:50:12,229 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:50:12,229 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:50:12,229 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:50:12,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:50:12,229 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:50:12,230 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:50:12,230 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:50:12,230 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:50:12,230 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:50:12,230 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 -> be02b321ccd6bac38d207cd4c595c173c1a2ce3b705272ff0087ad749834a1ef 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:12,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:50:12,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:50:12,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:50:12,500 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:50:12,501 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:50:12,502 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037.opt.i [2023-08-30 16:50:13,489 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:50:13,747 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:50:13,748 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037.opt.i [2023-08-30 16:50:13,774 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c2fa3877/46d02c4fc0fa4fd7a9f9608eba899d15/FLAG86a5860c1 [2023-08-30 16:50:13,800 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c2fa3877/46d02c4fc0fa4fd7a9f9608eba899d15 [2023-08-30 16:50:13,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:50:13,803 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:50:13,804 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:50:13,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:50:13,806 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:50:13,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:50:13" (1/1) ... [2023-08-30 16:50:13,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@604d1ce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:13, skipping insertion in model container [2023-08-30 16:50:13,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:50:13" (1/1) ... [2023-08-30 16:50:13,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:50:13,867 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:50:14,016 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/mix037.opt.i[944,957] [2023-08-30 16:50:14,189 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:50:14,199 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:50:14,208 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/mix037.opt.i[944,957] [2023-08-30 16:50:14,237 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:50:14,274 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:50:14,275 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:50:14,279 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:50:14,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:14 WrapperNode [2023-08-30 16:50:14,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:50:14,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:50:14,281 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:50:14,281 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:50:14,285 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:14" (1/1) ... [2023-08-30 16:50:14,295 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:14" (1/1) ... [2023-08-30 16:50:14,317 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2023-08-30 16:50:14,317 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:50:14,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:50:14,318 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:50:14,318 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:50:14,323 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:14" (1/1) ... [2023-08-30 16:50:14,323 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:14" (1/1) ... [2023-08-30 16:50:14,325 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:14" (1/1) ... [2023-08-30 16:50:14,326 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:14" (1/1) ... [2023-08-30 16:50:14,336 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:14" (1/1) ... [2023-08-30 16:50:14,337 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:14" (1/1) ... [2023-08-30 16:50:14,339 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:14" (1/1) ... [2023-08-30 16:50:14,342 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:14" (1/1) ... [2023-08-30 16:50:14,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:50:14,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:50:14,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:50:14,355 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:50:14,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:14" (1/1) ... [2023-08-30 16:50:14,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:50:14,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:50:14,402 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:14,412 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:14,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:50:14,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:50:14,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:50:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:50:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:50:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:50:14,436 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:50:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:50:14,436 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:50:14,437 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 16:50:14,437 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 16:50:14,437 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 16:50:14,437 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 16:50:14,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:50:14,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:50:14,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:50:14,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:50:14,438 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:14,543 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:50:14,544 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:50:14,861 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:50:14,962 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:50:14,963 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:50:14,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:50:14 BoogieIcfgContainer [2023-08-30 16:50:14,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:50:14,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:50:14,967 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:50:14,969 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:50:14,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:50:13" (1/3) ... [2023-08-30 16:50:14,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1360e3e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:50:14, skipping insertion in model container [2023-08-30 16:50:14,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:14" (2/3) ... [2023-08-30 16:50:14,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1360e3e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:50:14, skipping insertion in model container [2023-08-30 16:50:14,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:50:14" (3/3) ... [2023-08-30 16:50:14,972 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037.opt.i [2023-08-30 16:50:14,978 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:50:14,985 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:50:14,986 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:50:14,986 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:50:15,039 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:50:15,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2023-08-30 16:50:15,130 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2023-08-30 16:50:15,130 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:50:15,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-08-30 16:50:15,135 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2023-08-30 16:50:15,139 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2023-08-30 16:50:15,141 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:50:15,148 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2023-08-30 16:50:15,150 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2023-08-30 16:50:15,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2023-08-30 16:50:15,168 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2023-08-30 16:50:15,168 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:50:15,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-08-30 16:50:15,171 INFO L119 LiptonReduction]: Number of co-enabled transitions 2816 [2023-08-30 16:50:18,563 INFO L134 LiptonReduction]: Checked pairs total: 6492 [2023-08-30 16:50:18,563 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-08-30 16:50:18,572 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:50:18,576 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;@681e7953, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:50:18,576 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-30 16:50:18,582 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2023-08-30 16:50:18,582 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:50:18,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:18,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:18,592 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:18,595 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:18,596 INFO L85 PathProgramCache]: Analyzing trace with hash -656996611, now seen corresponding path program 1 times [2023-08-30 16:50:18,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:18,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109505059] [2023-08-30 16:50:18,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:18,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:18,995 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:18,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:18,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109505059] [2023-08-30 16:50:18,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109505059] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:18,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:18,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:50:18,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765834512] [2023-08-30 16:50:18,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:19,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:50:19,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:19,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:50:19,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:50:19,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 242 [2023-08-30 16:50:19,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 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:19,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:19,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 242 [2023-08-30 16:50:19,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:19,373 INFO L130 PetriNetUnfolder]: 2594/3779 cut-off events. [2023-08-30 16:50:19,373 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2023-08-30 16:50:19,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7474 conditions, 3779 events. 2594/3779 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 19592 event pairs, 518 based on Foata normal form. 0/3595 useless extension candidates. Maximal degree in co-relation 7462. Up to 2797 conditions per place. [2023-08-30 16:50:19,389 INFO L137 encePairwiseOnDemand]: 238/242 looper letters, 30 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-08-30 16:50:19,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 154 flow [2023-08-30 16:50:19,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:50:19,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:50:19,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-08-30 16:50:19,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5344352617079889 [2023-08-30 16:50:19,399 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-08-30 16:50:19,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-08-30 16:50:19,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:19,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-08-30 16:50:19,405 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:19,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 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:19,408 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 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:19,409 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 388 transitions. [2023-08-30 16:50:19,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 154 flow [2023-08-30 16:50:19,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 150 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 16:50:19,413 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 62 flow [2023-08-30 16:50:19,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-08-30 16:50:19,417 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-08-30 16:50:19,417 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 62 flow [2023-08-30 16:50:19,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 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:19,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:19,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:19,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:50:19,418 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:19,418 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:19,418 INFO L85 PathProgramCache]: Analyzing trace with hash -13465944, now seen corresponding path program 1 times [2023-08-30 16:50:19,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:19,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690126021] [2023-08-30 16:50:19,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:19,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:19,711 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:19,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:19,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690126021] [2023-08-30 16:50:19,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690126021] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:19,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:19,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:50:19,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890540927] [2023-08-30 16:50:19,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:19,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:50:19,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:19,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:50:19,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:50:19,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-08-30 16:50:19,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 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:19,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:19,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-08-30 16:50:19,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:20,355 INFO L130 PetriNetUnfolder]: 6453/8946 cut-off events. [2023-08-30 16:50:20,356 INFO L131 PetriNetUnfolder]: For 324/324 co-relation queries the response was YES. [2023-08-30 16:50:20,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18494 conditions, 8946 events. 6453/8946 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 43452 event pairs, 2293 based on Foata normal form. 200/9146 useless extension candidates. Maximal degree in co-relation 18484. Up to 6549 conditions per place. [2023-08-30 16:50:20,383 INFO L137 encePairwiseOnDemand]: 234/242 looper letters, 38 selfloop transitions, 7 changer transitions 0/45 dead transitions. [2023-08-30 16:50:20,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 198 flow [2023-08-30 16:50:20,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:50:20,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:50:20,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-08-30 16:50:20,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509641873278237 [2023-08-30 16:50:20,386 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-08-30 16:50:20,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-08-30 16:50:20,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:20,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-08-30 16:50:20,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 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:20,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 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:20,389 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 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:20,389 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 62 flow. Second operand 3 states and 370 transitions. [2023-08-30 16:50:20,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 198 flow [2023-08-30 16:50:20,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 45 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:50:20,406 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 112 flow [2023-08-30 16:50:20,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2023-08-30 16:50:20,407 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-08-30 16:50:20,407 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 112 flow [2023-08-30 16:50:20,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 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:20,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:20,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:20,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:50:20,408 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:20,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:20,408 INFO L85 PathProgramCache]: Analyzing trace with hash -417446566, now seen corresponding path program 1 times [2023-08-30 16:50:20,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:20,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430658881] [2023-08-30 16:50:20,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:20,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:20,643 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:20,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:20,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430658881] [2023-08-30 16:50:20,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430658881] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:20,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:20,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:50:20,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574222072] [2023-08-30 16:50:20,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:20,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:50:20,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:20,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:50:20,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:50:20,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-08-30 16:50:20,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 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:20,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:20,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-08-30 16:50:20,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:21,318 INFO L130 PetriNetUnfolder]: 5989/8314 cut-off events. [2023-08-30 16:50:21,318 INFO L131 PetriNetUnfolder]: For 3378/3378 co-relation queries the response was YES. [2023-08-30 16:50:21,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21128 conditions, 8314 events. 5989/8314 cut-off events. For 3378/3378 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 38643 event pairs, 1725 based on Foata normal form. 112/8426 useless extension candidates. Maximal degree in co-relation 21116. Up to 4373 conditions per place. [2023-08-30 16:50:21,353 INFO L137 encePairwiseOnDemand]: 234/242 looper letters, 45 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2023-08-30 16:50:21,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 284 flow [2023-08-30 16:50:21,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:50:21,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:50:21,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2023-08-30 16:50:21,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.496900826446281 [2023-08-30 16:50:21,355 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 481 transitions. [2023-08-30 16:50:21,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 481 transitions. [2023-08-30 16:50:21,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:21,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 481 transitions. [2023-08-30 16:50:21,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 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:21,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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:21,358 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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:21,358 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 112 flow. Second operand 4 states and 481 transitions. [2023-08-30 16:50:21,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 284 flow [2023-08-30 16:50:21,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 53 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:50:21,375 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 156 flow [2023-08-30 16:50:21,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-08-30 16:50:21,376 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2023-08-30 16:50:21,376 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 156 flow [2023-08-30 16:50:21,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 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:21,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:21,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:21,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:50:21,377 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:21,377 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:21,377 INFO L85 PathProgramCache]: Analyzing trace with hash -121816418, now seen corresponding path program 1 times [2023-08-30 16:50:21,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:21,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098980203] [2023-08-30 16:50:21,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:21,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:21,503 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:21,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:21,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098980203] [2023-08-30 16:50:21,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098980203] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:21,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:21,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:50:21,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079444594] [2023-08-30 16:50:21,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:21,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:50:21,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:21,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:50:21,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:50:21,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 242 [2023-08-30 16:50:21,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 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:21,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:21,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 242 [2023-08-30 16:50:21,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:21,957 INFO L130 PetriNetUnfolder]: 4969/7223 cut-off events. [2023-08-30 16:50:21,957 INFO L131 PetriNetUnfolder]: For 4921/4925 co-relation queries the response was YES. [2023-08-30 16:50:21,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18797 conditions, 7223 events. 4969/7223 cut-off events. For 4921/4925 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 37393 event pairs, 2062 based on Foata normal form. 32/7222 useless extension candidates. Maximal degree in co-relation 18782. Up to 6234 conditions per place. [2023-08-30 16:50:21,983 INFO L137 encePairwiseOnDemand]: 238/242 looper letters, 46 selfloop transitions, 6 changer transitions 0/57 dead transitions. [2023-08-30 16:50:21,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 57 transitions, 344 flow [2023-08-30 16:50:21,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:50:21,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:50:21,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2023-08-30 16:50:21,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5330578512396694 [2023-08-30 16:50:21,985 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2023-08-30 16:50:21,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2023-08-30 16:50:21,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:21,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2023-08-30 16:50:21,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 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:21,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 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:21,988 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 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:21,988 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 156 flow. Second operand 3 states and 387 transitions. [2023-08-30 16:50:21,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 57 transitions, 344 flow [2023-08-30 16:50:21,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 57 transitions, 339 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:50:21,994 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 205 flow [2023-08-30 16:50:21,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=205, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2023-08-30 16:50:21,994 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2023-08-30 16:50:21,994 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 205 flow [2023-08-30 16:50:21,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 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:21,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:21,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:21,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:50:21,995 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:21,996 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:21,996 INFO L85 PathProgramCache]: Analyzing trace with hash 518619766, now seen corresponding path program 1 times [2023-08-30 16:50:21,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:21,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243290927] [2023-08-30 16:50:21,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:21,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:22,177 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:22,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:22,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243290927] [2023-08-30 16:50:22,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243290927] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:22,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:22,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:50:22,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083492946] [2023-08-30 16:50:22,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:22,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:50:22,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:22,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:50:22,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:50:22,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 242 [2023-08-30 16:50:22,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 205 flow. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 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:22,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:22,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 242 [2023-08-30 16:50:22,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:22,719 INFO L130 PetriNetUnfolder]: 4104/6066 cut-off events. [2023-08-30 16:50:22,720 INFO L131 PetriNetUnfolder]: For 5501/5882 co-relation queries the response was YES. [2023-08-30 16:50:22,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16494 conditions, 6066 events. 4104/6066 cut-off events. For 5501/5882 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 34392 event pairs, 778 based on Foata normal form. 573/6347 useless extension candidates. Maximal degree in co-relation 16477. Up to 4004 conditions per place. [2023-08-30 16:50:22,747 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 78 selfloop transitions, 10 changer transitions 0/98 dead transitions. [2023-08-30 16:50:22,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 98 transitions, 641 flow [2023-08-30 16:50:22,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:50:22,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:50:22,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 624 transitions. [2023-08-30 16:50:22,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515702479338843 [2023-08-30 16:50:22,749 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 624 transitions. [2023-08-30 16:50:22,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 624 transitions. [2023-08-30 16:50:22,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:22,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 624 transitions. [2023-08-30 16:50:22,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 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:22,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 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:22,753 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 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:22,753 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 205 flow. Second operand 5 states and 624 transitions. [2023-08-30 16:50:22,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 98 transitions, 641 flow [2023-08-30 16:50:22,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 98 transitions, 631 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:50:22,759 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 274 flow [2023-08-30 16:50:22,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=274, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2023-08-30 16:50:22,761 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2023-08-30 16:50:22,762 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 274 flow [2023-08-30 16:50:22,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 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:22,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:22,762 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:22,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:50:22,762 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:22,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:22,763 INFO L85 PathProgramCache]: Analyzing trace with hash 2074757085, now seen corresponding path program 1 times [2023-08-30 16:50:22,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:22,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524668366] [2023-08-30 16:50:22,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:22,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:22,941 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:22,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:22,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524668366] [2023-08-30 16:50:22,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524668366] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:22,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:22,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:50:22,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451264640] [2023-08-30 16:50:22,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:22,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:50:22,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:22,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:50:22,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:50:22,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-08-30 16:50:22,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 274 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:22,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:22,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-08-30 16:50:22,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:23,577 INFO L130 PetriNetUnfolder]: 6464/9409 cut-off events. [2023-08-30 16:50:23,577 INFO L131 PetriNetUnfolder]: For 13778/13778 co-relation queries the response was YES. [2023-08-30 16:50:23,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33538 conditions, 9409 events. 6464/9409 cut-off events. For 13778/13778 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 50788 event pairs, 1840 based on Foata normal form. 101/9510 useless extension candidates. Maximal degree in co-relation 33517. Up to 4785 conditions per place. [2023-08-30 16:50:23,609 INFO L137 encePairwiseOnDemand]: 236/242 looper letters, 61 selfloop transitions, 11 changer transitions 14/86 dead transitions. [2023-08-30 16:50:23,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 86 transitions, 610 flow [2023-08-30 16:50:23,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:50:23,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:50:23,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 490 transitions. [2023-08-30 16:50:23,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.506198347107438 [2023-08-30 16:50:23,611 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 490 transitions. [2023-08-30 16:50:23,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 490 transitions. [2023-08-30 16:50:23,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:23,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 490 transitions. [2023-08-30 16:50:23,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 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:23,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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:23,615 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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:23,615 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 274 flow. Second operand 4 states and 490 transitions. [2023-08-30 16:50:23,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 86 transitions, 610 flow [2023-08-30 16:50:23,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 86 transitions, 601 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:50:23,629 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 278 flow [2023-08-30 16:50:23,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=278, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2023-08-30 16:50:23,632 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places. [2023-08-30 16:50:23,632 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 278 flow [2023-08-30 16:50:23,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:23,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:23,634 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:23,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:50:23,634 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:23,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:23,635 INFO L85 PathProgramCache]: Analyzing trace with hash -241610471, now seen corresponding path program 1 times [2023-08-30 16:50:23,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:23,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007571790] [2023-08-30 16:50:23,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:23,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:23,796 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:23,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:23,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007571790] [2023-08-30 16:50:23,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007571790] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:23,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:23,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:50:23,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274569971] [2023-08-30 16:50:23,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:23,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:50:23,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:23,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:50:23,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:50:23,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 242 [2023-08-30 16:50:23,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 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:23,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:23,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 242 [2023-08-30 16:50:23,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:24,130 INFO L130 PetriNetUnfolder]: 2410/3830 cut-off events. [2023-08-30 16:50:24,131 INFO L131 PetriNetUnfolder]: For 6004/6240 co-relation queries the response was YES. [2023-08-30 16:50:24,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13530 conditions, 3830 events. 2410/3830 cut-off events. For 6004/6240 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 22139 event pairs, 312 based on Foata normal form. 464/4172 useless extension candidates. Maximal degree in co-relation 13506. Up to 1654 conditions per place. [2023-08-30 16:50:24,143 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 94 selfloop transitions, 14 changer transitions 0/116 dead transitions. [2023-08-30 16:50:24,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 116 transitions, 908 flow [2023-08-30 16:50:24,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:50:24,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:50:24,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 751 transitions. [2023-08-30 16:50:24,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5172176308539945 [2023-08-30 16:50:24,145 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 751 transitions. [2023-08-30 16:50:24,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 751 transitions. [2023-08-30 16:50:24,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:24,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 751 transitions. [2023-08-30 16:50:24,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 0 states have call successors, (0), 0 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:24,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 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:24,149 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 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:24,149 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 278 flow. Second operand 6 states and 751 transitions. [2023-08-30 16:50:24,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 116 transitions, 908 flow [2023-08-30 16:50:24,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 116 transitions, 880 flow, removed 14 selfloop flow, removed 1 redundant places. [2023-08-30 16:50:24,162 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 386 flow [2023-08-30 16:50:24,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=386, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2023-08-30 16:50:24,162 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 19 predicate places. [2023-08-30 16:50:24,162 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 386 flow [2023-08-30 16:50:24,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 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:24,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:24,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:24,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:50:24,163 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:24,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:24,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1003712614, now seen corresponding path program 1 times [2023-08-30 16:50:24,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:24,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111687850] [2023-08-30 16:50:24,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:24,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:24,325 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:24,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:24,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111687850] [2023-08-30 16:50:24,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111687850] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:24,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:24,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:50:24,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231860024] [2023-08-30 16:50:24,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:24,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:50:24,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:24,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:50:24,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:50:24,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 242 [2023-08-30 16:50:24,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 386 flow. Second operand has 6 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 0 states have call successors, (0), 0 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:24,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:24,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 242 [2023-08-30 16:50:24,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:24,637 INFO L130 PetriNetUnfolder]: 2078/3339 cut-off events. [2023-08-30 16:50:24,637 INFO L131 PetriNetUnfolder]: For 7318/7694 co-relation queries the response was YES. [2023-08-30 16:50:24,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14128 conditions, 3339 events. 2078/3339 cut-off events. For 7318/7694 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 19265 event pairs, 202 based on Foata normal form. 347/3580 useless extension candidates. Maximal degree in co-relation 14100. Up to 1517 conditions per place. [2023-08-30 16:50:24,652 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 102 selfloop transitions, 23 changer transitions 12/145 dead transitions. [2023-08-30 16:50:24,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 145 transitions, 1204 flow [2023-08-30 16:50:24,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:50:24,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:50:24,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1000 transitions. [2023-08-30 16:50:24,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5165289256198347 [2023-08-30 16:50:24,655 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1000 transitions. [2023-08-30 16:50:24,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1000 transitions. [2023-08-30 16:50:24,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:24,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1000 transitions. [2023-08-30 16:50:24,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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:24,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 0 states have call successors, (0), 0 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:24,659 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 0 states have call successors, (0), 0 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:24,659 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 386 flow. Second operand 8 states and 1000 transitions. [2023-08-30 16:50:24,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 145 transitions, 1204 flow [2023-08-30 16:50:24,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 145 transitions, 1160 flow, removed 17 selfloop flow, removed 2 redundant places. [2023-08-30 16:50:24,733 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 510 flow [2023-08-30 16:50:24,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=510, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2023-08-30 16:50:24,734 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places. [2023-08-30 16:50:24,734 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 510 flow [2023-08-30 16:50:24,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 0 states have call successors, (0), 0 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:24,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:24,735 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] [2023-08-30 16:50:24,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:50:24,736 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:24,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:24,736 INFO L85 PathProgramCache]: Analyzing trace with hash 882816484, now seen corresponding path program 1 times [2023-08-30 16:50:24,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:24,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274819546] [2023-08-30 16:50:24,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:24,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:24,870 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:24,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:24,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274819546] [2023-08-30 16:50:24,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274819546] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:24,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:24,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:50:24,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979888051] [2023-08-30 16:50:24,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:24,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:50:24,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:24,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:50:24,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:50:24,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 242 [2023-08-30 16:50:24,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 510 flow. Second operand has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 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:24,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:24,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 242 [2023-08-30 16:50:24,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:25,264 INFO L130 PetriNetUnfolder]: 3189/5093 cut-off events. [2023-08-30 16:50:25,265 INFO L131 PetriNetUnfolder]: For 16898/17095 co-relation queries the response was YES. [2023-08-30 16:50:25,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21963 conditions, 5093 events. 3189/5093 cut-off events. For 16898/17095 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 30993 event pairs, 475 based on Foata normal form. 101/5087 useless extension candidates. Maximal degree in co-relation 21932. Up to 2651 conditions per place. [2023-08-30 16:50:25,285 INFO L137 encePairwiseOnDemand]: 239/242 looper letters, 75 selfloop transitions, 2 changer transitions 49/132 dead transitions. [2023-08-30 16:50:25,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 132 transitions, 1376 flow [2023-08-30 16:50:25,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:50:25,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:50:25,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 507 transitions. [2023-08-30 16:50:25,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5237603305785123 [2023-08-30 16:50:25,287 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 507 transitions. [2023-08-30 16:50:25,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 507 transitions. [2023-08-30 16:50:25,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:25,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 507 transitions. [2023-08-30 16:50:25,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 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:25,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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:25,289 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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:25,290 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 510 flow. Second operand 4 states and 507 transitions. [2023-08-30 16:50:25,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 132 transitions, 1376 flow [2023-08-30 16:50:25,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 132 transitions, 1115 flow, removed 105 selfloop flow, removed 4 redundant places. [2023-08-30 16:50:25,474 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 398 flow [2023-08-30 16:50:25,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=398, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2023-08-30 16:50:25,474 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 28 predicate places. [2023-08-30 16:50:25,474 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 398 flow [2023-08-30 16:50:25,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 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:25,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:25,475 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] [2023-08-30 16:50:25,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:50:25,475 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:25,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:25,476 INFO L85 PathProgramCache]: Analyzing trace with hash 680821688, now seen corresponding path program 2 times [2023-08-30 16:50:25,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:25,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402560845] [2023-08-30 16:50:25,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:25,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:25,639 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:25,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:25,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402560845] [2023-08-30 16:50:25,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402560845] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:25,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:25,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:50:25,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437759723] [2023-08-30 16:50:25,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:25,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:50:25,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:25,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:50:25,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:50:25,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 242 [2023-08-30 16:50:25,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 398 flow. Second operand has 7 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 0 states have call successors, (0), 0 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:25,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:25,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 242 [2023-08-30 16:50:25,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:26,084 INFO L130 PetriNetUnfolder]: 2508/4158 cut-off events. [2023-08-30 16:50:26,084 INFO L131 PetriNetUnfolder]: For 7922/8214 co-relation queries the response was YES. [2023-08-30 16:50:26,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15471 conditions, 4158 events. 2508/4158 cut-off events. For 7922/8214 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 26690 event pairs, 241 based on Foata normal form. 237/4238 useless extension candidates. Maximal degree in co-relation 15439. Up to 1038 conditions per place. [2023-08-30 16:50:26,097 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 66 selfloop transitions, 20 changer transitions 51/142 dead transitions. [2023-08-30 16:50:26,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 142 transitions, 1148 flow [2023-08-30 16:50:26,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 16:50:26,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 16:50:26,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1220 transitions. [2023-08-30 16:50:26,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5041322314049587 [2023-08-30 16:50:26,101 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1220 transitions. [2023-08-30 16:50:26,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1220 transitions. [2023-08-30 16:50:26,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:26,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1220 transitions. [2023-08-30 16:50:26,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.0) internal successors, (1220), 10 states have internal predecessors, (1220), 0 states have call successors, (0), 0 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:26,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 242.0) internal successors, (2662), 11 states have internal predecessors, (2662), 0 states have call successors, (0), 0 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:26,106 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 242.0) internal successors, (2662), 11 states have internal predecessors, (2662), 0 states have call successors, (0), 0 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:26,106 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 398 flow. Second operand 10 states and 1220 transitions. [2023-08-30 16:50:26,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 142 transitions, 1148 flow [2023-08-30 16:50:26,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 142 transitions, 1116 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-30 16:50:26,202 INFO L231 Difference]: Finished difference. Result has 75 places, 46 transitions, 342 flow [2023-08-30 16:50:26,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=342, PETRI_PLACES=75, PETRI_TRANSITIONS=46} [2023-08-30 16:50:26,202 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 35 predicate places. [2023-08-30 16:50:26,203 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 46 transitions, 342 flow [2023-08-30 16:50:26,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 0 states have call successors, (0), 0 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:26,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:26,203 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] [2023-08-30 16:50:26,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:50:26,204 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:26,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:26,204 INFO L85 PathProgramCache]: Analyzing trace with hash 394606037, now seen corresponding path program 1 times [2023-08-30 16:50:26,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:26,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288108467] [2023-08-30 16:50:26,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:26,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:26,370 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:26,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:26,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288108467] [2023-08-30 16:50:26,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288108467] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:26,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:26,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:50:26,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705888641] [2023-08-30 16:50:26,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:26,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:50:26,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:26,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:50:26,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:50:26,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 242 [2023-08-30 16:50:26,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 46 transitions, 342 flow. Second operand has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 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:26,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:26,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 242 [2023-08-30 16:50:26,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:26,566 INFO L130 PetriNetUnfolder]: 996/1730 cut-off events. [2023-08-30 16:50:26,567 INFO L131 PetriNetUnfolder]: For 4857/4905 co-relation queries the response was YES. [2023-08-30 16:50:26,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7323 conditions, 1730 events. 996/1730 cut-off events. For 4857/4905 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 9259 event pairs, 247 based on Foata normal form. 37/1753 useless extension candidates. Maximal degree in co-relation 7297. Up to 1004 conditions per place. [2023-08-30 16:50:26,573 INFO L137 encePairwiseOnDemand]: 239/242 looper letters, 36 selfloop transitions, 1 changer transitions 51/90 dead transitions. [2023-08-30 16:50:26,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 90 transitions, 828 flow [2023-08-30 16:50:26,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:50:26,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:50:26,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 505 transitions. [2023-08-30 16:50:26,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5216942148760331 [2023-08-30 16:50:26,575 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 505 transitions. [2023-08-30 16:50:26,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 505 transitions. [2023-08-30 16:50:26,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:26,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 505 transitions. [2023-08-30 16:50:26,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 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:26,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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:26,578 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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:26,578 INFO L175 Difference]: Start difference. First operand has 75 places, 46 transitions, 342 flow. Second operand 4 states and 505 transitions. [2023-08-30 16:50:26,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 90 transitions, 828 flow [2023-08-30 16:50:26,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 90 transitions, 650 flow, removed 39 selfloop flow, removed 13 redundant places. [2023-08-30 16:50:26,593 INFO L231 Difference]: Finished difference. Result has 64 places, 37 transitions, 195 flow [2023-08-30 16:50:26,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=64, PETRI_TRANSITIONS=37} [2023-08-30 16:50:26,594 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 24 predicate places. [2023-08-30 16:50:26,594 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 37 transitions, 195 flow [2023-08-30 16:50:26,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 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:26,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:26,595 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] [2023-08-30 16:50:26,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 16:50:26,595 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:26,595 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:26,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1316430573, now seen corresponding path program 2 times [2023-08-30 16:50:26,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:26,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693000522] [2023-08-30 16:50:26,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:26,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:26,924 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:26,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:26,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693000522] [2023-08-30 16:50:26,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693000522] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:26,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:26,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:50:26,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867450526] [2023-08-30 16:50:26,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:26,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:50:26,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:26,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:50:26,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:50:26,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 242 [2023-08-30 16:50:26,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 37 transitions, 195 flow. Second operand has 6 states, 6 states have (on average 115.66666666666667) internal successors, (694), 6 states have internal predecessors, (694), 0 states have call successors, (0), 0 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:26,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:26,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 242 [2023-08-30 16:50:26,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:27,043 INFO L130 PetriNetUnfolder]: 235/449 cut-off events. [2023-08-30 16:50:27,043 INFO L131 PetriNetUnfolder]: For 788/788 co-relation queries the response was YES. [2023-08-30 16:50:27,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1691 conditions, 449 events. 235/449 cut-off events. For 788/788 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1843 event pairs, 42 based on Foata normal form. 1/448 useless extension candidates. Maximal degree in co-relation 1671. Up to 175 conditions per place. [2023-08-30 16:50:27,045 INFO L137 encePairwiseOnDemand]: 236/242 looper letters, 39 selfloop transitions, 4 changer transitions 26/72 dead transitions. [2023-08-30 16:50:27,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 536 flow [2023-08-30 16:50:27,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:50:27,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:50:27,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 824 transitions. [2023-08-30 16:50:27,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48642266824085006 [2023-08-30 16:50:27,047 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 824 transitions. [2023-08-30 16:50:27,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 824 transitions. [2023-08-30 16:50:27,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:27,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 824 transitions. [2023-08-30 16:50:27,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.71428571428571) internal successors, (824), 7 states have internal predecessors, (824), 0 states have call successors, (0), 0 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:27,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 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:27,051 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 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:27,051 INFO L175 Difference]: Start difference. First operand has 64 places, 37 transitions, 195 flow. Second operand 7 states and 824 transitions. [2023-08-30 16:50:27,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 536 flow [2023-08-30 16:50:27,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 72 transitions, 488 flow, removed 5 selfloop flow, removed 12 redundant places. [2023-08-30 16:50:27,056 INFO L231 Difference]: Finished difference. Result has 55 places, 37 transitions, 180 flow [2023-08-30 16:50:27,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=180, PETRI_PLACES=55, PETRI_TRANSITIONS=37} [2023-08-30 16:50:27,056 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2023-08-30 16:50:27,057 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 37 transitions, 180 flow [2023-08-30 16:50:27,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.66666666666667) internal successors, (694), 6 states have internal predecessors, (694), 0 states have call successors, (0), 0 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:27,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:27,057 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] [2023-08-30 16:50:27,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 16:50:27,058 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:27,058 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:27,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1035509873, now seen corresponding path program 3 times [2023-08-30 16:50:27,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:27,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033830358] [2023-08-30 16:50:27,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:27,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:50:27,094 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:50:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:50:27,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:50:27,163 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:50:27,164 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-30 16:50:27,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-30 16:50:27,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-30 16:50:27,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-30 16:50:27,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-30 16:50:27,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-30 16:50:27,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-30 16:50:27,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 16:50:27,170 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:27,174 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:50:27,174 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:50:27,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:50:27 BasicIcfg [2023-08-30 16:50:27,242 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:50:27,242 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:50:27,242 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:50:27,242 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:50:27,242 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:14" (3/4) ... [2023-08-30 16:50:27,244 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:50:27,307 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:50:27,307 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:50:27,307 INFO L158 Benchmark]: Toolchain (without parser) took 13504.14ms. Allocated memory was 73.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 50.5MB in the beginning and 932.9MB in the end (delta: -882.4MB). Peak memory consumption was 631.2MB. Max. memory is 16.1GB. [2023-08-30 16:50:27,307 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 73.4MB. Free memory was 52.0MB in the beginning and 52.0MB in the end (delta: 46.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:50:27,308 INFO L158 Benchmark]: CACSL2BoogieTranslator took 476.38ms. Allocated memory was 73.4MB in the beginning and 107.0MB in the end (delta: 33.6MB). Free memory was 50.3MB in the beginning and 84.5MB in the end (delta: -34.2MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2023-08-30 16:50:27,308 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.66ms. Allocated memory is still 107.0MB. Free memory was 84.5MB in the beginning and 82.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:50:27,308 INFO L158 Benchmark]: Boogie Preprocessor took 27.95ms. Allocated memory is still 107.0MB. Free memory was 82.2MB in the beginning and 80.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:50:27,308 INFO L158 Benchmark]: RCFGBuilder took 609.75ms. Allocated memory is still 107.0MB. Free memory was 80.3MB in the beginning and 47.4MB in the end (delta: 32.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2023-08-30 16:50:27,308 INFO L158 Benchmark]: TraceAbstraction took 12275.27ms. Allocated memory was 107.0MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 46.8MB in the beginning and 946.5MB in the end (delta: -899.7MB). Peak memory consumption was 579.6MB. Max. memory is 16.1GB. [2023-08-30 16:50:27,309 INFO L158 Benchmark]: Witness Printer took 64.84ms. Allocated memory is still 1.6GB. Free memory was 946.5MB in the beginning and 932.9MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-08-30 16:50:27,312 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.18ms. Allocated memory is still 73.4MB. Free memory was 52.0MB in the beginning and 52.0MB in the end (delta: 46.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 476.38ms. Allocated memory was 73.4MB in the beginning and 107.0MB in the end (delta: 33.6MB). Free memory was 50.3MB in the beginning and 84.5MB in the end (delta: -34.2MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.66ms. Allocated memory is still 107.0MB. Free memory was 84.5MB in the beginning and 82.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.95ms. Allocated memory is still 107.0MB. Free memory was 82.2MB in the beginning and 80.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 609.75ms. Allocated memory is still 107.0MB. Free memory was 80.3MB in the beginning and 47.4MB in the end (delta: 32.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12275.27ms. Allocated memory was 107.0MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 46.8MB in the beginning and 946.5MB in the end (delta: -899.7MB). Peak memory consumption was 579.6MB. Max. memory is 16.1GB. * Witness Printer took 64.84ms. Allocated memory is still 1.6GB. Free memory was 946.5MB in the beginning and 932.9MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 137 PlacesBefore, 40 PlacesAfterwards, 126 TransitionsBefore, 28 TransitionsAfterwards, 2816 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 112 TotalNumberOfCompositions, 6492 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3570, independent: 3377, independent conditional: 0, independent unconditional: 3377, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1596, independent: 1556, independent conditional: 0, independent unconditional: 1556, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3570, independent: 1821, independent conditional: 0, independent unconditional: 1821, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 1596, unknown conditional: 0, unknown unconditional: 1596] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 119, Positive conditional cache size: 0, Positive unconditional cache size: 119, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L856] 0 pthread_t t973; [L857] FCALL, FORK 0 pthread_create(&t973, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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(&t973, ((void *)0), P0, ((void *)0))=-2, t973={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] [L858] 0 pthread_t t974; [L859] FCALL, FORK 0 pthread_create(&t974, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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(&t974, ((void *)0), P1, ((void *)0))=-1, t973={5:0}, t974={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] [L860] 0 pthread_t t975; [L861] FCALL, FORK 0 pthread_create(&t975, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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(&t975, ((void *)0), P2, ((void *)0))=0, t973={5:0}, t974={6:0}, t975={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] [L862] 0 pthread_t t976; [L863] FCALL, FORK 0 pthread_create(&t976, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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(&t976, ((void *)0), P3, ((void *)0))=1, t973={5:0}, t974={6:0}, t975={7:0}, t976={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] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L825] 4 a = 1 [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L769] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=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=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] [L772] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=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=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] [L784] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=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}, 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] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 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) [L792] 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)) [L793] 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)) [L794] 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)) [L795] 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)) [L796] 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)) [L797] 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)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=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}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L834] 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) [L835] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L836] 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 [L837] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L838] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_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=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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 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) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 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 [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_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, t973={5:0}, t974={6:0}, t975={7:0}, t976={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L876] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_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=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=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: 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. - 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: 863]: 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, 165 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: 12.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 528 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 432 mSDsluCounter, 91 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1217 IncrementalHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 40 mSDtfsCounter, 1217 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=510occurred in iteration=8, InterpolantAutomatonStates: 61, 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.0s InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 894 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:27,333 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