./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.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 2b7b455ef4c5fa587af8d02bd246c19891a72a51abfbb562aebbb342c1c7fae8 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 23:15:34,722 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 23:15:34,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 23:15:34,763 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 23:15:34,764 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 23:15:34,767 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 23:15:34,769 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 23:15:34,772 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 23:15:34,774 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 23:15:34,779 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 23:15:34,780 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 23:15:34,782 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 23:15:34,783 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 23:15:34,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 23:15:34,786 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 23:15:34,792 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 23:15:34,793 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 23:15:34,794 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 23:15:34,796 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 23:15:34,798 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 23:15:34,805 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 23:15:34,811 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 23:15:34,812 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 23:15:34,813 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 23:15:34,816 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 23:15:34,818 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 23:15:34,818 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 23:15:34,819 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 23:15:34,822 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 23:15:34,823 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 23:15:34,823 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 23:15:34,824 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 23:15:34,825 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 23:15:34,826 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 23:15:34,827 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 23:15:34,828 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 23:15:34,829 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 23:15:34,829 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 23:15:34,829 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 23:15:34,830 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 23:15:34,830 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 23:15:34,833 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 23:15:34,864 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 23:15:34,865 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 23:15:34,865 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 23:15:34,865 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 23:15:34,866 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 23:15:34,866 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 23:15:34,867 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 23:15:34,867 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 23:15:34,867 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 23:15:34,868 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 23:15:34,868 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 23:15:34,869 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 23:15:34,869 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 23:15:34,869 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 23:15:34,869 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 23:15:34,869 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 23:15:34,870 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 23:15:34,870 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 23:15:34,870 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 23:15:34,870 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 23:15:34,870 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 23:15:34,871 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 23:15:34,871 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 23:15:34,871 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 23:15:34,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:15:34,871 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 23:15:34,872 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 23:15:34,872 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 23:15:34,872 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 23:15:34,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 23:15:34,872 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 23:15:34,873 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 23:15:34,873 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 23:15:34,873 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 23:15:34,873 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 23:15:34,874 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 -> 2b7b455ef4c5fa587af8d02bd246c19891a72a51abfbb562aebbb342c1c7fae8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 23:15:35,174 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 23:15:35,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 23:15:35,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 23:15:35,207 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 23:15:35,208 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 23:15:35,209 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2023-08-30 23:15:36,344 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 23:15:36,563 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 23:15:36,564 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2023-08-30 23:15:36,586 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c20e5cd1/9e52a457129e441eb5164afa43e01389/FLAGf810d8c55 [2023-08-30 23:15:36,599 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c20e5cd1/9e52a457129e441eb5164afa43e01389 [2023-08-30 23:15:36,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 23:15:36,602 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 23:15:36,603 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 23:15:36,603 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 23:15:36,606 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 23:15:36,606 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:15:36" (1/1) ... [2023-08-30 23:15:36,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@396049ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:15:36, skipping insertion in model container [2023-08-30 23:15:36,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:15:36" (1/1) ... [2023-08-30 23:15:36,613 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 23:15:36,667 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 23:15:36,838 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/mix052_tso.oepc.i[949,962] [2023-08-30 23:15:37,046 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:15:37,062 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 23:15:37,075 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/mix052_tso.oepc.i[949,962] [2023-08-30 23:15:37,120 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:15:37,159 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:15:37,159 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:15:37,189 INFO L208 MainTranslator]: Completed translation [2023-08-30 23:15:37,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:15:37 WrapperNode [2023-08-30 23:15:37,190 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 23:15:37,191 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 23:15:37,191 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 23:15:37,191 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 23:15:37,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:15:37" (1/1) ... [2023-08-30 23:15:37,225 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:15:37" (1/1) ... [2023-08-30 23:15:37,258 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-30 23:15:37,258 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 23:15:37,260 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 23:15:37,260 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 23:15:37,260 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 23:15:37,268 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:15:37" (1/1) ... [2023-08-30 23:15:37,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:15:37" (1/1) ... [2023-08-30 23:15:37,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:15:37" (1/1) ... [2023-08-30 23:15:37,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:15:37" (1/1) ... [2023-08-30 23:15:37,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:15:37" (1/1) ... [2023-08-30 23:15:37,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:15:37" (1/1) ... [2023-08-30 23:15:37,307 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:15:37" (1/1) ... [2023-08-30 23:15:37,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:15:37" (1/1) ... [2023-08-30 23:15:37,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 23:15:37,316 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 23:15:37,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 23:15:37,317 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 23:15:37,317 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:15:37" (1/1) ... [2023-08-30 23:15:37,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:15:37,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 23:15:37,343 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 23:15:37,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 23:15:37,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 23:15:37,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 23:15:37,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 23:15:37,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 23:15:37,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 23:15:37,381 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 23:15:37,381 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 23:15:37,381 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 23:15:37,382 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 23:15:37,382 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 23:15:37,382 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 23:15:37,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 23:15:37,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 23:15:37,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 23:15:37,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 23:15:37,384 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 23:15:37,533 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 23:15:37,534 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 23:15:37,853 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 23:15:37,997 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 23:15:37,997 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 23:15:37,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:15:37 BoogieIcfgContainer [2023-08-30 23:15:37,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 23:15:38,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 23:15:38,003 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 23:15:38,005 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 23:15:38,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 11:15:36" (1/3) ... [2023-08-30 23:15:38,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d66ea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:15:38, skipping insertion in model container [2023-08-30 23:15:38,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:15:37" (2/3) ... [2023-08-30 23:15:38,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d66ea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:15:38, skipping insertion in model container [2023-08-30 23:15:38,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:15:37" (3/3) ... [2023-08-30 23:15:38,008 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_tso.oepc.i [2023-08-30 23:15:38,016 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 23:15:38,025 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 23:15:38,026 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 23:15:38,026 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 23:15:38,092 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 23:15:38,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2023-08-30 23:15:38,191 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2023-08-30 23:15:38,192 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:15:38,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-08-30 23:15:38,198 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2023-08-30 23:15:38,207 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2023-08-30 23:15:38,211 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 23:15:38,223 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2023-08-30 23:15:38,227 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2023-08-30 23:15:38,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2023-08-30 23:15:38,268 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2023-08-30 23:15:38,269 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:15:38,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-08-30 23:15:38,272 INFO L119 LiptonReduction]: Number of co-enabled transitions 1906 [2023-08-30 23:15:41,895 INFO L134 LiptonReduction]: Checked pairs total: 5044 [2023-08-30 23:15:41,896 INFO L136 LiptonReduction]: Total number of compositions: 90 [2023-08-30 23:15:41,908 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 23:15:41,914 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;@2d08ffcf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 23:15:41,914 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-30 23:15:41,917 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2023-08-30 23:15:41,918 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:15:41,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:15:41,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 23:15:41,923 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:15:41,959 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:15:41,959 INFO L85 PathProgramCache]: Analyzing trace with hash 449641034, now seen corresponding path program 1 times [2023-08-30 23:15:41,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:15:41,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168604000] [2023-08-30 23:15:41,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:15:41,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:15:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:15:42,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:15:42,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:15:42,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168604000] [2023-08-30 23:15:42,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168604000] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:15:42,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:15:42,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:15:42,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418340200] [2023-08-30 23:15:42,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:15:42,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:15:42,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:15:42,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:15:42,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:15:42,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 198 [2023-08-30 23:15:42,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:42,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:15:42,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 198 [2023-08-30 23:15:42,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:15:42,763 INFO L130 PetriNetUnfolder]: 855/1390 cut-off events. [2023-08-30 23:15:42,763 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-30 23:15:42,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2717 conditions, 1390 events. 855/1390 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7214 event pairs, 141 based on Foata normal form. 0/1321 useless extension candidates. Maximal degree in co-relation 2706. Up to 1027 conditions per place. [2023-08-30 23:15:42,775 INFO L137 encePairwiseOnDemand]: 194/198 looper letters, 29 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2023-08-30 23:15:42,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 150 flow [2023-08-30 23:15:42,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:15:42,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:15:42,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2023-08-30 23:15:42,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5353535353535354 [2023-08-30 23:15:42,790 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 318 transitions. [2023-08-30 23:15:42,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 318 transitions. [2023-08-30 23:15:42,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:15:42,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 318 transitions. [2023-08-30 23:15:42,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:42,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:42,805 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:42,807 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 318 transitions. [2023-08-30 23:15:42,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 150 flow [2023-08-30 23:15:42,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 23:15:42,811 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2023-08-30 23:15:42,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-08-30 23:15:42,816 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-08-30 23:15:42,816 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2023-08-30 23:15:42,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:42,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:15:42,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:15:42,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 23:15:42,818 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:15:42,818 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:15:42,818 INFO L85 PathProgramCache]: Analyzing trace with hash 921111519, now seen corresponding path program 1 times [2023-08-30 23:15:42,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:15:42,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588642606] [2023-08-30 23:15:42,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:15:42,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:15:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:15:43,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:15:43,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:15:43,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588642606] [2023-08-30 23:15:43,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588642606] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:15:43,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:15:43,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:15:43,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666458457] [2023-08-30 23:15:43,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:15:43,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:15:43,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:15:43,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:15:43,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:15:43,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 198 [2023-08-30 23:15:43,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:43,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:15:43,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 198 [2023-08-30 23:15:43,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:15:43,882 INFO L130 PetriNetUnfolder]: 979/1544 cut-off events. [2023-08-30 23:15:43,882 INFO L131 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2023-08-30 23:15:43,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3208 conditions, 1544 events. 979/1544 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7357 event pairs, 465 based on Foata normal form. 80/1621 useless extension candidates. Maximal degree in co-relation 3198. Up to 1243 conditions per place. [2023-08-30 23:15:43,892 INFO L137 encePairwiseOnDemand]: 193/198 looper letters, 29 selfloop transitions, 3 changer transitions 17/51 dead transitions. [2023-08-30 23:15:43,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 51 transitions, 220 flow [2023-08-30 23:15:43,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:15:43,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:15:43,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2023-08-30 23:15:43,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5060606060606061 [2023-08-30 23:15:43,898 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 501 transitions. [2023-08-30 23:15:43,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 501 transitions. [2023-08-30 23:15:43,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:15:43,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 501 transitions. [2023-08-30 23:15:43,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:43,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:43,905 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:43,906 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 5 states and 501 transitions. [2023-08-30 23:15:43,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 51 transitions, 220 flow [2023-08-30 23:15:43,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 51 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:15:43,908 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 77 flow [2023-08-30 23:15:43,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=77, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2023-08-30 23:15:43,909 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2023-08-30 23:15:43,910 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 77 flow [2023-08-30 23:15:43,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:43,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:15:43,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:15:43,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 23:15:43,911 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:15:43,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:15:43,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1510337535, now seen corresponding path program 1 times [2023-08-30 23:15:43,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:15:43,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146714766] [2023-08-30 23:15:43,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:15:43,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:15:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:15:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:15:44,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:15:44,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146714766] [2023-08-30 23:15:44,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146714766] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:15:44,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:15:44,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:15:44,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893957711] [2023-08-30 23:15:44,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:15:44,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:15:44,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:15:44,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:15:44,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:15:44,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 198 [2023-08-30 23:15:44,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 77 flow. Second operand has 6 states, 6 states have (on average 89.83333333333333) internal successors, (539), 6 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:44,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:15:44,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 198 [2023-08-30 23:15:44,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:15:44,938 INFO L130 PetriNetUnfolder]: 956/1531 cut-off events. [2023-08-30 23:15:44,939 INFO L131 PetriNetUnfolder]: For 610/610 co-relation queries the response was YES. [2023-08-30 23:15:44,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3645 conditions, 1531 events. 956/1531 cut-off events. For 610/610 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7612 event pairs, 279 based on Foata normal form. 64/1593 useless extension candidates. Maximal degree in co-relation 3632. Up to 1175 conditions per place. [2023-08-30 23:15:44,948 INFO L137 encePairwiseOnDemand]: 191/198 looper letters, 36 selfloop transitions, 6 changer transitions 16/60 dead transitions. [2023-08-30 23:15:44,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 60 transitions, 285 flow [2023-08-30 23:15:44,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:15:44,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:15:44,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 588 transitions. [2023-08-30 23:15:44,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.494949494949495 [2023-08-30 23:15:44,951 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 588 transitions. [2023-08-30 23:15:44,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 588 transitions. [2023-08-30 23:15:44,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:15:44,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 588 transitions. [2023-08-30 23:15:44,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:44,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:44,956 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:44,956 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 77 flow. Second operand 6 states and 588 transitions. [2023-08-30 23:15:44,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 60 transitions, 285 flow [2023-08-30 23:15:44,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 60 transitions, 280 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 23:15:44,960 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 116 flow [2023-08-30 23:15:44,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=116, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-08-30 23:15:44,961 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2023-08-30 23:15:44,962 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 116 flow [2023-08-30 23:15:44,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.83333333333333) internal successors, (539), 6 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:44,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:15:44,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:15:44,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 23:15:44,963 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:15:44,963 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:15:44,963 INFO L85 PathProgramCache]: Analyzing trace with hash 431079515, now seen corresponding path program 1 times [2023-08-30 23:15:44,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:15:44,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906685663] [2023-08-30 23:15:44,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:15:44,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:15:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:15:45,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:15:45,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:15:45,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906685663] [2023-08-30 23:15:45,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906685663] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:15:45,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:15:45,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:15:45,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902422331] [2023-08-30 23:15:45,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:15:45,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:15:45,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:15:45,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:15:45,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:15:45,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 198 [2023-08-30 23:15:45,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 116 flow. Second operand has 6 states, 6 states have (on average 90.0) internal successors, (540), 6 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:45,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:15:45,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 198 [2023-08-30 23:15:45,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:15:45,879 INFO L130 PetriNetUnfolder]: 1047/1627 cut-off events. [2023-08-30 23:15:45,879 INFO L131 PetriNetUnfolder]: For 1878/1878 co-relation queries the response was YES. [2023-08-30 23:15:45,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4689 conditions, 1627 events. 1047/1627 cut-off events. For 1878/1878 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7663 event pairs, 629 based on Foata normal form. 60/1671 useless extension candidates. Maximal degree in co-relation 4673. Up to 1244 conditions per place. [2023-08-30 23:15:45,890 INFO L137 encePairwiseOnDemand]: 191/198 looper letters, 32 selfloop transitions, 7 changer transitions 16/57 dead transitions. [2023-08-30 23:15:45,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 57 transitions, 336 flow [2023-08-30 23:15:45,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:15:45,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:15:45,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 580 transitions. [2023-08-30 23:15:45,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4882154882154882 [2023-08-30 23:15:45,894 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 580 transitions. [2023-08-30 23:15:45,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 580 transitions. [2023-08-30 23:15:45,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:15:45,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 580 transitions. [2023-08-30 23:15:45,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 96.66666666666667) internal successors, (580), 6 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:45,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:45,898 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:45,898 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 116 flow. Second operand 6 states and 580 transitions. [2023-08-30 23:15:45,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 57 transitions, 336 flow [2023-08-30 23:15:45,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 57 transitions, 320 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-30 23:15:45,905 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 154 flow [2023-08-30 23:15:45,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=154, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-30 23:15:45,906 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2023-08-30 23:15:45,906 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 154 flow [2023-08-30 23:15:45,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.0) internal successors, (540), 6 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:45,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:15:45,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:15:45,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 23:15:45,907 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:15:45,907 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:15:45,907 INFO L85 PathProgramCache]: Analyzing trace with hash -327268661, now seen corresponding path program 1 times [2023-08-30 23:15:45,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:15:45,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567343743] [2023-08-30 23:15:45,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:15:45,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:15:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:15:46,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:15:46,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:15:46,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567343743] [2023-08-30 23:15:46,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567343743] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:15:46,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:15:46,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:15:46,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13899296] [2023-08-30 23:15:46,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:15:46,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:15:46,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:15:46,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:15:46,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:15:46,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 198 [2023-08-30 23:15:46,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 154 flow. Second operand has 7 states, 7 states have (on average 90.85714285714286) internal successors, (636), 7 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:46,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:15:46,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 198 [2023-08-30 23:15:46,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:15:46,970 INFO L130 PetriNetUnfolder]: 1003/1614 cut-off events. [2023-08-30 23:15:46,970 INFO L131 PetriNetUnfolder]: For 3383/3394 co-relation queries the response was YES. [2023-08-30 23:15:46,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5356 conditions, 1614 events. 1003/1614 cut-off events. For 3383/3394 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7955 event pairs, 141 based on Foata normal form. 44/1656 useless extension candidates. Maximal degree in co-relation 5338. Up to 1225 conditions per place. [2023-08-30 23:15:46,984 INFO L137 encePairwiseOnDemand]: 192/198 looper letters, 46 selfloop transitions, 7 changer transitions 15/70 dead transitions. [2023-08-30 23:15:46,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 70 transitions, 462 flow [2023-08-30 23:15:46,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:15:46,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:15:46,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 686 transitions. [2023-08-30 23:15:46,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.494949494949495 [2023-08-30 23:15:46,987 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 686 transitions. [2023-08-30 23:15:46,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 686 transitions. [2023-08-30 23:15:46,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:15:46,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 686 transitions. [2023-08-30 23:15:46,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:46,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:46,991 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:46,991 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 154 flow. Second operand 7 states and 686 transitions. [2023-08-30 23:15:46,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 70 transitions, 462 flow [2023-08-30 23:15:46,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 70 transitions, 442 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-30 23:15:47,000 INFO L231 Difference]: Finished difference. Result has 48 places, 33 transitions, 194 flow [2023-08-30 23:15:47,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=194, PETRI_PLACES=48, PETRI_TRANSITIONS=33} [2023-08-30 23:15:47,001 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2023-08-30 23:15:47,002 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 33 transitions, 194 flow [2023-08-30 23:15:47,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.85714285714286) internal successors, (636), 7 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:47,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:15:47,002 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:15:47,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 23:15:47,003 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:15:47,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:15:47,003 INFO L85 PathProgramCache]: Analyzing trace with hash 262253858, now seen corresponding path program 1 times [2023-08-30 23:15:47,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:15:47,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704898770] [2023-08-30 23:15:47,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:15:47,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:15:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:15:47,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:15:47,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:15:47,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704898770] [2023-08-30 23:15:47,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704898770] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:15:47,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:15:47,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:15:47,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291354919] [2023-08-30 23:15:47,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:15:47,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:15:47,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:15:47,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:15:47,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:15:47,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 198 [2023-08-30 23:15:47,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 33 transitions, 194 flow. Second operand has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:47,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:15:47,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 198 [2023-08-30 23:15:47,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:15:47,549 INFO L130 PetriNetUnfolder]: 658/1102 cut-off events. [2023-08-30 23:15:47,549 INFO L131 PetriNetUnfolder]: For 3482/3558 co-relation queries the response was YES. [2023-08-30 23:15:47,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3979 conditions, 1102 events. 658/1102 cut-off events. For 3482/3558 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5453 event pairs, 127 based on Foata normal form. 133/1215 useless extension candidates. Maximal degree in co-relation 3958. Up to 504 conditions per place. [2023-08-30 23:15:47,557 INFO L137 encePairwiseOnDemand]: 192/198 looper letters, 60 selfloop transitions, 5 changer transitions 0/70 dead transitions. [2023-08-30 23:15:47,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 70 transitions, 538 flow [2023-08-30 23:15:47,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:15:47,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:15:47,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 400 transitions. [2023-08-30 23:15:47,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5050505050505051 [2023-08-30 23:15:47,560 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 400 transitions. [2023-08-30 23:15:47,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 400 transitions. [2023-08-30 23:15:47,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:15:47,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 400 transitions. [2023-08-30 23:15:47,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:47,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:47,563 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:47,563 INFO L175 Difference]: Start difference. First operand has 48 places, 33 transitions, 194 flow. Second operand 4 states and 400 transitions. [2023-08-30 23:15:47,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 70 transitions, 538 flow [2023-08-30 23:15:47,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 70 transitions, 484 flow, removed 22 selfloop flow, removed 4 redundant places. [2023-08-30 23:15:47,569 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 208 flow [2023-08-30 23:15:47,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2023-08-30 23:15:47,570 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2023-08-30 23:15:47,570 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 208 flow [2023-08-30 23:15:47,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:47,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:15:47,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:15:47,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 23:15:47,571 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:15:47,572 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:15:47,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1962425057, now seen corresponding path program 1 times [2023-08-30 23:15:47,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:15:47,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546574500] [2023-08-30 23:15:47,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:15:47,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:15:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:15:47,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:15:47,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:15:47,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546574500] [2023-08-30 23:15:47,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546574500] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:15:47,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:15:47,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:15:47,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339149028] [2023-08-30 23:15:47,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:15:47,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:15:47,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:15:47,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:15:47,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:15:47,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 198 [2023-08-30 23:15:47,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:47,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:15:47,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 198 [2023-08-30 23:15:47,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:15:48,090 INFO L130 PetriNetUnfolder]: 455/822 cut-off events. [2023-08-30 23:15:48,090 INFO L131 PetriNetUnfolder]: For 1972/2028 co-relation queries the response was YES. [2023-08-30 23:15:48,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2944 conditions, 822 events. 455/822 cut-off events. For 1972/2028 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4089 event pairs, 120 based on Foata normal form. 88/904 useless extension candidates. Maximal degree in co-relation 2923. Up to 318 conditions per place. [2023-08-30 23:15:48,096 INFO L137 encePairwiseOnDemand]: 192/198 looper letters, 66 selfloop transitions, 8 changer transitions 0/79 dead transitions. [2023-08-30 23:15:48,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 79 transitions, 576 flow [2023-08-30 23:15:48,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:15:48,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:15:48,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2023-08-30 23:15:48,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5060606060606061 [2023-08-30 23:15:48,098 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 501 transitions. [2023-08-30 23:15:48,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 501 transitions. [2023-08-30 23:15:48,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:15:48,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 501 transitions. [2023-08-30 23:15:48,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:48,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:48,102 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:48,102 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 208 flow. Second operand 5 states and 501 transitions. [2023-08-30 23:15:48,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 79 transitions, 576 flow [2023-08-30 23:15:48,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 79 transitions, 573 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 23:15:48,106 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 260 flow [2023-08-30 23:15:48,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=260, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-08-30 23:15:48,107 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2023-08-30 23:15:48,107 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 260 flow [2023-08-30 23:15:48,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:48,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:15:48,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:15:48,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 23:15:48,108 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:15:48,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:15:48,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1612190483, now seen corresponding path program 1 times [2023-08-30 23:15:48,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:15:48,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248925547] [2023-08-30 23:15:48,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:15:48,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:15:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:15:48,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:15:48,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:15:48,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248925547] [2023-08-30 23:15:48,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248925547] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:15:48,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:15:48,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:15:48,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622456397] [2023-08-30 23:15:48,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:15:48,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:15:48,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:15:48,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:15:48,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:15:48,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 198 [2023-08-30 23:15:48,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 260 flow. Second operand has 6 states, 6 states have (on average 91.66666666666667) internal successors, (550), 6 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:48,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:15:48,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 198 [2023-08-30 23:15:48,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:15:48,674 INFO L130 PetriNetUnfolder]: 422/757 cut-off events. [2023-08-30 23:15:48,674 INFO L131 PetriNetUnfolder]: For 2506/2559 co-relation queries the response was YES. [2023-08-30 23:15:48,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2920 conditions, 757 events. 422/757 cut-off events. For 2506/2559 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3764 event pairs, 119 based on Foata normal form. 49/800 useless extension candidates. Maximal degree in co-relation 2896. Up to 318 conditions per place. [2023-08-30 23:15:48,679 INFO L137 encePairwiseOnDemand]: 192/198 looper letters, 52 selfloop transitions, 11 changer transitions 1/69 dead transitions. [2023-08-30 23:15:48,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 69 transitions, 539 flow [2023-08-30 23:15:48,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:15:48,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:15:48,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 582 transitions. [2023-08-30 23:15:48,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4898989898989899 [2023-08-30 23:15:48,681 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 582 transitions. [2023-08-30 23:15:48,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 582 transitions. [2023-08-30 23:15:48,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:15:48,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 582 transitions. [2023-08-30 23:15:48,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 97.0) internal successors, (582), 6 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:48,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:48,685 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:48,686 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 260 flow. Second operand 6 states and 582 transitions. [2023-08-30 23:15:48,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 69 transitions, 539 flow [2023-08-30 23:15:48,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 69 transitions, 496 flow, removed 18 selfloop flow, removed 3 redundant places. [2023-08-30 23:15:48,691 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 262 flow [2023-08-30 23:15:48,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=262, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2023-08-30 23:15:48,694 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2023-08-30 23:15:48,694 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 262 flow [2023-08-30 23:15:48,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.66666666666667) internal successors, (550), 6 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:48,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:15:48,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:15:48,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 23:15:48,695 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:15:48,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:15:48,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1028448776, now seen corresponding path program 1 times [2023-08-30 23:15:48,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:15:48,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186538245] [2023-08-30 23:15:48,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:15:48,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:15:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:15:49,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:15:49,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:15:49,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186538245] [2023-08-30 23:15:49,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186538245] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:15:49,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:15:49,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 23:15:49,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721906464] [2023-08-30 23:15:49,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:15:49,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 23:15:49,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:15:49,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 23:15:49,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-30 23:15:49,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 198 [2023-08-30 23:15:49,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 262 flow. Second operand has 8 states, 8 states have (on average 82.625) internal successors, (661), 8 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:49,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:15:49,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 198 [2023-08-30 23:15:49,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:15:49,748 INFO L130 PetriNetUnfolder]: 1009/1695 cut-off events. [2023-08-30 23:15:49,748 INFO L131 PetriNetUnfolder]: For 5652/5717 co-relation queries the response was YES. [2023-08-30 23:15:49,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6720 conditions, 1695 events. 1009/1695 cut-off events. For 5652/5717 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 8987 event pairs, 105 based on Foata normal form. 48/1743 useless extension candidates. Maximal degree in co-relation 6695. Up to 821 conditions per place. [2023-08-30 23:15:49,757 INFO L137 encePairwiseOnDemand]: 189/198 looper letters, 50 selfloop transitions, 4 changer transitions 62/119 dead transitions. [2023-08-30 23:15:49,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 119 transitions, 959 flow [2023-08-30 23:15:49,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 23:15:49,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 23:15:49,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 709 transitions. [2023-08-30 23:15:49,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4476010101010101 [2023-08-30 23:15:49,760 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 709 transitions. [2023-08-30 23:15:49,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 709 transitions. [2023-08-30 23:15:49,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:15:49,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 709 transitions. [2023-08-30 23:15:49,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 88.625) internal successors, (709), 8 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:49,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:49,767 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:49,768 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 262 flow. Second operand 8 states and 709 transitions. [2023-08-30 23:15:49,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 119 transitions, 959 flow [2023-08-30 23:15:49,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 119 transitions, 817 flow, removed 36 selfloop flow, removed 8 redundant places. [2023-08-30 23:15:49,785 INFO L231 Difference]: Finished difference. Result has 60 places, 43 transitions, 269 flow [2023-08-30 23:15:49,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=269, PETRI_PLACES=60, PETRI_TRANSITIONS=43} [2023-08-30 23:15:49,786 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 26 predicate places. [2023-08-30 23:15:49,786 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 43 transitions, 269 flow [2023-08-30 23:15:49,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 82.625) internal successors, (661), 8 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:49,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:15:49,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:15:49,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 23:15:49,787 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:15:49,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:15:49,788 INFO L85 PathProgramCache]: Analyzing trace with hash 551079554, now seen corresponding path program 2 times [2023-08-30 23:15:49,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:15:49,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400723016] [2023-08-30 23:15:49,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:15:49,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:15:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:15:50,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:15:50,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:15:50,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400723016] [2023-08-30 23:15:50,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400723016] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:15:50,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:15:50,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 23:15:50,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863654194] [2023-08-30 23:15:50,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:15:50,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 23:15:50,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:15:50,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 23:15:50,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-30 23:15:50,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 198 [2023-08-30 23:15:50,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 43 transitions, 269 flow. Second operand has 9 states, 9 states have (on average 86.22222222222223) internal successors, (776), 9 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:50,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:15:50,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 198 [2023-08-30 23:15:50,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:15:50,722 INFO L130 PetriNetUnfolder]: 828/1444 cut-off events. [2023-08-30 23:15:50,722 INFO L131 PetriNetUnfolder]: For 4482/4571 co-relation queries the response was YES. [2023-08-30 23:15:50,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5898 conditions, 1444 events. 828/1444 cut-off events. For 4482/4571 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 8090 event pairs, 131 based on Foata normal form. 81/1509 useless extension candidates. Maximal degree in co-relation 5878. Up to 542 conditions per place. [2023-08-30 23:15:50,729 INFO L137 encePairwiseOnDemand]: 190/198 looper letters, 31 selfloop transitions, 2 changer transitions 72/108 dead transitions. [2023-08-30 23:15:50,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 108 transitions, 895 flow [2023-08-30 23:15:50,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 23:15:50,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 23:15:50,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 725 transitions. [2023-08-30 23:15:50,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4577020202020202 [2023-08-30 23:15:50,732 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 725 transitions. [2023-08-30 23:15:50,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 725 transitions. [2023-08-30 23:15:50,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:15:50,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 725 transitions. [2023-08-30 23:15:50,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 90.625) internal successors, (725), 8 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:50,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:50,737 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:50,737 INFO L175 Difference]: Start difference. First operand has 60 places, 43 transitions, 269 flow. Second operand 8 states and 725 transitions. [2023-08-30 23:15:50,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 108 transitions, 895 flow [2023-08-30 23:15:50,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 108 transitions, 839 flow, removed 28 selfloop flow, removed 2 redundant places. [2023-08-30 23:15:50,744 INFO L231 Difference]: Finished difference. Result has 66 places, 34 transitions, 222 flow [2023-08-30 23:15:50,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=222, PETRI_PLACES=66, PETRI_TRANSITIONS=34} [2023-08-30 23:15:50,744 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 32 predicate places. [2023-08-30 23:15:50,744 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 34 transitions, 222 flow [2023-08-30 23:15:50,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 86.22222222222223) internal successors, (776), 9 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:50,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:15:50,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:15:50,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 23:15:50,745 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:15:50,746 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:15:50,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1047689600, now seen corresponding path program 3 times [2023-08-30 23:15:50,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:15:50,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880761213] [2023-08-30 23:15:50,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:15:50,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:15:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:15:51,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:15:51,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:15:51,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880761213] [2023-08-30 23:15:51,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880761213] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:15:51,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:15:51,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 23:15:51,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326461477] [2023-08-30 23:15:51,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:15:51,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 23:15:51,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:15:51,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 23:15:51,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-30 23:15:52,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 198 [2023-08-30 23:15:52,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 34 transitions, 222 flow. Second operand has 8 states, 8 states have (on average 88.5) internal successors, (708), 8 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:52,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:15:52,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 198 [2023-08-30 23:15:52,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:15:52,347 INFO L130 PetriNetUnfolder]: 185/375 cut-off events. [2023-08-30 23:15:52,347 INFO L131 PetriNetUnfolder]: For 1215/1220 co-relation queries the response was YES. [2023-08-30 23:15:52,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1643 conditions, 375 events. 185/375 cut-off events. For 1215/1220 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1576 event pairs, 28 based on Foata normal form. 3/373 useless extension candidates. Maximal degree in co-relation 1619. Up to 196 conditions per place. [2023-08-30 23:15:52,349 INFO L137 encePairwiseOnDemand]: 192/198 looper letters, 35 selfloop transitions, 4 changer transitions 15/56 dead transitions. [2023-08-30 23:15:52,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 56 transitions, 459 flow [2023-08-30 23:15:52,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:15:52,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:15:52,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 553 transitions. [2023-08-30 23:15:52,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4654882154882155 [2023-08-30 23:15:52,352 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 553 transitions. [2023-08-30 23:15:52,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 553 transitions. [2023-08-30 23:15:52,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:15:52,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 553 transitions. [2023-08-30 23:15:52,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:52,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:52,356 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:52,357 INFO L175 Difference]: Start difference. First operand has 66 places, 34 transitions, 222 flow. Second operand 6 states and 553 transitions. [2023-08-30 23:15:52,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 56 transitions, 459 flow [2023-08-30 23:15:52,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 56 transitions, 334 flow, removed 32 selfloop flow, removed 18 redundant places. [2023-08-30 23:15:52,361 INFO L231 Difference]: Finished difference. Result has 51 places, 33 transitions, 158 flow [2023-08-30 23:15:52,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=158, PETRI_PLACES=51, PETRI_TRANSITIONS=33} [2023-08-30 23:15:52,362 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2023-08-30 23:15:52,362 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 33 transitions, 158 flow [2023-08-30 23:15:52,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.5) internal successors, (708), 8 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:52,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:15:52,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:15:52,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 23:15:52,363 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:15:52,363 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:15:52,364 INFO L85 PathProgramCache]: Analyzing trace with hash 787380366, now seen corresponding path program 4 times [2023-08-30 23:15:52,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:15:52,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068696554] [2023-08-30 23:15:52,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:15:52,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:15:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:15:52,423 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 23:15:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:15:52,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 23:15:52,511 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 23:15:52,512 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-30 23:15:52,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-30 23:15:52,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-30 23:15:52,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-30 23:15:52,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-30 23:15:52,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-30 23:15:52,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 23:15:52,514 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:15:52,519 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 23:15:52,519 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 23:15:52,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 11:15:52 BasicIcfg [2023-08-30 23:15:52,606 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 23:15:52,606 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 23:15:52,606 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 23:15:52,606 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 23:15:52,607 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:15:37" (3/4) ... [2023-08-30 23:15:52,609 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 23:15:52,674 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 23:15:52,675 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 23:15:52,675 INFO L158 Benchmark]: Toolchain (without parser) took 16073.61ms. Allocated memory was 67.1MB in the beginning and 312.5MB in the end (delta: 245.4MB). Free memory was 34.9MB in the beginning and 197.9MB in the end (delta: -163.0MB). Peak memory consumption was 83.4MB. Max. memory is 16.1GB. [2023-08-30 23:15:52,675 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 54.5MB. Free memory was 32.3MB in the beginning and 32.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 23:15:52,676 INFO L158 Benchmark]: CACSL2BoogieTranslator took 587.14ms. Allocated memory is still 67.1MB. Free memory was 34.7MB in the beginning and 45.2MB in the end (delta: -10.5MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2023-08-30 23:15:52,676 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.10ms. Allocated memory is still 67.1MB. Free memory was 45.2MB in the beginning and 42.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:15:52,676 INFO L158 Benchmark]: Boogie Preprocessor took 56.11ms. Allocated memory is still 67.1MB. Free memory was 42.3MB in the beginning and 40.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:15:52,677 INFO L158 Benchmark]: RCFGBuilder took 683.17ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 40.5MB in the beginning and 53.7MB in the end (delta: -13.2MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2023-08-30 23:15:52,677 INFO L158 Benchmark]: TraceAbstraction took 14603.93ms. Allocated memory was 81.8MB in the beginning and 312.5MB in the end (delta: 230.7MB). Free memory was 53.2MB in the beginning and 207.4MB in the end (delta: -154.2MB). Peak memory consumption was 75.8MB. Max. memory is 16.1GB. [2023-08-30 23:15:52,677 INFO L158 Benchmark]: Witness Printer took 68.52ms. Allocated memory is still 312.5MB. Free memory was 207.4MB in the beginning and 197.9MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-08-30 23:15:52,680 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 54.5MB. Free memory was 32.3MB in the beginning and 32.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 587.14ms. Allocated memory is still 67.1MB. Free memory was 34.7MB in the beginning and 45.2MB in the end (delta: -10.5MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.10ms. Allocated memory is still 67.1MB. Free memory was 45.2MB in the beginning and 42.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.11ms. Allocated memory is still 67.1MB. Free memory was 42.3MB in the beginning and 40.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 683.17ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 40.5MB in the beginning and 53.7MB in the end (delta: -13.2MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14603.93ms. Allocated memory was 81.8MB in the beginning and 312.5MB in the end (delta: 230.7MB). Free memory was 53.2MB in the beginning and 207.4MB in the end (delta: -154.2MB). Peak memory consumption was 75.8MB. Max. memory is 16.1GB. * Witness Printer took 68.52ms. Allocated memory is still 312.5MB. Free memory was 207.4MB in the beginning and 197.9MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 113 PlacesBefore, 34 PlacesAfterwards, 105 TransitionsBefore, 25 TransitionsAfterwards, 1906 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 90 TotalNumberOfCompositions, 5044 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2277, independent: 2101, independent conditional: 0, independent unconditional: 2101, dependent: 176, dependent conditional: 0, dependent unconditional: 176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1011, independent: 978, independent conditional: 0, independent unconditional: 978, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2277, independent: 1123, independent conditional: 0, independent unconditional: 1123, dependent: 143, dependent conditional: 0, dependent unconditional: 143, unknown: 1011, unknown conditional: 0, unknown unconditional: 1011] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 82, Positive conditional cache size: 0, Positive unconditional cache size: 82, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: 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_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1403; [L821] FCALL, FORK 0 pthread_create(&t1403, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1403, ((void *)0), P0, ((void *)0))=-3, t1403={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L822] 0 pthread_t t1404; [L823] FCALL, FORK 0 pthread_create(&t1404, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1404, ((void *)0), P1, ((void *)0))=-2, t1403={5:0}, t1404={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L824] 0 pthread_t t1405; [L825] FCALL, FORK 0 pthread_create(&t1405, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1405, ((void *)0), P2, ((void *)0))=-1, t1403={5:0}, t1404={6:0}, t1405={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L775] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L792] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L798] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1403={5:0}, t1404={6:0}, t1405={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L835] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1403={5:0}, t1404={6:0}, t1405={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 x$flush_delayed = weak$$choice2 [L841] 0 x$mem_tmp = x [L842] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L843] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L844] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L845] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L846] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L848] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L850] 0 x = x$flush_delayed ? x$mem_tmp : x [L851] 0 x$flush_delayed = (_Bool)0 [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 825]: 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: 823]: 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: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 135 locations, 6 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: 14.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 708 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 584 mSDsluCounter, 452 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 388 mSDsCounter, 179 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1441 IncrementalHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 179 mSolverCounterUnsat, 64 mSDtfsCounter, 1441 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=269occurred in iteration=9, InterpolantAutomatonStates: 64, 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, 5.6s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 151 ConstructedInterpolants, 0 QuantifiedInterpolants, 2425 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-30 23:15:52,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE