./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi008.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/rfi008.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 0d082f4414248fc35e1fa616a9787901263e0e45c6e6a28545f00aa25d14032e --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:54:07,066 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:54:07,068 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:54:07,118 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:54:07,121 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:54:07,123 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:54:07,125 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:54:07,128 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:54:07,130 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:54:07,134 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:54:07,135 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:54:07,137 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:54:07,138 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:54:07,139 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:54:07,140 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:54:07,145 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:54:07,146 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:54:07,147 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:54:07,149 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:54:07,152 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:54:07,153 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:54:07,154 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:54:07,154 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:54:07,155 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:54:07,162 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:54:07,163 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:54:07,163 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:54:07,165 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:54:07,165 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:54:07,166 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:54:07,166 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:54:07,171 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:54:07,173 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:54:07,173 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:54:07,175 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:54:07,175 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:54:07,176 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:54:07,176 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:54:07,176 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:54:07,177 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:54:07,177 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:54:07,178 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:54:07,210 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:54:07,210 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:54:07,211 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:54:07,211 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:54:07,212 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:54:07,212 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:54:07,213 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:54:07,213 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:54:07,213 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:54:07,213 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:54:07,214 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:54:07,214 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:54:07,215 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:54:07,215 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:54:07,215 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:54:07,215 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:54:07,215 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:54:07,215 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:54:07,216 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:54:07,216 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:54:07,216 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:54:07,216 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:54:07,216 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:54:07,216 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:54:07,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:54:07,217 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:54:07,217 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:54:07,217 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:54:07,217 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:54:07,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:54:07,218 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:54:07,218 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:54:07,218 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:54:07,218 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:54:07,218 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:54:07,219 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 -> 0d082f4414248fc35e1fa616a9787901263e0e45c6e6a28545f00aa25d14032e 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:54:07,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:54:07,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:54:07,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:54:07,540 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:54:07,540 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:54:07,541 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi008.opt.i [2023-08-30 16:54:08,745 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:54:08,993 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:54:08,993 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008.opt.i [2023-08-30 16:54:09,009 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d7d0bf2d/db27d5380039463bb80ed17be1b87bb3/FLAG3ec19a07e [2023-08-30 16:54:09,022 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d7d0bf2d/db27d5380039463bb80ed17be1b87bb3 [2023-08-30 16:54:09,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:54:09,025 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:54:09,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:54:09,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:54:09,030 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:54:09,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:54:09" (1/1) ... [2023-08-30 16:54:09,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e3f220b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:09, skipping insertion in model container [2023-08-30 16:54:09,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:54:09" (1/1) ... [2023-08-30 16:54:09,037 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:54:09,090 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:54:09,228 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/rfi008.opt.i[987,1000] [2023-08-30 16:54:09,385 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:54:09,395 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:54:09,410 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/rfi008.opt.i[987,1000] [2023-08-30 16:54:09,478 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:54:09,531 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:54:09,531 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:54:09,537 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:54:09,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:09 WrapperNode [2023-08-30 16:54:09,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:54:09,539 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:54:09,539 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:54:09,539 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:54:09,545 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:54:09" (1/1) ... [2023-08-30 16:54:09,573 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:54:09" (1/1) ... [2023-08-30 16:54:09,610 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2023-08-30 16:54:09,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:54:09,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:54:09,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:54:09,612 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:54:09,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:09" (1/1) ... [2023-08-30 16:54:09,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:09" (1/1) ... [2023-08-30 16:54:09,637 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:09" (1/1) ... [2023-08-30 16:54:09,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:09" (1/1) ... [2023-08-30 16:54:09,644 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:09" (1/1) ... [2023-08-30 16:54:09,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:09" (1/1) ... [2023-08-30 16:54:09,657 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:09" (1/1) ... [2023-08-30 16:54:09,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:09" (1/1) ... [2023-08-30 16:54:09,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:54:09,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:54:09,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:54:09,669 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:54:09,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:09" (1/1) ... [2023-08-30 16:54:09,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:54:09,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:54:09,702 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:54:09,713 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:54:09,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:54:09,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:54:09,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:54:09,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:54:09,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:54:09,744 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:54:09,744 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:54:09,744 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:54:09,745 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:54:09,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:54:09,745 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:54:09,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:54:09,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:54:09,747 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:54:09,933 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:54:09,934 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:54:10,211 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:54:10,344 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:54:10,351 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:54:10,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:54:10 BoogieIcfgContainer [2023-08-30 16:54:10,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:54:10,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:54:10,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:54:10,358 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:54:10,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:54:09" (1/3) ... [2023-08-30 16:54:10,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@415d4efe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:54:10, skipping insertion in model container [2023-08-30 16:54:10,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:09" (2/3) ... [2023-08-30 16:54:10,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@415d4efe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:54:10, skipping insertion in model container [2023-08-30 16:54:10,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:54:10" (3/3) ... [2023-08-30 16:54:10,361 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi008.opt.i [2023-08-30 16:54:10,367 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:54:10,373 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:54:10,374 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:54:10,374 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:54:10,413 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:54:10,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 91 transitions, 192 flow [2023-08-30 16:54:10,487 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2023-08-30 16:54:10,487 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:54:10,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2023-08-30 16:54:10,495 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 91 transitions, 192 flow [2023-08-30 16:54:10,498 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 89 transitions, 184 flow [2023-08-30 16:54:10,501 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:54:10,509 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 89 transitions, 184 flow [2023-08-30 16:54:10,518 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 89 transitions, 184 flow [2023-08-30 16:54:10,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 184 flow [2023-08-30 16:54:10,541 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2023-08-30 16:54:10,543 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:54:10,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2023-08-30 16:54:10,547 INFO L119 LiptonReduction]: Number of co-enabled transitions 1088 [2023-08-30 16:54:13,725 INFO L134 LiptonReduction]: Checked pairs total: 2812 [2023-08-30 16:54:13,725 INFO L136 LiptonReduction]: Total number of compositions: 82 [2023-08-30 16:54:13,738 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:54:13,743 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;@1fc3b4e6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:54:13,744 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-30 16:54:13,748 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2023-08-30 16:54:13,748 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:54:13,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:13,749 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 16:54:13,749 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:54:13,753 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:13,754 INFO L85 PathProgramCache]: Analyzing trace with hash 418329994, now seen corresponding path program 1 times [2023-08-30 16:54:13,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:13,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402625658] [2023-08-30 16:54:13,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:13,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:14,151 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:54:14,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:14,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402625658] [2023-08-30 16:54:14,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402625658] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:14,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:14,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:54:14,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725765402] [2023-08-30 16:54:14,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:14,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:54:14,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:14,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:54:14,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:54:14,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 173 [2023-08-30 16:54:14,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 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:54:14,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:14,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 173 [2023-08-30 16:54:14,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:14,355 INFO L130 PetriNetUnfolder]: 142/272 cut-off events. [2023-08-30 16:54:14,356 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 16:54:14,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 272 events. 142/272 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1102 event pairs, 18 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 527. Up to 205 conditions per place. [2023-08-30 16:54:14,360 INFO L137 encePairwiseOnDemand]: 169/173 looper letters, 18 selfloop transitions, 2 changer transitions 2/24 dead transitions. [2023-08-30 16:54:14,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 24 transitions, 98 flow [2023-08-30 16:54:14,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:54:14,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:54:14,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2023-08-30 16:54:14,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5048169556840078 [2023-08-30 16:54:14,391 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 262 transitions. [2023-08-30 16:54:14,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 262 transitions. [2023-08-30 16:54:14,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:14,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 262 transitions. [2023-08-30 16:54:14,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 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:54:14,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:14,404 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:14,406 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 44 flow. Second operand 3 states and 262 transitions. [2023-08-30 16:54:14,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 24 transitions, 98 flow [2023-08-30 16:54:14,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 24 transitions, 96 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:54:14,412 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 40 flow [2023-08-30 16:54:14,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2023-08-30 16:54:14,417 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2023-08-30 16:54:14,417 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 40 flow [2023-08-30 16:54:14,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 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:54:14,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:14,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:14,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:54:14,420 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:54:14,424 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:14,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1711757112, now seen corresponding path program 1 times [2023-08-30 16:54:14,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:14,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771471730] [2023-08-30 16:54:14,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:14,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:14,668 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:54:14,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:14,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771471730] [2023-08-30 16:54:14,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771471730] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:14,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:14,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:54:14,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418240083] [2023-08-30 16:54:14,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:14,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:54:14,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:14,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:54:14,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:54:14,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 173 [2023-08-30 16:54:14,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 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:54:14,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:14,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 173 [2023-08-30 16:54:14,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:14,834 INFO L130 PetriNetUnfolder]: 167/294 cut-off events. [2023-08-30 16:54:14,834 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-30 16:54:14,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 294 events. 167/294 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 978 event pairs, 65 based on Foata normal form. 4/298 useless extension candidates. Maximal degree in co-relation 612. Up to 267 conditions per place. [2023-08-30 16:54:14,839 INFO L137 encePairwiseOnDemand]: 169/173 looper letters, 21 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2023-08-30 16:54:14,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 24 transitions, 108 flow [2023-08-30 16:54:14,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:54:14,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:54:14,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 247 transitions. [2023-08-30 16:54:14,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47591522157996147 [2023-08-30 16:54:14,842 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 247 transitions. [2023-08-30 16:54:14,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 247 transitions. [2023-08-30 16:54:14,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:14,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 247 transitions. [2023-08-30 16:54:14,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 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:54:14,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:14,847 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:14,847 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 40 flow. Second operand 3 states and 247 transitions. [2023-08-30 16:54:14,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 24 transitions, 108 flow [2023-08-30 16:54:14,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 24 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:54:14,849 INFO L231 Difference]: Finished difference. Result has 24 places, 18 transitions, 55 flow [2023-08-30 16:54:14,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=55, PETRI_PLACES=24, PETRI_TRANSITIONS=18} [2023-08-30 16:54:14,850 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2023-08-30 16:54:14,850 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 55 flow [2023-08-30 16:54:14,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 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:54:14,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:14,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:14,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:54:14,851 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:54:14,853 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:14,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1780199611, now seen corresponding path program 1 times [2023-08-30 16:54:14,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:14,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901479025] [2023-08-30 16:54:14,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:14,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:15,065 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:54:15,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:15,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901479025] [2023-08-30 16:54:15,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901479025] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:15,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:15,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:54:15,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146240814] [2023-08-30 16:54:15,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:15,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:54:15,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:15,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:54:15,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:54:15,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 173 [2023-08-30 16:54:15,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 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:54:15,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:15,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 173 [2023-08-30 16:54:15,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:15,134 INFO L130 PetriNetUnfolder]: 110/219 cut-off events. [2023-08-30 16:54:15,135 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-08-30 16:54:15,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 219 events. 110/219 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 786 event pairs, 39 based on Foata normal form. 6/224 useless extension candidates. Maximal degree in co-relation 464. Up to 137 conditions per place. [2023-08-30 16:54:15,137 INFO L137 encePairwiseOnDemand]: 170/173 looper letters, 17 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2023-08-30 16:54:15,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 23 transitions, 105 flow [2023-08-30 16:54:15,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:54:15,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:54:15,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2023-08-30 16:54:15,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4951830443159923 [2023-08-30 16:54:15,139 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 257 transitions. [2023-08-30 16:54:15,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 257 transitions. [2023-08-30 16:54:15,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:15,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 257 transitions. [2023-08-30 16:54:15,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 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:54:15,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:15,143 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:15,143 INFO L175 Difference]: Start difference. First operand has 24 places, 18 transitions, 55 flow. Second operand 3 states and 257 transitions. [2023-08-30 16:54:15,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 23 transitions, 105 flow [2023-08-30 16:54:15,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 23 transitions, 102 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:54:15,145 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 63 flow [2023-08-30 16:54:15,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=63, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2023-08-30 16:54:15,146 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 1 predicate places. [2023-08-30 16:54:15,149 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 63 flow [2023-08-30 16:54:15,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 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:54:15,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:15,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:15,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:54:15,150 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:54:15,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:15,151 INFO L85 PathProgramCache]: Analyzing trace with hash -56454094, now seen corresponding path program 1 times [2023-08-30 16:54:15,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:15,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765993488] [2023-08-30 16:54:15,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:15,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:15,407 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:54:15,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:15,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765993488] [2023-08-30 16:54:15,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765993488] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:15,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:15,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:54:15,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854510452] [2023-08-30 16:54:15,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:15,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:54:15,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:15,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:54:15,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:54:15,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 173 [2023-08-30 16:54:15,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 63 flow. Second operand has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 states have internal predecessors, (305), 0 states have call successors, (0), 0 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:54:15,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:15,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 173 [2023-08-30 16:54:15,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:15,513 INFO L130 PetriNetUnfolder]: 143/256 cut-off events. [2023-08-30 16:54:15,513 INFO L131 PetriNetUnfolder]: For 99/99 co-relation queries the response was YES. [2023-08-30 16:54:15,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 256 events. 143/256 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 813 event pairs, 80 based on Foata normal form. 8/264 useless extension candidates. Maximal degree in co-relation 607. Up to 177 conditions per place. [2023-08-30 16:54:15,515 INFO L137 encePairwiseOnDemand]: 170/173 looper letters, 23 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2023-08-30 16:54:15,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 26 transitions, 133 flow [2023-08-30 16:54:15,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:54:15,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:54:15,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2023-08-30 16:54:15,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47784200385356457 [2023-08-30 16:54:15,517 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 248 transitions. [2023-08-30 16:54:15,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 248 transitions. [2023-08-30 16:54:15,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:15,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 248 transitions. [2023-08-30 16:54:15,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 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:54:15,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:15,524 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:15,524 INFO L175 Difference]: Start difference. First operand has 26 places, 18 transitions, 63 flow. Second operand 3 states and 248 transitions. [2023-08-30 16:54:15,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 26 transitions, 133 flow [2023-08-30 16:54:15,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 26 transitions, 127 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:54:15,526 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 68 flow [2023-08-30 16:54:15,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2023-08-30 16:54:15,527 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 2 predicate places. [2023-08-30 16:54:15,528 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 68 flow [2023-08-30 16:54:15,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 states have internal predecessors, (305), 0 states have call successors, (0), 0 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:54:15,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:15,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:15,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:54:15,529 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:54:15,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:15,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1981578443, now seen corresponding path program 1 times [2023-08-30 16:54:15,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:15,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331011162] [2023-08-30 16:54:15,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:15,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:15,934 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:54:15,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:15,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331011162] [2023-08-30 16:54:15,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331011162] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:15,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:15,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:54:15,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525073269] [2023-08-30 16:54:15,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:15,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:54:15,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:15,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:54:15,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:54:15,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 173 [2023-08-30 16:54:15,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 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:54:15,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:15,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 173 [2023-08-30 16:54:15,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:16,067 INFO L130 PetriNetUnfolder]: 63/150 cut-off events. [2023-08-30 16:54:16,068 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2023-08-30 16:54:16,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 150 events. 63/150 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 530 event pairs, 29 based on Foata normal form. 23/172 useless extension candidates. Maximal degree in co-relation 341. Up to 64 conditions per place. [2023-08-30 16:54:16,070 INFO L137 encePairwiseOnDemand]: 168/173 looper letters, 28 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2023-08-30 16:54:16,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 35 transitions, 174 flow [2023-08-30 16:54:16,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:54:16,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:54:16,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 333 transitions. [2023-08-30 16:54:16,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48121387283236994 [2023-08-30 16:54:16,072 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 333 transitions. [2023-08-30 16:54:16,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 333 transitions. [2023-08-30 16:54:16,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:16,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 333 transitions. [2023-08-30 16:54:16,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 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:54:16,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 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:54:16,075 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 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:54:16,075 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 68 flow. Second operand 4 states and 333 transitions. [2023-08-30 16:54:16,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 35 transitions, 174 flow [2023-08-30 16:54:16,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 35 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:54:16,078 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 92 flow [2023-08-30 16:54:16,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2023-08-30 16:54:16,080 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 5 predicate places. [2023-08-30 16:54:16,081 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 92 flow [2023-08-30 16:54:16,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 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:54:16,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:16,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:16,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:54:16,082 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:54:16,082 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:16,082 INFO L85 PathProgramCache]: Analyzing trace with hash -627196076, now seen corresponding path program 1 times [2023-08-30 16:54:16,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:16,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907324911] [2023-08-30 16:54:16,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:16,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:16,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:54:16,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:16,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907324911] [2023-08-30 16:54:16,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907324911] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:16,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:16,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:54:16,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495824847] [2023-08-30 16:54:16,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:16,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:54:16,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:16,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:54:16,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:54:16,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 173 [2023-08-30 16:54:16,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 77.4) internal successors, (387), 5 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:54:16,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:16,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 173 [2023-08-30 16:54:16,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:16,603 INFO L130 PetriNetUnfolder]: 51/127 cut-off events. [2023-08-30 16:54:16,603 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2023-08-30 16:54:16,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 127 events. 51/127 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 436 event pairs, 29 based on Foata normal form. 9/135 useless extension candidates. Maximal degree in co-relation 354. Up to 64 conditions per place. [2023-08-30 16:54:16,604 INFO L137 encePairwiseOnDemand]: 168/173 looper letters, 20 selfloop transitions, 6 changer transitions 0/29 dead transitions. [2023-08-30 16:54:16,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 168 flow [2023-08-30 16:54:16,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:54:16,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:54:16,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 402 transitions. [2023-08-30 16:54:16,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4647398843930636 [2023-08-30 16:54:16,606 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 402 transitions. [2023-08-30 16:54:16,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 402 transitions. [2023-08-30 16:54:16,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:16,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 402 transitions. [2023-08-30 16:54:16,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 80.4) internal successors, (402), 5 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:16,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 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:54:16,610 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 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:54:16,610 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 92 flow. Second operand 5 states and 402 transitions. [2023-08-30 16:54:16,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 168 flow [2023-08-30 16:54:16,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 152 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-30 16:54:16,612 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 107 flow [2023-08-30 16:54:16,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-08-30 16:54:16,613 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2023-08-30 16:54:16,613 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 107 flow [2023-08-30 16:54:16,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.4) internal successors, (387), 5 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:54:16,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:16,613 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:54:16,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:54:16,614 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:54:16,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:16,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1080443678, now seen corresponding path program 1 times [2023-08-30 16:54:16,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:16,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151311387] [2023-08-30 16:54:16,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:16,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:17,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:54:17,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:17,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151311387] [2023-08-30 16:54:17,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151311387] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:17,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:17,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:54:17,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783942685] [2023-08-30 16:54:17,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:17,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:54:17,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:17,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:54:17,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:54:17,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 173 [2023-08-30 16:54:17,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 107 flow. Second operand has 7 states, 7 states have (on average 71.28571428571429) internal successors, (499), 7 states have internal predecessors, (499), 0 states have call successors, (0), 0 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:54:17,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:17,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 173 [2023-08-30 16:54:17,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:17,307 INFO L130 PetriNetUnfolder]: 105/230 cut-off events. [2023-08-30 16:54:17,307 INFO L131 PetriNetUnfolder]: For 354/354 co-relation queries the response was YES. [2023-08-30 16:54:17,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 732 conditions, 230 events. 105/230 cut-off events. For 354/354 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 887 event pairs, 0 based on Foata normal form. 1/231 useless extension candidates. Maximal degree in co-relation 715. Up to 115 conditions per place. [2023-08-30 16:54:17,308 INFO L137 encePairwiseOnDemand]: 165/173 looper letters, 23 selfloop transitions, 17 changer transitions 23/63 dead transitions. [2023-08-30 16:54:17,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 63 transitions, 423 flow [2023-08-30 16:54:17,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 16:54:17,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 16:54:17,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 742 transitions. [2023-08-30 16:54:17,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42890173410404625 [2023-08-30 16:54:17,311 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 742 transitions. [2023-08-30 16:54:17,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 742 transitions. [2023-08-30 16:54:17,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:17,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 742 transitions. [2023-08-30 16:54:17,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 74.2) internal successors, (742), 10 states have internal predecessors, (742), 0 states have call successors, (0), 0 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:54:17,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 173.0) internal successors, (1903), 11 states have internal predecessors, (1903), 0 states have call successors, (0), 0 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:54:17,316 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 173.0) internal successors, (1903), 11 states have internal predecessors, (1903), 0 states have call successors, (0), 0 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:54:17,316 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 107 flow. Second operand 10 states and 742 transitions. [2023-08-30 16:54:17,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 63 transitions, 423 flow [2023-08-30 16:54:17,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 63 transitions, 404 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-30 16:54:17,320 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 187 flow [2023-08-30 16:54:17,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=187, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2023-08-30 16:54:17,321 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 18 predicate places. [2023-08-30 16:54:17,321 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 187 flow [2023-08-30 16:54:17,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 71.28571428571429) internal successors, (499), 7 states have internal predecessors, (499), 0 states have call successors, (0), 0 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:54:17,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:17,321 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:54:17,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:54:17,322 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:54:17,322 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:17,322 INFO L85 PathProgramCache]: Analyzing trace with hash 121435920, now seen corresponding path program 2 times [2023-08-30 16:54:17,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:17,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108037885] [2023-08-30 16:54:17,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:17,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:17,569 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:54:17,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:17,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108037885] [2023-08-30 16:54:17,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108037885] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:17,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:17,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:54:17,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774705502] [2023-08-30 16:54:17,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:17,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:54:17,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:17,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:54:17,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:54:17,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 173 [2023-08-30 16:54:17,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 187 flow. Second operand has 5 states, 5 states have (on average 75.2) internal successors, (376), 5 states have internal predecessors, (376), 0 states have call successors, (0), 0 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:54:17,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:17,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 173 [2023-08-30 16:54:17,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:17,691 INFO L130 PetriNetUnfolder]: 38/111 cut-off events. [2023-08-30 16:54:17,691 INFO L131 PetriNetUnfolder]: For 164/164 co-relation queries the response was YES. [2023-08-30 16:54:17,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 111 events. 38/111 cut-off events. For 164/164 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 349 event pairs, 8 based on Foata normal form. 1/112 useless extension candidates. Maximal degree in co-relation 422. Up to 58 conditions per place. [2023-08-30 16:54:17,692 INFO L137 encePairwiseOnDemand]: 167/173 looper letters, 17 selfloop transitions, 3 changer transitions 26/46 dead transitions. [2023-08-30 16:54:17,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 353 flow [2023-08-30 16:54:17,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:54:17,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:54:17,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 469 transitions. [2023-08-30 16:54:17,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45183044315992293 [2023-08-30 16:54:17,695 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 469 transitions. [2023-08-30 16:54:17,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 469 transitions. [2023-08-30 16:54:17,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:17,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 469 transitions. [2023-08-30 16:54:17,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 78.16666666666667) internal successors, (469), 6 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:17,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 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:54:17,699 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 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:54:17,699 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 187 flow. Second operand 6 states and 469 transitions. [2023-08-30 16:54:17,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 353 flow [2023-08-30 16:54:17,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 295 flow, removed 9 selfloop flow, removed 6 redundant places. [2023-08-30 16:54:17,705 INFO L231 Difference]: Finished difference. Result has 43 places, 18 transitions, 81 flow [2023-08-30 16:54:17,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=81, PETRI_PLACES=43, PETRI_TRANSITIONS=18} [2023-08-30 16:54:17,707 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 18 predicate places. [2023-08-30 16:54:17,707 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 18 transitions, 81 flow [2023-08-30 16:54:17,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.2) internal successors, (376), 5 states have internal predecessors, (376), 0 states have call successors, (0), 0 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:54:17,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:17,707 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:54:17,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:54:17,708 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:54:17,708 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:17,709 INFO L85 PathProgramCache]: Analyzing trace with hash 2109151312, now seen corresponding path program 3 times [2023-08-30 16:54:17,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:17,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217367167] [2023-08-30 16:54:17,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:17,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:18,536 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:54:18,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:18,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217367167] [2023-08-30 16:54:18,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217367167] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:18,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:18,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:54:18,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278760921] [2023-08-30 16:54:18,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:18,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:54:18,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:18,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:54:18,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:54:18,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 173 [2023-08-30 16:54:18,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 18 transitions, 81 flow. Second operand has 7 states, 7 states have (on average 76.0) internal successors, (532), 7 states have internal predecessors, (532), 0 states have call successors, (0), 0 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:54:18,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:18,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 173 [2023-08-30 16:54:18,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:18,718 INFO L130 PetriNetUnfolder]: 6/38 cut-off events. [2023-08-30 16:54:18,718 INFO L131 PetriNetUnfolder]: For 34/36 co-relation queries the response was YES. [2023-08-30 16:54:18,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 38 events. 6/38 cut-off events. For 34/36 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 70 event pairs, 0 based on Foata normal form. 1/39 useless extension candidates. Maximal degree in co-relation 115. Up to 13 conditions per place. [2023-08-30 16:54:18,718 INFO L137 encePairwiseOnDemand]: 166/173 looper letters, 12 selfloop transitions, 5 changer transitions 8/27 dead transitions. [2023-08-30 16:54:18,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 27 transitions, 168 flow [2023-08-30 16:54:18,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:54:18,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:54:18,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 614 transitions. [2023-08-30 16:54:18,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4436416184971098 [2023-08-30 16:54:18,721 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 614 transitions. [2023-08-30 16:54:18,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 614 transitions. [2023-08-30 16:54:18,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:18,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 614 transitions. [2023-08-30 16:54:18,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 76.75) internal successors, (614), 8 states have internal predecessors, (614), 0 states have call successors, (0), 0 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:54:18,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 173.0) internal successors, (1557), 9 states have internal predecessors, (1557), 0 states have call successors, (0), 0 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:54:18,725 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 173.0) internal successors, (1557), 9 states have internal predecessors, (1557), 0 states have call successors, (0), 0 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:54:18,725 INFO L175 Difference]: Start difference. First operand has 43 places, 18 transitions, 81 flow. Second operand 8 states and 614 transitions. [2023-08-30 16:54:18,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 27 transitions, 168 flow [2023-08-30 16:54:18,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 27 transitions, 138 flow, removed 8 selfloop flow, removed 9 redundant places. [2023-08-30 16:54:18,727 INFO L231 Difference]: Finished difference. Result has 36 places, 18 transitions, 72 flow [2023-08-30 16:54:18,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=72, PETRI_PLACES=36, PETRI_TRANSITIONS=18} [2023-08-30 16:54:18,728 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 11 predicate places. [2023-08-30 16:54:18,728 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 18 transitions, 72 flow [2023-08-30 16:54:18,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.0) internal successors, (532), 7 states have internal predecessors, (532), 0 states have call successors, (0), 0 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:54:18,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:18,729 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:54:18,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:54:18,730 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:54:18,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:18,730 INFO L85 PathProgramCache]: Analyzing trace with hash 480111130, now seen corresponding path program 4 times [2023-08-30 16:54:18,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:18,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240335258] [2023-08-30 16:54:18,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:18,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:54:18,803 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:54:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:54:18,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:54:18,882 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:54:18,883 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-30 16:54:18,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-30 16:54:18,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-08-30 16:54:18,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-30 16:54:18,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-30 16:54:18,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:54:18,886 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:18,891 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:54:18,891 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:54:18,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:54:18 BasicIcfg [2023-08-30 16:54:18,961 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:54:18,962 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:54:18,962 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:54:18,962 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:54:18,963 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:54:10" (3/4) ... [2023-08-30 16:54:18,964 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:54:19,042 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:54:19,042 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:54:19,043 INFO L158 Benchmark]: Toolchain (without parser) took 10018.15ms. Allocated memory was 69.2MB in the beginning and 184.5MB in the end (delta: 115.3MB). Free memory was 32.8MB in the beginning and 128.4MB in the end (delta: -95.6MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2023-08-30 16:54:19,043 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 69.2MB. Free memory was 46.4MB in the beginning and 46.3MB in the end (delta: 48.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:54:19,044 INFO L158 Benchmark]: CACSL2BoogieTranslator took 511.46ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 32.6MB in the beginning and 59.4MB in the end (delta: -26.8MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2023-08-30 16:54:19,044 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.18ms. Allocated memory is still 83.9MB. Free memory was 59.4MB in the beginning and 56.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:54:19,044 INFO L158 Benchmark]: Boogie Preprocessor took 56.93ms. Allocated memory is still 83.9MB. Free memory was 56.9MB in the beginning and 54.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:54:19,044 INFO L158 Benchmark]: RCFGBuilder took 684.85ms. Allocated memory is still 83.9MB. Free memory was 54.8MB in the beginning and 41.8MB in the end (delta: 13.0MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2023-08-30 16:54:19,046 INFO L158 Benchmark]: TraceAbstraction took 8606.12ms. Allocated memory was 83.9MB in the beginning and 184.5MB in the end (delta: 100.7MB). Free memory was 41.0MB in the beginning and 135.7MB in the end (delta: -94.7MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2023-08-30 16:54:19,046 INFO L158 Benchmark]: Witness Printer took 80.73ms. Allocated memory is still 184.5MB. Free memory was 135.7MB in the beginning and 128.4MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-08-30 16:54:19,048 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.19ms. Allocated memory is still 69.2MB. Free memory was 46.4MB in the beginning and 46.3MB in the end (delta: 48.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 511.46ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 32.6MB in the beginning and 59.4MB in the end (delta: -26.8MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.18ms. Allocated memory is still 83.9MB. Free memory was 59.4MB in the beginning and 56.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.93ms. Allocated memory is still 83.9MB. Free memory was 56.9MB in the beginning and 54.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 684.85ms. Allocated memory is still 83.9MB. Free memory was 54.8MB in the beginning and 41.8MB in the end (delta: 13.0MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * TraceAbstraction took 8606.12ms. Allocated memory was 83.9MB in the beginning and 184.5MB in the end (delta: 100.7MB). Free memory was 41.0MB in the beginning and 135.7MB in the end (delta: -94.7MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Witness Printer took 80.73ms. Allocated memory is still 184.5MB. Free memory was 135.7MB in the beginning and 128.4MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 94 PlacesBefore, 25 PlacesAfterwards, 89 TransitionsBefore, 19 TransitionsAfterwards, 1088 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 82 TotalNumberOfCompositions, 2812 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1208, independent: 1084, independent conditional: 0, independent unconditional: 1084, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 607, independent: 577, independent conditional: 0, independent unconditional: 577, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1208, independent: 507, independent conditional: 0, independent unconditional: 507, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 607, unknown conditional: 0, unknown unconditional: 607] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 33, Positive conditional cache size: 0, Positive unconditional cache size: 33, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L826] 0 pthread_t t1723; [L827] FCALL, FORK 0 pthread_create(&t1723, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1723, ((void *)0), P0, ((void *)0))=-2, t1723={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L828] 0 pthread_t t1724; [L829] FCALL, FORK 0 pthread_create(&t1724, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1724, ((void *)0), P1, ((void *)0))=-1, t1723={5:0}, t1724={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L774] 2 y$w_buff1 = y$w_buff0 [L775] 2 y$w_buff0 = 1 [L776] 2 y$w_buff1_used = y$w_buff0_used [L777] 2 y$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L785] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 2 y$flush_delayed = weak$$choice2 [L788] 2 y$mem_tmp = y [L789] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L790] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L791] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L792] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L793] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L794] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L795] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L796] 2 __unbuffered_p1_EAX = y [L797] 2 y = y$flush_delayed ? y$mem_tmp : y [L798] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L801] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 y$flush_delayed = weak$$choice2 [L752] 1 y$mem_tmp = y [L753] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L754] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L755] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L756] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L757] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L759] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = y [L761] 1 y = y$flush_delayed ? y$mem_tmp : y [L762] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L804] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L805] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L806] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L807] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 2 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1723={5:0}, t1724={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L838] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1723={5:0}, t1724={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L842] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 19]: 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: 829]: 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: 827]: 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 5 procedures, 110 locations, 5 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: 8.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 273 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 203 mSDsluCounter, 133 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 107 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 589 IncrementalHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 26 mSDtfsCounter, 589 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=187occurred in iteration=7, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 759 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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:54:19,077 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