./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix002.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/mix002.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 e77d530bbfcfe22638f8b89e94c23e25f591d8037158e571482779188378fc47 --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:05:53,727 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 23:05:53,728 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 23:05:53,752 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 23:05:53,752 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 23:05:53,753 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 23:05:53,754 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 23:05:53,766 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 23:05:53,767 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 23:05:53,768 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 23:05:53,769 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 23:05:53,769 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 23:05:53,770 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 23:05:53,770 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 23:05:53,771 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 23:05:53,772 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 23:05:53,772 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 23:05:53,773 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 23:05:53,774 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 23:05:53,775 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 23:05:53,776 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 23:05:53,778 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 23:05:53,778 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 23:05:53,779 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 23:05:53,781 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 23:05:53,782 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 23:05:53,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 23:05:53,783 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 23:05:53,783 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 23:05:53,783 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 23:05:53,784 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 23:05:53,784 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 23:05:53,785 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 23:05:53,785 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 23:05:53,786 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 23:05:53,786 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 23:05:53,786 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 23:05:53,787 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 23:05:53,787 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 23:05:53,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 23:05:53,788 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 23:05:53,789 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:05:53,803 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 23:05:53,804 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 23:05:53,804 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 23:05:53,804 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 23:05:53,805 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 23:05:53,805 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 23:05:53,805 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 23:05:53,806 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 23:05:53,806 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 23:05:53,806 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 23:05:53,806 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 23:05:53,806 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 23:05:53,807 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 23:05:53,807 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 23:05:53,807 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 23:05:53,807 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 23:05:53,807 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 23:05:53,807 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 23:05:53,807 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 23:05:53,808 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 23:05:53,808 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 23:05:53,808 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 23:05:53,808 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 23:05:53,808 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 23:05:53,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:05:53,809 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 23:05:53,809 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 23:05:53,809 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 23:05:53,809 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 23:05:53,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 23:05:53,810 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 23:05:53,810 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 23:05:53,810 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 23:05:53,810 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 23:05:53,810 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 23:05:53,810 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 -> e77d530bbfcfe22638f8b89e94c23e25f591d8037158e571482779188378fc47 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:05:54,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 23:05:54,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 23:05:54,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 23:05:54,084 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 23:05:54,084 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 23:05:54,086 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002.oepc.i [2023-08-30 23:05:55,056 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 23:05:55,274 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 23:05:55,275 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002.oepc.i [2023-08-30 23:05:55,311 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/019cded4c/82f0b6be0c084e9dab4ebbb1d6933d40/FLAGa51702cdb [2023-08-30 23:05:55,321 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/019cded4c/82f0b6be0c084e9dab4ebbb1d6933d40 [2023-08-30 23:05:55,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 23:05:55,324 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 23:05:55,324 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 23:05:55,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 23:05:55,337 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 23:05:55,338 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:05:55" (1/1) ... [2023-08-30 23:05:55,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53483a45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:05:55, skipping insertion in model container [2023-08-30 23:05:55,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:05:55" (1/1) ... [2023-08-30 23:05:55,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 23:05:55,367 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 23:05:55,477 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/mix002.oepc.i[945,958] [2023-08-30 23:05:55,666 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:05:55,679 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 23:05:55,702 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/mix002.oepc.i[945,958] [2023-08-30 23:05:55,728 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:05:55,750 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:05:55,751 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:05:55,755 INFO L208 MainTranslator]: Completed translation [2023-08-30 23:05:55,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:05:55 WrapperNode [2023-08-30 23:05:55,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 23:05:55,756 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 23:05:55,756 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 23:05:55,756 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 23:05:55,761 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:05:55" (1/1) ... [2023-08-30 23:05:55,771 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:05:55" (1/1) ... [2023-08-30 23:05:55,787 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2023-08-30 23:05:55,787 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 23:05:55,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 23:05:55,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 23:05:55,788 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 23:05:55,793 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:05:55" (1/1) ... [2023-08-30 23:05:55,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:05:55" (1/1) ... [2023-08-30 23:05:55,795 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:05:55" (1/1) ... [2023-08-30 23:05:55,796 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:05:55" (1/1) ... [2023-08-30 23:05:55,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:05:55" (1/1) ... [2023-08-30 23:05:55,802 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:05:55" (1/1) ... [2023-08-30 23:05:55,803 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:05:55" (1/1) ... [2023-08-30 23:05:55,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:05:55" (1/1) ... [2023-08-30 23:05:55,806 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 23:05:55,807 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 23:05:55,807 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 23:05:55,807 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 23:05:55,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:05:55" (1/1) ... [2023-08-30 23:05:55,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:05:55,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 23:05:55,829 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:05:55,837 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:05:55,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 23:05:55,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 23:05:55,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 23:05:55,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 23:05:55,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 23:05:55,859 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 23:05:55,859 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 23:05:55,859 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 23:05:55,860 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 23:05:55,860 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 23:05:55,860 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 23:05:55,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 23:05:55,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 23:05:55,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 23:05:55,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 23:05:55,861 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:05:56,033 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 23:05:56,034 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 23:05:56,348 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 23:05:56,434 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 23:05:56,434 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 23:05:56,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:05:56 BoogieIcfgContainer [2023-08-30 23:05:56,436 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 23:05:56,439 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 23:05:56,439 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 23:05:56,441 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 23:05:56,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 11:05:55" (1/3) ... [2023-08-30 23:05:56,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81cbd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:05:56, skipping insertion in model container [2023-08-30 23:05:56,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:05:55" (2/3) ... [2023-08-30 23:05:56,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81cbd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:05:56, skipping insertion in model container [2023-08-30 23:05:56,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:05:56" (3/3) ... [2023-08-30 23:05:56,444 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002.oepc.i [2023-08-30 23:05:56,449 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 23:05:56,456 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 23:05:56,457 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 23:05:56,457 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 23:05:56,511 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 23:05:56,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 249 flow [2023-08-30 23:05:56,592 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2023-08-30 23:05:56,592 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:05:56,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2023-08-30 23:05:56,598 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 117 transitions, 249 flow [2023-08-30 23:05:56,602 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 114 transitions, 237 flow [2023-08-30 23:05:56,605 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 23:05:56,611 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 114 transitions, 237 flow [2023-08-30 23:05:56,613 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 114 transitions, 237 flow [2023-08-30 23:05:56,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 237 flow [2023-08-30 23:05:56,639 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2023-08-30 23:05:56,640 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:05:56,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2023-08-30 23:05:56,643 INFO L119 LiptonReduction]: Number of co-enabled transitions 2348 [2023-08-30 23:05:59,313 INFO L134 LiptonReduction]: Checked pairs total: 7155 [2023-08-30 23:05:59,314 INFO L136 LiptonReduction]: Total number of compositions: 96 [2023-08-30 23:05:59,325 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 23:05:59,330 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;@6a56ca1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 23:05:59,330 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-30 23:05:59,332 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-08-30 23:05:59,332 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:05:59,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:05:59,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 23:05:59,333 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:05:59,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:05:59,336 INFO L85 PathProgramCache]: Analyzing trace with hash 495443, now seen corresponding path program 1 times [2023-08-30 23:05:59,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:05:59,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651219443] [2023-08-30 23:05:59,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:05:59,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:05:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:05:59,565 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:05:59,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:05:59,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651219443] [2023-08-30 23:05:59,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651219443] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:05:59,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:05:59,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:05:59,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698952956] [2023-08-30 23:05:59,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:05:59,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:05:59,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:05:59,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:05:59,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:05:59,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 213 [2023-08-30 23:05:59,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have 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:05:59,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:05:59,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 213 [2023-08-30 23:05:59,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:05:59,893 INFO L130 PetriNetUnfolder]: 1616/2528 cut-off events. [2023-08-30 23:05:59,893 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-08-30 23:05:59,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4952 conditions, 2528 events. 1616/2528 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 14570 event pairs, 204 based on Foata normal form. 100/2421 useless extension candidates. Maximal degree in co-relation 4941. Up to 2013 conditions per place. [2023-08-30 23:05:59,905 INFO L137 encePairwiseOnDemand]: 209/213 looper letters, 34 selfloop transitions, 2 changer transitions 4/44 dead transitions. [2023-08-30 23:05:59,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 44 transitions, 183 flow [2023-08-30 23:05:59,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:05:59,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:05:59,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2023-08-30 23:05:59,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5508607198748043 [2023-08-30 23:05:59,918 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2023-08-30 23:05:59,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2023-08-30 23:05:59,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:05:59,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2023-08-30 23:05:59,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:05:59,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have 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:05:59,929 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have 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:05:59,930 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 67 flow. Second operand 3 states and 352 transitions. [2023-08-30 23:05:59,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 44 transitions, 183 flow [2023-08-30 23:05:59,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 44 transitions, 178 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 23:05:59,934 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 60 flow [2023-08-30 23:05:59,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2023-08-30 23:05:59,937 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2023-08-30 23:05:59,937 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 60 flow [2023-08-30 23:05:59,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have 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:05:59,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:05:59,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:05:59,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 23:05:59,941 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:05:59,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:05:59,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1441248496, now seen corresponding path program 1 times [2023-08-30 23:05:59,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:05:59,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730355031] [2023-08-30 23:05:59,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:05:59,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:06:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:06:00,224 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:06:00,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:06:00,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730355031] [2023-08-30 23:06:00,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730355031] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:06:00,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:06:00,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:06:00,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120875132] [2023-08-30 23:06:00,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:06:00,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:06:00,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:06:00,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:06:00,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:06:00,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 213 [2023-08-30 23:06:00,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have 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:06:00,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:06:00,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 213 [2023-08-30 23:06:00,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:06:00,637 INFO L130 PetriNetUnfolder]: 2899/4264 cut-off events. [2023-08-30 23:06:00,637 INFO L131 PetriNetUnfolder]: For 221/221 co-relation queries the response was YES. [2023-08-30 23:06:00,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8840 conditions, 4264 events. 2899/4264 cut-off events. For 221/221 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 19825 event pairs, 1559 based on Foata normal form. 216/4480 useless extension candidates. Maximal degree in co-relation 8830. Up to 3641 conditions per place. [2023-08-30 23:06:00,652 INFO L137 encePairwiseOnDemand]: 207/213 looper letters, 33 selfloop transitions, 4 changer transitions 22/59 dead transitions. [2023-08-30 23:06:00,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 59 transitions, 256 flow [2023-08-30 23:06:00,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:06:00,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:06:00,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 506 transitions. [2023-08-30 23:06:00,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4751173708920188 [2023-08-30 23:06:00,654 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 506 transitions. [2023-08-30 23:06:00,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 506 transitions. [2023-08-30 23:06:00,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:06:00,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 506 transitions. [2023-08-30 23:06:00,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have 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:06:00,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have 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:06:00,659 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have 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:06:00,659 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 60 flow. Second operand 5 states and 506 transitions. [2023-08-30 23:06:00,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 59 transitions, 256 flow [2023-08-30 23:06:00,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 59 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:06:00,662 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 92 flow [2023-08-30 23:06:00,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=92, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2023-08-30 23:06:00,662 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2023-08-30 23:06:00,662 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 92 flow [2023-08-30 23:06:00,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have 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:06:00,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:06:00,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:06:00,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 23:06:00,664 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:06:00,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:06:00,666 INFO L85 PathProgramCache]: Analyzing trace with hash 351376297, now seen corresponding path program 1 times [2023-08-30 23:06:00,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:06:00,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768744348] [2023-08-30 23:06:00,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:06:00,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:06:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:06:00,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:06:00,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:06:00,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768744348] [2023-08-30 23:06:00,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768744348] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:06:00,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:06:00,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:06:00,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618151179] [2023-08-30 23:06:00,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:06:00,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:06:00,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:06:00,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:06:00,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:06:00,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 213 [2023-08-30 23:06:00,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have 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:06:00,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:06:00,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 213 [2023-08-30 23:06:00,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:06:01,236 INFO L130 PetriNetUnfolder]: 2575/3788 cut-off events. [2023-08-30 23:06:01,237 INFO L131 PetriNetUnfolder]: For 1736/1736 co-relation queries the response was YES. [2023-08-30 23:06:01,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9217 conditions, 3788 events. 2575/3788 cut-off events. For 1736/1736 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 17451 event pairs, 767 based on Foata normal form. 192/3980 useless extension candidates. Maximal degree in co-relation 9204. Up to 2561 conditions per place. [2023-08-30 23:06:01,250 INFO L137 encePairwiseOnDemand]: 209/213 looper letters, 39 selfloop transitions, 3 changer transitions 26/68 dead transitions. [2023-08-30 23:06:01,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 68 transitions, 340 flow [2023-08-30 23:06:01,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:06:01,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:06:01,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2023-08-30 23:06:01,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4807511737089202 [2023-08-30 23:06:01,254 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 512 transitions. [2023-08-30 23:06:01,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 512 transitions. [2023-08-30 23:06:01,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:06:01,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 512 transitions. [2023-08-30 23:06:01,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have 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:06:01,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have 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:06:01,257 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have 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:06:01,257 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 92 flow. Second operand 5 states and 512 transitions. [2023-08-30 23:06:01,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 68 transitions, 340 flow [2023-08-30 23:06:01,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 68 transitions, 334 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 23:06:01,268 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 101 flow [2023-08-30 23:06:01,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=101, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-30 23:06:01,269 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2023-08-30 23:06:01,271 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 101 flow [2023-08-30 23:06:01,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have 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:06:01,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:06:01,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:06:01,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 23:06:01,273 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:06:01,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:06:01,273 INFO L85 PathProgramCache]: Analyzing trace with hash 860744071, now seen corresponding path program 1 times [2023-08-30 23:06:01,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:06:01,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068813411] [2023-08-30 23:06:01,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:06:01,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:06:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:06:01,443 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:06:01,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:06:01,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068813411] [2023-08-30 23:06:01,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068813411] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:06:01,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:06:01,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:06:01,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725094197] [2023-08-30 23:06:01,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:06:01,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:06:01,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:06:01,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:06:01,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:06:01,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 213 [2023-08-30 23:06:01,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 101 flow. Second operand has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have 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:06:01,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:06:01,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 213 [2023-08-30 23:06:01,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:06:01,749 INFO L130 PetriNetUnfolder]: 2235/3304 cut-off events. [2023-08-30 23:06:01,749 INFO L131 PetriNetUnfolder]: For 2439/2439 co-relation queries the response was YES. [2023-08-30 23:06:01,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8334 conditions, 3304 events. 2235/3304 cut-off events. For 2439/2439 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 14438 event pairs, 639 based on Foata normal form. 144/3448 useless extension candidates. Maximal degree in co-relation 8318. Up to 2081 conditions per place. [2023-08-30 23:06:01,759 INFO L137 encePairwiseOnDemand]: 209/213 looper letters, 37 selfloop transitions, 3 changer transitions 22/62 dead transitions. [2023-08-30 23:06:01,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 320 flow [2023-08-30 23:06:01,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:06:01,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:06:01,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 506 transitions. [2023-08-30 23:06:01,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4751173708920188 [2023-08-30 23:06:01,761 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 506 transitions. [2023-08-30 23:06:01,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 506 transitions. [2023-08-30 23:06:01,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:06:01,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 506 transitions. [2023-08-30 23:06:01,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have 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:06:01,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have 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:06:01,765 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have 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:06:01,765 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 101 flow. Second operand 5 states and 506 transitions. [2023-08-30 23:06:01,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 62 transitions, 320 flow [2023-08-30 23:06:01,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 62 transitions, 308 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-30 23:06:01,770 INFO L231 Difference]: Finished difference. Result has 43 places, 28 transitions, 106 flow [2023-08-30 23:06:01,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=106, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2023-08-30 23:06:01,771 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2023-08-30 23:06:01,771 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 106 flow [2023-08-30 23:06:01,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have 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:06:01,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:06:01,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:06:01,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 23:06:01,772 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:06:01,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:06:01,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1026202126, now seen corresponding path program 1 times [2023-08-30 23:06:01,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:06:01,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250563476] [2023-08-30 23:06:01,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:06:01,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:06:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:06:01,868 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:06:01,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:06:01,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250563476] [2023-08-30 23:06:01,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250563476] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:06:01,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:06:01,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:06:01,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268386940] [2023-08-30 23:06:01,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:06:01,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:06:01,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:06:01,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:06:01,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:06:01,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 213 [2023-08-30 23:06:01,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have 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:06:01,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:06:01,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 213 [2023-08-30 23:06:01,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:06:02,092 INFO L130 PetriNetUnfolder]: 1058/1685 cut-off events. [2023-08-30 23:06:02,092 INFO L131 PetriNetUnfolder]: For 1093/1119 co-relation queries the response was YES. [2023-08-30 23:06:02,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4002 conditions, 1685 events. 1058/1685 cut-off events. For 1093/1119 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8150 event pairs, 579 based on Foata normal form. 61/1711 useless extension candidates. Maximal degree in co-relation 3985. Up to 1032 conditions per place. [2023-08-30 23:06:02,098 INFO L137 encePairwiseOnDemand]: 209/213 looper letters, 32 selfloop transitions, 3 changer transitions 15/56 dead transitions. [2023-08-30 23:06:02,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 276 flow [2023-08-30 23:06:02,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:06:02,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:06:02,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 541 transitions. [2023-08-30 23:06:02,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.507981220657277 [2023-08-30 23:06:02,100 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 541 transitions. [2023-08-30 23:06:02,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 541 transitions. [2023-08-30 23:06:02,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:06:02,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 541 transitions. [2023-08-30 23:06:02,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:06:02,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have 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:06:02,103 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have 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:06:02,103 INFO L175 Difference]: Start difference. First operand has 43 places, 28 transitions, 106 flow. Second operand 5 states and 541 transitions. [2023-08-30 23:06:02,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 276 flow [2023-08-30 23:06:02,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 56 transitions, 266 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-30 23:06:02,105 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 111 flow [2023-08-30 23:06:02,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2023-08-30 23:06:02,105 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2023-08-30 23:06:02,106 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 111 flow [2023-08-30 23:06:02,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have 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:06:02,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:06:02,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:06:02,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 23:06:02,106 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:06:02,107 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:06:02,107 INFO L85 PathProgramCache]: Analyzing trace with hash -845948307, now seen corresponding path program 1 times [2023-08-30 23:06:02,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:06:02,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121466102] [2023-08-30 23:06:02,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:06:02,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:06:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:06:02,202 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:06:02,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:06:02,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121466102] [2023-08-30 23:06:02,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121466102] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:06:02,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:06:02,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:06:02,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339539488] [2023-08-30 23:06:02,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:06:02,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:06:02,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:06:02,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:06:02,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:06:02,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 213 [2023-08-30 23:06:02,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have 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:06:02,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:06:02,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 213 [2023-08-30 23:06:02,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:06:02,321 INFO L130 PetriNetUnfolder]: 559/949 cut-off events. [2023-08-30 23:06:02,321 INFO L131 PetriNetUnfolder]: For 657/679 co-relation queries the response was YES. [2023-08-30 23:06:02,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2425 conditions, 949 events. 559/949 cut-off events. For 657/679 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4432 event pairs, 149 based on Foata normal form. 62/990 useless extension candidates. Maximal degree in co-relation 2407. Up to 694 conditions per place. [2023-08-30 23:06:02,326 INFO L137 encePairwiseOnDemand]: 208/213 looper letters, 33 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2023-08-30 23:06:02,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 226 flow [2023-08-30 23:06:02,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:06:02,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:06:02,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2023-08-30 23:06:02,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5273865414710485 [2023-08-30 23:06:02,327 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 337 transitions. [2023-08-30 23:06:02,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions. [2023-08-30 23:06:02,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:06:02,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions. [2023-08-30 23:06:02,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have 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:06:02,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have 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:06:02,329 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have 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:06:02,329 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 111 flow. Second operand 3 states and 337 transitions. [2023-08-30 23:06:02,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 226 flow [2023-08-30 23:06:02,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 43 transitions, 212 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-30 23:06:02,332 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 125 flow [2023-08-30 23:06:02,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-30 23:06:02,334 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2023-08-30 23:06:02,334 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 125 flow [2023-08-30 23:06:02,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have 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:06:02,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:06:02,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:06:02,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 23:06:02,335 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:06:02,335 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:06:02,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1807720365, now seen corresponding path program 1 times [2023-08-30 23:06:02,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:06:02,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634282432] [2023-08-30 23:06:02,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:06:02,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:06:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:06:02,472 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:06:02,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:06:02,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634282432] [2023-08-30 23:06:02,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634282432] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:06:02,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:06:02,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:06:02,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434530446] [2023-08-30 23:06:02,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:06:02,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:06:02,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:06:02,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:06:02,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:06:02,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 213 [2023-08-30 23:06:02,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have 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:06:02,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:06:02,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 213 [2023-08-30 23:06:02,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:06:02,578 INFO L130 PetriNetUnfolder]: 295/551 cut-off events. [2023-08-30 23:06:02,579 INFO L131 PetriNetUnfolder]: For 229/236 co-relation queries the response was YES. [2023-08-30 23:06:02,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1555 conditions, 551 events. 295/551 cut-off events. For 229/236 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2390 event pairs, 104 based on Foata normal form. 51/585 useless extension candidates. Maximal degree in co-relation 1538. Up to 218 conditions per place. [2023-08-30 23:06:02,581 INFO L137 encePairwiseOnDemand]: 208/213 looper letters, 43 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2023-08-30 23:06:02,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 56 transitions, 297 flow [2023-08-30 23:06:02,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:06:02,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:06:02,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 450 transitions. [2023-08-30 23:06:02,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.528169014084507 [2023-08-30 23:06:02,583 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 450 transitions. [2023-08-30 23:06:02,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 450 transitions. [2023-08-30 23:06:02,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:06:02,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 450 transitions. [2023-08-30 23:06:02,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have 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:06:02,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have 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:06:02,585 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have 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:06:02,585 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 125 flow. Second operand 4 states and 450 transitions. [2023-08-30 23:06:02,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 56 transitions, 297 flow [2023-08-30 23:06:02,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 56 transitions, 283 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-30 23:06:02,587 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 155 flow [2023-08-30 23:06:02,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=155, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2023-08-30 23:06:02,587 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2023-08-30 23:06:02,587 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 155 flow [2023-08-30 23:06:02,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have 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:06:02,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:06:02,588 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:06:02,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 23:06:02,588 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:06:02,588 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:06:02,588 INFO L85 PathProgramCache]: Analyzing trace with hash 859917476, now seen corresponding path program 1 times [2023-08-30 23:06:02,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:06:02,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75844445] [2023-08-30 23:06:02,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:06:02,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:06:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:06:02,753 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:06:02,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:06:02,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75844445] [2023-08-30 23:06:02,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75844445] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:06:02,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:06:02,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:06:02,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660360171] [2023-08-30 23:06:02,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:06:02,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:06:02,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:06:02,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:06:02,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:06:02,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 213 [2023-08-30 23:06:02,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have 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:06:02,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:06:02,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 213 [2023-08-30 23:06:02,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:06:03,010 INFO L130 PetriNetUnfolder]: 650/1137 cut-off events. [2023-08-30 23:06:03,010 INFO L131 PetriNetUnfolder]: For 983/983 co-relation queries the response was YES. [2023-08-30 23:06:03,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3358 conditions, 1137 events. 650/1137 cut-off events. For 983/983 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4951 event pairs, 50 based on Foata normal form. 14/1151 useless extension candidates. Maximal degree in co-relation 3340. Up to 610 conditions per place. [2023-08-30 23:06:03,015 INFO L137 encePairwiseOnDemand]: 203/213 looper letters, 63 selfloop transitions, 13 changer transitions 15/91 dead transitions. [2023-08-30 23:06:03,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 91 transitions, 571 flow [2023-08-30 23:06:03,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:06:03,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:06:03,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 686 transitions. [2023-08-30 23:06:03,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.460093896713615 [2023-08-30 23:06:03,018 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 686 transitions. [2023-08-30 23:06:03,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 686 transitions. [2023-08-30 23:06:03,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:06:03,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 686 transitions. [2023-08-30 23:06:03,019 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:06:03,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have 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:06:03,021 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have 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:06:03,021 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 155 flow. Second operand 7 states and 686 transitions. [2023-08-30 23:06:03,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 91 transitions, 571 flow [2023-08-30 23:06:03,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 91 transitions, 537 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-30 23:06:03,024 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 233 flow [2023-08-30 23:06:03,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=233, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-08-30 23:06:03,024 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2023-08-30 23:06:03,024 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 233 flow [2023-08-30 23:06:03,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have 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:06:03,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:06:03,025 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:06:03,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 23:06:03,025 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:06:03,025 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:06:03,025 INFO L85 PathProgramCache]: Analyzing trace with hash -902947838, now seen corresponding path program 2 times [2023-08-30 23:06:03,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:06:03,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930464622] [2023-08-30 23:06:03,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:06:03,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:06:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:06:03,188 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:06:03,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:06:03,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930464622] [2023-08-30 23:06:03,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930464622] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:06:03,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:06:03,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:06:03,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019853367] [2023-08-30 23:06:03,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:06:03,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:06:03,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:06:03,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:06:03,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:06:03,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 213 [2023-08-30 23:06:03,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 233 flow. Second operand has 5 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:06:03,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:06:03,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 213 [2023-08-30 23:06:03,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:06:03,407 INFO L130 PetriNetUnfolder]: 653/1279 cut-off events. [2023-08-30 23:06:03,407 INFO L131 PetriNetUnfolder]: For 1431/1447 co-relation queries the response was YES. [2023-08-30 23:06:03,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4100 conditions, 1279 events. 653/1279 cut-off events. For 1431/1447 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7058 event pairs, 155 based on Foata normal form. 12/1268 useless extension candidates. Maximal degree in co-relation 4078. Up to 679 conditions per place. [2023-08-30 23:06:03,412 INFO L137 encePairwiseOnDemand]: 209/213 looper letters, 63 selfloop transitions, 2 changer transitions 15/88 dead transitions. [2023-08-30 23:06:03,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 88 transitions, 611 flow [2023-08-30 23:06:03,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:06:03,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:06:03,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 537 transitions. [2023-08-30 23:06:03,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.504225352112676 [2023-08-30 23:06:03,414 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 537 transitions. [2023-08-30 23:06:03,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 537 transitions. [2023-08-30 23:06:03,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:06:03,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 537 transitions. [2023-08-30 23:06:03,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have 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:06:03,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have 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:06:03,417 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have 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:06:03,417 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 233 flow. Second operand 5 states and 537 transitions. [2023-08-30 23:06:03,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 88 transitions, 611 flow [2023-08-30 23:06:03,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 88 transitions, 607 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-30 23:06:03,420 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 244 flow [2023-08-30 23:06:03,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=244, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2023-08-30 23:06:03,421 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places. [2023-08-30 23:06:03,421 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 244 flow [2023-08-30 23:06:03,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:06:03,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:06:03,422 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:06:03,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 23:06:03,422 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:06:03,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:06:03,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1510304776, now seen corresponding path program 3 times [2023-08-30 23:06:03,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:06:03,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696327757] [2023-08-30 23:06:03,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:06:03,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:06:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:06:03,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:06:03,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:06:03,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696327757] [2023-08-30 23:06:03,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696327757] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:06:03,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:06:03,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:06:03,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634254752] [2023-08-30 23:06:03,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:06:03,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:06:03,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:06:03,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:06:03,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:06:03,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 213 [2023-08-30 23:06:03,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 244 flow. Second operand has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have 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:06:03,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:06:03,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 213 [2023-08-30 23:06:03,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:06:03,703 INFO L130 PetriNetUnfolder]: 538/1011 cut-off events. [2023-08-30 23:06:03,703 INFO L131 PetriNetUnfolder]: For 1108/1121 co-relation queries the response was YES. [2023-08-30 23:06:03,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3219 conditions, 1011 events. 538/1011 cut-off events. For 1108/1121 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5486 event pairs, 178 based on Foata normal form. 43/1006 useless extension candidates. Maximal degree in co-relation 3199. Up to 391 conditions per place. [2023-08-30 23:06:03,707 INFO L137 encePairwiseOnDemand]: 208/213 looper letters, 40 selfloop transitions, 10 changer transitions 11/68 dead transitions. [2023-08-30 23:06:03,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 68 transitions, 470 flow [2023-08-30 23:06:03,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:06:03,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:06:03,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 550 transitions. [2023-08-30 23:06:03,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5164319248826291 [2023-08-30 23:06:03,709 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 550 transitions. [2023-08-30 23:06:03,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 550 transitions. [2023-08-30 23:06:03,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:06:03,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 550 transitions. [2023-08-30 23:06:03,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.0) internal successors, (550), 5 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:06:03,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have 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:06:03,711 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have 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:06:03,711 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 244 flow. Second operand 5 states and 550 transitions. [2023-08-30 23:06:03,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 68 transitions, 470 flow [2023-08-30 23:06:03,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 438 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-08-30 23:06:03,714 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 214 flow [2023-08-30 23:06:03,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2023-08-30 23:06:03,715 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places. [2023-08-30 23:06:03,715 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 214 flow [2023-08-30 23:06:03,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have 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:06:03,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:06:03,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:06:03,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 23:06:03,716 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:06:03,716 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:06:03,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1452042008, now seen corresponding path program 1 times [2023-08-30 23:06:03,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:06:03,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975997567] [2023-08-30 23:06:03,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:06:03,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:06:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:06:04,628 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:06:04,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:06:04,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975997567] [2023-08-30 23:06:04,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975997567] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:06:04,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:06:04,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 23:06:04,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966069101] [2023-08-30 23:06:04,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:06:04,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 23:06:04,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:06:04,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 23:06:04,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-30 23:06:04,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 213 [2023-08-30 23:06:04,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 38 transitions, 214 flow. Second operand has 9 states, 9 states have (on average 86.77777777777777) internal successors, (781), 9 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have 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:06:04,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:06:04,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 213 [2023-08-30 23:06:04,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:06:05,073 INFO L130 PetriNetUnfolder]: 618/1180 cut-off events. [2023-08-30 23:06:05,073 INFO L131 PetriNetUnfolder]: For 2006/2006 co-relation queries the response was YES. [2023-08-30 23:06:05,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4087 conditions, 1180 events. 618/1180 cut-off events. For 2006/2006 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6201 event pairs, 99 based on Foata normal form. 1/1181 useless extension candidates. Maximal degree in co-relation 4064. Up to 402 conditions per place. [2023-08-30 23:06:05,076 INFO L137 encePairwiseOnDemand]: 202/213 looper letters, 61 selfloop transitions, 11 changer transitions 64/136 dead transitions. [2023-08-30 23:06:05,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 136 transitions, 1031 flow [2023-08-30 23:06:05,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 23:06:05,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 23:06:05,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 939 transitions. [2023-08-30 23:06:05,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44084507042253523 [2023-08-30 23:06:05,079 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 939 transitions. [2023-08-30 23:06:05,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 939 transitions. [2023-08-30 23:06:05,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:06:05,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 939 transitions. [2023-08-30 23:06:05,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 93.9) internal successors, (939), 10 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have 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:06:05,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 213.0) internal successors, (2343), 11 states have internal predecessors, (2343), 0 states have call successors, (0), 0 states have 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:06:05,083 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 213.0) internal successors, (2343), 11 states have internal predecessors, (2343), 0 states have call successors, (0), 0 states have 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:06:05,083 INFO L175 Difference]: Start difference. First operand has 54 places, 38 transitions, 214 flow. Second operand 10 states and 939 transitions. [2023-08-30 23:06:05,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 136 transitions, 1031 flow [2023-08-30 23:06:05,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 136 transitions, 905 flow, removed 32 selfloop flow, removed 5 redundant places. [2023-08-30 23:06:05,090 INFO L231 Difference]: Finished difference. Result has 62 places, 44 transitions, 261 flow [2023-08-30 23:06:05,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=261, PETRI_PLACES=62, PETRI_TRANSITIONS=44} [2023-08-30 23:06:05,090 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 24 predicate places. [2023-08-30 23:06:05,090 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 44 transitions, 261 flow [2023-08-30 23:06:05,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 86.77777777777777) internal successors, (781), 9 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have 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:06:05,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:06:05,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:06:05,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 23:06:05,091 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:06:05,091 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:06:05,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1678544726, now seen corresponding path program 2 times [2023-08-30 23:06:05,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:06:05,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167029293] [2023-08-30 23:06:05,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:06:05,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:06:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:06:05,580 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:06:05,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:06:05,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167029293] [2023-08-30 23:06:05,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167029293] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:06:05,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:06:05,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 23:06:05,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075133850] [2023-08-30 23:06:05,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:06:05,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 23:06:05,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:06:05,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 23:06:05,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 23:06:05,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 213 [2023-08-30 23:06:05,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 44 transitions, 261 flow. Second operand has 8 states, 8 states have (on average 96.625) internal successors, (773), 8 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have 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:06:05,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:06:05,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 213 [2023-08-30 23:06:05,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:06:05,843 INFO L130 PetriNetUnfolder]: 361/786 cut-off events. [2023-08-30 23:06:05,843 INFO L131 PetriNetUnfolder]: For 1271/1313 co-relation queries the response was YES. [2023-08-30 23:06:05,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2880 conditions, 786 events. 361/786 cut-off events. For 1271/1313 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4406 event pairs, 69 based on Foata normal form. 26/789 useless extension candidates. Maximal degree in co-relation 2861. Up to 322 conditions per place. [2023-08-30 23:06:05,846 INFO L137 encePairwiseOnDemand]: 206/213 looper letters, 45 selfloop transitions, 6 changer transitions 24/83 dead transitions. [2023-08-30 23:06:05,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 83 transitions, 611 flow [2023-08-30 23:06:05,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 23:06:05,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 23:06:05,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 803 transitions. [2023-08-30 23:06:05,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47124413145539906 [2023-08-30 23:06:05,848 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 803 transitions. [2023-08-30 23:06:05,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 803 transitions. [2023-08-30 23:06:05,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:06:05,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 803 transitions. [2023-08-30 23:06:05,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 100.375) internal successors, (803), 8 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have 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:06:05,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 213.0) internal successors, (1917), 9 states have internal predecessors, (1917), 0 states have call successors, (0), 0 states have 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:06:05,853 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 213.0) internal successors, (1917), 9 states have internal predecessors, (1917), 0 states have call successors, (0), 0 states have 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:06:05,853 INFO L175 Difference]: Start difference. First operand has 62 places, 44 transitions, 261 flow. Second operand 8 states and 803 transitions. [2023-08-30 23:06:05,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 83 transitions, 611 flow [2023-08-30 23:06:05,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 83 transitions, 586 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-08-30 23:06:05,858 INFO L231 Difference]: Finished difference. Result has 63 places, 42 transitions, 242 flow [2023-08-30 23:06:05,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=242, PETRI_PLACES=63, PETRI_TRANSITIONS=42} [2023-08-30 23:06:05,859 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 25 predicate places. [2023-08-30 23:06:05,859 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 42 transitions, 242 flow [2023-08-30 23:06:05,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 96.625) internal successors, (773), 8 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have 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:06:05,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:06:05,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:06:05,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 23:06:05,860 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:06:05,860 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:06:05,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1796780894, now seen corresponding path program 3 times [2023-08-30 23:06:05,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:06:05,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363216531] [2023-08-30 23:06:05,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:06:05,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:06:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:06:05,917 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 23:06:05,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:06:05,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 23:06:05,998 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 23:06:05,999 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-30 23:06:06,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-30 23:06:06,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-30 23:06:06,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-30 23:06:06,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-30 23:06:06,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-30 23:06:06,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 23:06:06,001 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:06:06,005 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 23:06:06,005 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 23:06:06,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 11:06:06 BasicIcfg [2023-08-30 23:06:06,071 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 23:06:06,071 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 23:06:06,071 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 23:06:06,072 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 23:06:06,072 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:05:56" (3/4) ... [2023-08-30 23:06:06,073 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 23:06:06,139 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 23:06:06,140 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 23:06:06,140 INFO L158 Benchmark]: Toolchain (without parser) took 10816.63ms. Allocated memory was 71.3MB in the beginning and 769.7MB in the end (delta: 698.4MB). Free memory was 46.8MB in the beginning and 611.6MB in the end (delta: -564.7MB). Peak memory consumption was 135.1MB. Max. memory is 16.1GB. [2023-08-30 23:06:06,140 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 71.3MB. Free memory was 48.8MB in the beginning and 48.7MB in the end (delta: 94.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 23:06:06,141 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.31ms. Allocated memory was 71.3MB in the beginning and 90.2MB in the end (delta: 18.9MB). Free memory was 46.7MB in the beginning and 60.7MB in the end (delta: -14.1MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2023-08-30 23:06:06,141 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.05ms. Allocated memory is still 90.2MB. Free memory was 60.7MB in the beginning and 58.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:06:06,141 INFO L158 Benchmark]: Boogie Preprocessor took 18.79ms. Allocated memory is still 90.2MB. Free memory was 58.2MB in the beginning and 56.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:06:06,141 INFO L158 Benchmark]: RCFGBuilder took 629.69ms. Allocated memory is still 90.2MB. Free memory was 56.2MB in the beginning and 45.6MB in the end (delta: 10.6MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2023-08-30 23:06:06,142 INFO L158 Benchmark]: TraceAbstraction took 9632.14ms. Allocated memory was 90.2MB in the beginning and 769.7MB in the end (delta: 679.5MB). Free memory was 44.8MB in the beginning and 624.1MB in the end (delta: -579.3MB). Peak memory consumption was 99.6MB. Max. memory is 16.1GB. [2023-08-30 23:06:06,142 INFO L158 Benchmark]: Witness Printer took 68.51ms. Allocated memory is still 769.7MB. Free memory was 624.1MB in the beginning and 611.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-08-30 23:06:06,145 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 71.3MB. Free memory was 48.8MB in the beginning and 48.7MB in the end (delta: 94.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.31ms. Allocated memory was 71.3MB in the beginning and 90.2MB in the end (delta: 18.9MB). Free memory was 46.7MB in the beginning and 60.7MB in the end (delta: -14.1MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.05ms. Allocated memory is still 90.2MB. Free memory was 60.7MB in the beginning and 58.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.79ms. Allocated memory is still 90.2MB. Free memory was 58.2MB in the beginning and 56.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 629.69ms. Allocated memory is still 90.2MB. Free memory was 56.2MB in the beginning and 45.6MB in the end (delta: 10.6MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9632.14ms. Allocated memory was 90.2MB in the beginning and 769.7MB in the end (delta: 679.5MB). Free memory was 44.8MB in the beginning and 624.1MB in the end (delta: -579.3MB). Peak memory consumption was 99.6MB. Max. memory is 16.1GB. * Witness Printer took 68.51ms. Allocated memory is still 769.7MB. Free memory was 624.1MB in the beginning and 611.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 122 PlacesBefore, 38 PlacesAfterwards, 114 TransitionsBefore, 29 TransitionsAfterwards, 2348 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, 7155 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3195, independent: 2962, independent conditional: 0, independent unconditional: 2962, dependent: 233, dependent conditional: 0, dependent unconditional: 233, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1274, independent: 1236, independent conditional: 0, independent unconditional: 1236, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3195, independent: 1726, independent conditional: 0, independent unconditional: 1726, dependent: 195, dependent conditional: 0, dependent unconditional: 195, unknown: 1274, unknown conditional: 0, unknown unconditional: 1274] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 128, Positive conditional cache size: 0, Positive unconditional cache size: 128, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, 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_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int __unbuffered_p2_EAX = 0; [L721] 0 int __unbuffered_p2_EBX = 0; [L723] 0 int a = 0; [L724] 0 _Bool a$flush_delayed; [L725] 0 int a$mem_tmp; [L726] 0 _Bool a$r_buff0_thd0; [L727] 0 _Bool a$r_buff0_thd1; [L728] 0 _Bool a$r_buff0_thd2; [L729] 0 _Bool a$r_buff0_thd3; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$read_delayed; [L735] 0 int *a$read_delayed_var; [L736] 0 int a$w_buff0; [L737] 0 _Bool a$w_buff0_used; [L738] 0 int a$w_buff1; [L739] 0 _Bool a$w_buff1_used; [L740] 0 _Bool main$tmp_guard0; [L741] 0 _Bool main$tmp_guard1; [L743] 0 int x = 0; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L855] 0 pthread_t t38; [L856] FCALL, FORK 0 pthread_create(&t38, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t38, ((void *)0), P0, ((void *)0))=-1, t38={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t39; [L858] FCALL, FORK 0 pthread_create(&t39, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t39, ((void *)0), P1, ((void *)0))=0, t38={5:0}, t39={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L859] 0 pthread_t t40; [L860] FCALL, FORK 0 pthread_create(&t40, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t40, ((void *)0), P2, ((void *)0))=1, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L753] 1 a$w_buff1 = a$w_buff0 [L754] 1 a$w_buff0 = 1 [L755] 1 a$w_buff1_used = a$w_buff0_used [L756] 1 a$w_buff0_used = (_Bool)1 [L757] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L757] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L758] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L759] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L760] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L761] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0, y=0, z=0] [L765] 1 x = 1 [L768] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=0, z=0] [L771] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=0, z=0] [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=1, z=0] [L791] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=1, z=0] [L794] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=1, z=0] [L811] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=1, z=1] [L814] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=1, z=1] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 a$flush_delayed = weak$$choice2 [L820] 3 a$mem_tmp = a [L821] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L822] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L823] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L824] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L825] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L827] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = a [L829] 3 a = a$flush_delayed ? a$mem_tmp : a [L830] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L797] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L798] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L799] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L800] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L801] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L833] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L834] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L835] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L836] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L837] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L774] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L775] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L776] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L777] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L778] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, 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$$choice2=0, x=1, y=1, z=1] [L781] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 1 return 0; [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L840] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L842] 3 return 0; [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L867] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L868] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L869] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L870] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice2=0, x=1, y=1, z=1] [L873] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L875] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, 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=1, 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: 856]: 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: 858]: 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: 860]: 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, 148 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: 9.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 688 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 530 mSDsluCounter, 612 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 450 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1687 IncrementalHoareTripleChecker+Invalid, 1789 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 162 mSDtfsCounter, 1687 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=261occurred in iteration=11, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 190 ConstructedInterpolants, 0 QuantifiedInterpolants, 1604 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-30 23:06:06,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE