./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix020.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/mix020.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 035ec41aa2053cde8ee24830f9eb7cf444ea0c142ead33ef0c1fe95c3a7de39e --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:10:04,772 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 23:10:04,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 23:10:04,798 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 23:10:04,799 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 23:10:04,800 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 23:10:04,801 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 23:10:04,802 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 23:10:04,804 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 23:10:04,804 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 23:10:04,805 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 23:10:04,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 23:10:04,806 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 23:10:04,807 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 23:10:04,808 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 23:10:04,809 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 23:10:04,810 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 23:10:04,811 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 23:10:04,812 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 23:10:04,814 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 23:10:04,819 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 23:10:04,829 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 23:10:04,831 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 23:10:04,832 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 23:10:04,842 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 23:10:04,846 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 23:10:04,846 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 23:10:04,847 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 23:10:04,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 23:10:04,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 23:10:04,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 23:10:04,850 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 23:10:04,854 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 23:10:04,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 23:10:04,856 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 23:10:04,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 23:10:04,857 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 23:10:04,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 23:10:04,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 23:10:04,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 23:10:04,859 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 23:10:04,860 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:10:04,893 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 23:10:04,894 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 23:10:04,895 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 23:10:04,895 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 23:10:04,896 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 23:10:04,896 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 23:10:04,897 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 23:10:04,897 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 23:10:04,897 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 23:10:04,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 23:10:04,898 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 23:10:04,898 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 23:10:04,898 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 23:10:04,899 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 23:10:04,899 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 23:10:04,899 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 23:10:04,899 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 23:10:04,899 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 23:10:04,900 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 23:10:04,900 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 23:10:04,900 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 23:10:04,900 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 23:10:04,900 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 23:10:04,901 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 23:10:04,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:10:04,901 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 23:10:04,901 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 23:10:04,901 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 23:10:04,902 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 23:10:04,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 23:10:04,902 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 23:10:04,902 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 23:10:04,902 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 23:10:04,903 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 23:10:04,903 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 23:10:04,903 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 -> 035ec41aa2053cde8ee24830f9eb7cf444ea0c142ead33ef0c1fe95c3a7de39e 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:10:05,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 23:10:05,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 23:10:05,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 23:10:05,249 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 23:10:05,249 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 23:10:05,250 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix020.oepc.i [2023-08-30 23:10:06,741 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 23:10:06,986 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 23:10:06,987 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix020.oepc.i [2023-08-30 23:10:07,000 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4053a3e69/0606e744955b4a708b2ac77c1ae46fae/FLAGd28a16242 [2023-08-30 23:10:07,015 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4053a3e69/0606e744955b4a708b2ac77c1ae46fae [2023-08-30 23:10:07,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 23:10:07,019 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 23:10:07,020 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 23:10:07,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 23:10:07,025 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 23:10:07,026 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:10:07" (1/1) ... [2023-08-30 23:10:07,027 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@397957dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:10:07, skipping insertion in model container [2023-08-30 23:10:07,027 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:10:07" (1/1) ... [2023-08-30 23:10:07,035 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 23:10:07,084 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 23:10:07,223 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/mix020.oepc.i[945,958] [2023-08-30 23:10:07,363 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:10:07,375 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 23:10:07,401 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/mix020.oepc.i[945,958] [2023-08-30 23:10:07,471 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:10:07,506 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:10:07,507 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:10:07,513 INFO L208 MainTranslator]: Completed translation [2023-08-30 23:10:07,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:10:07 WrapperNode [2023-08-30 23:10:07,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 23:10:07,516 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 23:10:07,516 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 23:10:07,516 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 23:10:07,523 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:10:07" (1/1) ... [2023-08-30 23:10:07,556 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:10:07" (1/1) ... [2023-08-30 23:10:07,580 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-30 23:10:07,583 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 23:10:07,583 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 23:10:07,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 23:10:07,584 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 23:10:07,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:10:07" (1/1) ... [2023-08-30 23:10:07,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:10:07" (1/1) ... [2023-08-30 23:10:07,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:10:07" (1/1) ... [2023-08-30 23:10:07,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:10:07" (1/1) ... [2023-08-30 23:10:07,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:10:07" (1/1) ... [2023-08-30 23:10:07,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:10:07" (1/1) ... [2023-08-30 23:10:07,624 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:10:07" (1/1) ... [2023-08-30 23:10:07,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:10:07" (1/1) ... [2023-08-30 23:10:07,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 23:10:07,640 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 23:10:07,640 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 23:10:07,641 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 23:10:07,642 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:10:07" (1/1) ... [2023-08-30 23:10:07,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:10:07,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 23:10:07,670 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:10:07,681 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:10:07,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 23:10:07,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 23:10:07,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 23:10:07,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 23:10:07,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 23:10:07,708 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 23:10:07,708 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 23:10:07,708 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 23:10:07,708 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 23:10:07,708 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 23:10:07,708 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 23:10:07,709 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 23:10:07,709 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 23:10:07,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 23:10:07,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 23:10:07,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 23:10:07,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 23:10:07,711 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:10:07,936 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 23:10:07,938 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 23:10:08,209 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 23:10:08,405 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 23:10:08,406 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 23:10:08,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:10:08 BoogieIcfgContainer [2023-08-30 23:10:08,409 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 23:10:08,412 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 23:10:08,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 23:10:08,415 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 23:10:08,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 11:10:07" (1/3) ... [2023-08-30 23:10:08,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b4147d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:10:08, skipping insertion in model container [2023-08-30 23:10:08,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:10:07" (2/3) ... [2023-08-30 23:10:08,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b4147d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:10:08, skipping insertion in model container [2023-08-30 23:10:08,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:10:08" (3/3) ... [2023-08-30 23:10:08,418 INFO L112 eAbstractionObserver]: Analyzing ICFG mix020.oepc.i [2023-08-30 23:10:08,426 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 23:10:08,434 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 23:10:08,434 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 23:10:08,435 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 23:10:08,509 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 23:10:08,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 282 flow [2023-08-30 23:10:08,640 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2023-08-30 23:10:08,640 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:10:08,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-08-30 23:10:08,645 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 282 flow [2023-08-30 23:10:08,653 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2023-08-30 23:10:08,658 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 23:10:08,671 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 266 flow [2023-08-30 23:10:08,675 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 266 flow [2023-08-30 23:10:08,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 266 flow [2023-08-30 23:10:08,719 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2023-08-30 23:10:08,720 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:10:08,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-08-30 23:10:08,725 INFO L119 LiptonReduction]: Number of co-enabled transitions 3164 [2023-08-30 23:10:12,751 INFO L134 LiptonReduction]: Checked pairs total: 9238 [2023-08-30 23:10:12,751 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-08-30 23:10:12,788 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 23:10:12,793 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;@6f06798f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 23:10:12,793 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-30 23:10:12,796 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-08-30 23:10:12,818 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:10:12,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:10:12,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 23:10:12,819 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:10:12,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:10:12,823 INFO L85 PathProgramCache]: Analyzing trace with hash 549528, now seen corresponding path program 1 times [2023-08-30 23:10:12,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:10:12,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689865580] [2023-08-30 23:10:12,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:10:12,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:10:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:10:13,242 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:10:13,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:10:13,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689865580] [2023-08-30 23:10:13,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689865580] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:10:13,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:10:13,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:10:13,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532205725] [2023-08-30 23:10:13,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:10:13,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:10:13,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:10:13,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:10:13,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:10:13,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 241 [2023-08-30 23:10:13,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have 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:10:13,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:10:13,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 241 [2023-08-30 23:10:13,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:10:14,288 INFO L130 PetriNetUnfolder]: 4903/7131 cut-off events. [2023-08-30 23:10:14,288 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2023-08-30 23:10:14,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13979 conditions, 7131 events. 4903/7131 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 41983 event pairs, 895 based on Foata normal form. 0/6791 useless extension candidates. Maximal degree in co-relation 13967. Up to 5335 conditions per place. [2023-08-30 23:10:14,341 INFO L137 encePairwiseOnDemand]: 237/241 looper letters, 41 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2023-08-30 23:10:14,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 209 flow [2023-08-30 23:10:14,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:10:14,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:10:14,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2023-08-30 23:10:14,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5435684647302904 [2023-08-30 23:10:14,361 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 393 transitions. [2023-08-30 23:10:14,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 393 transitions. [2023-08-30 23:10:14,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:10:14,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 393 transitions. [2023-08-30 23:10:14,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have 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:10:14,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have 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:10:14,375 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have 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:10:14,377 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 393 transitions. [2023-08-30 23:10:14,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 209 flow [2023-08-30 23:10:14,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 202 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 23:10:14,383 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-08-30 23:10:14,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-08-30 23:10:14,388 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-08-30 23:10:14,389 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-08-30 23:10:14,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have 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:10:14,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:10:14,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:10:14,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 23:10:14,390 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:10:14,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:10:14,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1011822437, now seen corresponding path program 1 times [2023-08-30 23:10:14,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:10:14,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436072299] [2023-08-30 23:10:14,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:10:14,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:10:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:10:14,744 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:10:14,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:10:14,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436072299] [2023-08-30 23:10:14,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436072299] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:10:14,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:10:14,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:10:14,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318987827] [2023-08-30 23:10:14,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:10:14,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:10:14,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:10:14,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:10:14,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:10:14,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 241 [2023-08-30 23:10:14,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have 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:10:14,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:10:14,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 241 [2023-08-30 23:10:14,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:10:16,811 INFO L130 PetriNetUnfolder]: 14423/19622 cut-off events. [2023-08-30 23:10:16,811 INFO L131 PetriNetUnfolder]: For 1011/1011 co-relation queries the response was YES. [2023-08-30 23:10:16,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40728 conditions, 19622 events. 14423/19622 cut-off events. For 1011/1011 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 101399 event pairs, 5141 based on Foata normal form. 458/20080 useless extension candidates. Maximal degree in co-relation 40718. Up to 13627 conditions per place. [2023-08-30 23:10:16,937 INFO L137 encePairwiseOnDemand]: 233/241 looper letters, 46 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2023-08-30 23:10:16,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 232 flow [2023-08-30 23:10:16,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:10:16,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:10:16,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2023-08-30 23:10:16,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5145228215767634 [2023-08-30 23:10:16,941 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2023-08-30 23:10:16,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2023-08-30 23:10:16,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:10:16,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2023-08-30 23:10:16,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have 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:10:16,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have 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:10:16,947 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have 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:10:16,947 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 372 transitions. [2023-08-30 23:10:16,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 232 flow [2023-08-30 23:10:16,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 53 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:10:16,949 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 118 flow [2023-08-30 23:10:16,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-08-30 23:10:16,950 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2023-08-30 23:10:16,951 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 118 flow [2023-08-30 23:10:16,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have 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:10:16,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:10:16,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:10:16,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 23:10:16,952 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:10:16,955 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:10:16,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1301725907, now seen corresponding path program 1 times [2023-08-30 23:10:16,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:10:16,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809903306] [2023-08-30 23:10:16,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:10:16,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:10:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:10:17,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:10:17,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:10:17,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809903306] [2023-08-30 23:10:17,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809903306] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:10:17,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:10:17,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:10:17,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870032209] [2023-08-30 23:10:17,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:10:17,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:10:17,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:10:17,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:10:17,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:10:17,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 241 [2023-08-30 23:10:17,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have 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:10:17,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:10:17,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 241 [2023-08-30 23:10:17,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:10:18,832 INFO L130 PetriNetUnfolder]: 10516/14819 cut-off events. [2023-08-30 23:10:18,833 INFO L131 PetriNetUnfolder]: For 3592/3662 co-relation queries the response was YES. [2023-08-30 23:10:18,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34108 conditions, 14819 events. 10516/14819 cut-off events. For 3592/3662 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 81381 event pairs, 3566 based on Foata normal form. 202/14807 useless extension candidates. Maximal degree in co-relation 34096. Up to 10028 conditions per place. [2023-08-30 23:10:18,942 INFO L137 encePairwiseOnDemand]: 238/241 looper letters, 37 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2023-08-30 23:10:18,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 228 flow [2023-08-30 23:10:18,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:10:18,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:10:18,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2023-08-30 23:10:18,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5242047026279392 [2023-08-30 23:10:18,944 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2023-08-30 23:10:18,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2023-08-30 23:10:18,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:10:18,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2023-08-30 23:10:18,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have 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:10:18,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have 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:10:18,948 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have 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:10:18,948 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 118 flow. Second operand 3 states and 379 transitions. [2023-08-30 23:10:18,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 228 flow [2023-08-30 23:10:18,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 46 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:10:18,972 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 115 flow [2023-08-30 23:10:18,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2023-08-30 23:10:18,973 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -1 predicate places. [2023-08-30 23:10:18,973 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 115 flow [2023-08-30 23:10:18,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have 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:10:18,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:10:18,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:10:18,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 23:10:18,974 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:10:18,975 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:10:18,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1732554692, now seen corresponding path program 1 times [2023-08-30 23:10:18,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:10:18,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817985748] [2023-08-30 23:10:18,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:10:18,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:10:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:10:19,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:10:19,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:10:19,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817985748] [2023-08-30 23:10:19,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817985748] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:10:19,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:10:19,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:10:19,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332577143] [2023-08-30 23:10:19,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:10:19,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:10:19,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:10:19,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:10:19,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:10:19,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 241 [2023-08-30 23:10:19,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have 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:10:19,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:10:19,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 241 [2023-08-30 23:10:19,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:10:20,632 INFO L130 PetriNetUnfolder]: 13066/17797 cut-off events. [2023-08-30 23:10:20,632 INFO L131 PetriNetUnfolder]: For 4039/4039 co-relation queries the response was YES. [2023-08-30 23:10:20,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42800 conditions, 17797 events. 13066/17797 cut-off events. For 4039/4039 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 91338 event pairs, 1897 based on Foata normal form. 40/17837 useless extension candidates. Maximal degree in co-relation 42787. Up to 11755 conditions per place. [2023-08-30 23:10:20,723 INFO L137 encePairwiseOnDemand]: 233/241 looper letters, 60 selfloop transitions, 11 changer transitions 0/71 dead transitions. [2023-08-30 23:10:20,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 71 transitions, 361 flow [2023-08-30 23:10:20,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:10:20,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:10:20,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2023-08-30 23:10:20,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5103734439834025 [2023-08-30 23:10:20,730 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 492 transitions. [2023-08-30 23:10:20,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 492 transitions. [2023-08-30 23:10:20,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:10:20,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 492 transitions. [2023-08-30 23:10:20,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have 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:10:20,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have 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:10:20,734 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have 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:10:20,734 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 115 flow. Second operand 4 states and 492 transitions. [2023-08-30 23:10:20,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 71 transitions, 361 flow [2023-08-30 23:10:20,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 71 transitions, 351 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:10:20,740 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 173 flow [2023-08-30 23:10:20,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2023-08-30 23:10:20,742 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-08-30 23:10:20,742 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 173 flow [2023-08-30 23:10:20,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have 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:10:20,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:10:20,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:10:20,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 23:10:20,743 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:10:20,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:10:20,743 INFO L85 PathProgramCache]: Analyzing trace with hash 2125427254, now seen corresponding path program 1 times [2023-08-30 23:10:20,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:10:20,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382187645] [2023-08-30 23:10:20,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:10:20,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:10:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:10:21,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:10:21,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:10:21,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382187645] [2023-08-30 23:10:21,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382187645] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:10:21,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:10:21,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:10:21,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641034211] [2023-08-30 23:10:21,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:10:21,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:10:21,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:10:21,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:10:21,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:10:21,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 241 [2023-08-30 23:10:21,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 173 flow. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have 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:10:21,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:10:21,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 241 [2023-08-30 23:10:21,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:10:22,503 INFO L130 PetriNetUnfolder]: 8218/12181 cut-off events. [2023-08-30 23:10:22,504 INFO L131 PetriNetUnfolder]: For 4745/5173 co-relation queries the response was YES. [2023-08-30 23:10:22,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29516 conditions, 12181 events. 8218/12181 cut-off events. For 4745/5173 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 75562 event pairs, 1579 based on Foata normal form. 1084/12959 useless extension candidates. Maximal degree in co-relation 29501. Up to 5128 conditions per place. [2023-08-30 23:10:22,595 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 61 selfloop transitions, 6 changer transitions 0/78 dead transitions. [2023-08-30 23:10:22,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 78 transitions, 433 flow [2023-08-30 23:10:22,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:10:22,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:10:22,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2023-08-30 23:10:22,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5134854771784232 [2023-08-30 23:10:22,602 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 495 transitions. [2023-08-30 23:10:22,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 495 transitions. [2023-08-30 23:10:22,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:10:22,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 495 transitions. [2023-08-30 23:10:22,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have 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:10:22,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have 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:10:22,612 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have 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:10:22,612 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 173 flow. Second operand 4 states and 495 transitions. [2023-08-30 23:10:22,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 78 transitions, 433 flow [2023-08-30 23:10:22,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 78 transitions, 433 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 23:10:22,625 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 219 flow [2023-08-30 23:10:22,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=219, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2023-08-30 23:10:22,628 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2023-08-30 23:10:22,628 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 219 flow [2023-08-30 23:10:22,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have 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:10:22,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:10:22,629 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:10:22,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 23:10:22,629 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:10:22,630 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:10:22,630 INFO L85 PathProgramCache]: Analyzing trace with hash -610326963, now seen corresponding path program 1 times [2023-08-30 23:10:22,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:10:22,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480269914] [2023-08-30 23:10:22,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:10:22,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:10:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:10:22,931 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:10:22,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:10:22,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480269914] [2023-08-30 23:10:22,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480269914] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:10:22,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:10:22,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:10:22,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503457549] [2023-08-30 23:10:22,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:10:22,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:10:22,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:10:22,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:10:22,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:10:22,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 241 [2023-08-30 23:10:22,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 219 flow. Second operand has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have 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:10:22,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:10:22,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 241 [2023-08-30 23:10:22,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:10:24,572 INFO L130 PetriNetUnfolder]: 14565/20664 cut-off events. [2023-08-30 23:10:24,572 INFO L131 PetriNetUnfolder]: For 19121/19121 co-relation queries the response was YES. [2023-08-30 23:10:24,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64115 conditions, 20664 events. 14565/20664 cut-off events. For 19121/19121 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 119601 event pairs, 776 based on Foata normal form. 204/20868 useless extension candidates. Maximal degree in co-relation 64096. Up to 9179 conditions per place. [2023-08-30 23:10:24,722 INFO L137 encePairwiseOnDemand]: 232/241 looper letters, 85 selfloop transitions, 23 changer transitions 4/112 dead transitions. [2023-08-30 23:10:24,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 112 transitions, 738 flow [2023-08-30 23:10:24,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:10:24,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:10:24,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2023-08-30 23:10:24,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4995850622406639 [2023-08-30 23:10:24,725 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 602 transitions. [2023-08-30 23:10:24,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 602 transitions. [2023-08-30 23:10:24,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:10:24,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 602 transitions. [2023-08-30 23:10:24,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have 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:10:24,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have 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:10:24,731 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have 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:10:24,731 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 219 flow. Second operand 5 states and 602 transitions. [2023-08-30 23:10:24,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 112 transitions, 738 flow [2023-08-30 23:10:24,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 112 transitions, 733 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 23:10:24,783 INFO L231 Difference]: Finished difference. Result has 56 places, 56 transitions, 385 flow [2023-08-30 23:10:24,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=385, PETRI_PLACES=56, PETRI_TRANSITIONS=56} [2023-08-30 23:10:24,786 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places. [2023-08-30 23:10:24,787 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 56 transitions, 385 flow [2023-08-30 23:10:24,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have 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:10:24,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:10:24,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:10:24,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 23:10:24,789 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:10:24,789 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:10:24,790 INFO L85 PathProgramCache]: Analyzing trace with hash -787217133, now seen corresponding path program 1 times [2023-08-30 23:10:24,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:10:24,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151881841] [2023-08-30 23:10:24,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:10:24,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:10:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:10:25,002 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:10:25,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:10:25,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151881841] [2023-08-30 23:10:25,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151881841] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:10:25,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:10:25,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:10:25,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597712645] [2023-08-30 23:10:25,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:10:25,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:10:25,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:10:25,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:10:25,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:10:25,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 241 [2023-08-30 23:10:25,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 56 transitions, 385 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have 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:10:25,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:10:25,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 241 [2023-08-30 23:10:25,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:10:26,345 INFO L130 PetriNetUnfolder]: 11045/16620 cut-off events. [2023-08-30 23:10:26,345 INFO L131 PetriNetUnfolder]: For 24249/25302 co-relation queries the response was YES. [2023-08-30 23:10:26,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53098 conditions, 16620 events. 11045/16620 cut-off events. For 24249/25302 co-relation queries the response was YES. Maximal size of possible extension queue 780. Compared 107006 event pairs, 4607 based on Foata normal form. 302/16647 useless extension candidates. Maximal degree in co-relation 53075. Up to 8362 conditions per place. [2023-08-30 23:10:26,454 INFO L137 encePairwiseOnDemand]: 238/241 looper letters, 55 selfloop transitions, 8 changer transitions 3/79 dead transitions. [2023-08-30 23:10:26,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 79 transitions, 612 flow [2023-08-30 23:10:26,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:10:26,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:10:26,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2023-08-30 23:10:26,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5297372060857538 [2023-08-30 23:10:26,457 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 383 transitions. [2023-08-30 23:10:26,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 383 transitions. [2023-08-30 23:10:26,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:10:26,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 383 transitions. [2023-08-30 23:10:26,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have 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:10:26,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have 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:10:26,460 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have 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:10:26,460 INFO L175 Difference]: Start difference. First operand has 56 places, 56 transitions, 385 flow. Second operand 3 states and 383 transitions. [2023-08-30 23:10:26,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 79 transitions, 612 flow [2023-08-30 23:10:26,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 79 transitions, 598 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-30 23:10:26,517 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 384 flow [2023-08-30 23:10:26,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2023-08-30 23:10:26,518 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 15 predicate places. [2023-08-30 23:10:26,518 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 384 flow [2023-08-30 23:10:26,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have 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:10:26,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:10:26,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:10:26,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 23:10:26,519 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:10:26,519 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:10:26,519 INFO L85 PathProgramCache]: Analyzing trace with hash 441616047, now seen corresponding path program 1 times [2023-08-30 23:10:26,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:10:26,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43613716] [2023-08-30 23:10:26,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:10:26,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:10:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:10:26,860 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:10:26,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:10:26,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43613716] [2023-08-30 23:10:26,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43613716] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:10:26,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:10:26,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:10:26,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667638263] [2023-08-30 23:10:26,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:10:26,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:10:26,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:10:26,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:10:26,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:10:26,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 241 [2023-08-30 23:10:26,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 384 flow. Second operand has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have 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:10:26,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:10:26,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 241 [2023-08-30 23:10:26,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:10:28,107 INFO L130 PetriNetUnfolder]: 6715/10629 cut-off events. [2023-08-30 23:10:28,108 INFO L131 PetriNetUnfolder]: For 12249/13192 co-relation queries the response was YES. [2023-08-30 23:10:28,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31995 conditions, 10629 events. 6715/10629 cut-off events. For 12249/13192 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 71123 event pairs, 775 based on Foata normal form. 1256/11702 useless extension candidates. Maximal degree in co-relation 31971. Up to 3882 conditions per place. [2023-08-30 23:10:28,166 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 90 selfloop transitions, 10 changer transitions 0/118 dead transitions. [2023-08-30 23:10:28,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 118 transitions, 922 flow [2023-08-30 23:10:28,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:10:28,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:10:28,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 621 transitions. [2023-08-30 23:10:28,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5153526970954356 [2023-08-30 23:10:28,169 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 621 transitions. [2023-08-30 23:10:28,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 621 transitions. [2023-08-30 23:10:28,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:10:28,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 621 transitions. [2023-08-30 23:10:28,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have 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:10:28,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have 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:10:28,174 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have 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:10:28,174 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 384 flow. Second operand 5 states and 621 transitions. [2023-08-30 23:10:28,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 118 transitions, 922 flow [2023-08-30 23:10:28,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 118 transitions, 882 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-30 23:10:28,187 INFO L231 Difference]: Finished difference. Result has 62 places, 59 transitions, 431 flow [2023-08-30 23:10:28,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=431, PETRI_PLACES=62, PETRI_TRANSITIONS=59} [2023-08-30 23:10:28,188 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2023-08-30 23:10:28,188 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 431 flow [2023-08-30 23:10:28,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have 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:10:28,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:10:28,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:10:28,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 23:10:28,189 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:10:28,189 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:10:28,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1290047879, now seen corresponding path program 1 times [2023-08-30 23:10:28,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:10:28,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217089983] [2023-08-30 23:10:28,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:10:28,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:10:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:10:28,572 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:10:28,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:10:28,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217089983] [2023-08-30 23:10:28,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217089983] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:10:28,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:10:28,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:10:28,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842805053] [2023-08-30 23:10:28,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:10:28,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:10:28,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:10:28,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:10:28,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:10:28,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 241 [2023-08-30 23:10:28,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 431 flow. Second operand has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have 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:10:28,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:10:28,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 241 [2023-08-30 23:10:28,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:10:29,537 INFO L130 PetriNetUnfolder]: 5971/9488 cut-off events. [2023-08-30 23:10:29,537 INFO L131 PetriNetUnfolder]: For 16463/17267 co-relation queries the response was YES. [2023-08-30 23:10:29,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33321 conditions, 9488 events. 5971/9488 cut-off events. For 16463/17267 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 62900 event pairs, 753 based on Foata normal form. 603/9913 useless extension candidates. Maximal degree in co-relation 33295. Up to 3882 conditions per place. [2023-08-30 23:10:29,607 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 100 selfloop transitions, 14 changer transitions 2/134 dead transitions. [2023-08-30 23:10:29,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 134 transitions, 1043 flow [2023-08-30 23:10:29,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:10:29,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:10:29,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 746 transitions. [2023-08-30 23:10:29,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5159059474412172 [2023-08-30 23:10:29,609 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 746 transitions. [2023-08-30 23:10:29,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 746 transitions. [2023-08-30 23:10:29,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:10:29,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 746 transitions. [2023-08-30 23:10:29,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.33333333333333) internal successors, (746), 6 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have 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:10:29,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have 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:10:29,614 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have 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:10:29,614 INFO L175 Difference]: Start difference. First operand has 62 places, 59 transitions, 431 flow. Second operand 6 states and 746 transitions. [2023-08-30 23:10:29,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 134 transitions, 1043 flow [2023-08-30 23:10:29,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 134 transitions, 1016 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-30 23:10:29,634 INFO L231 Difference]: Finished difference. Result has 66 places, 64 transitions, 491 flow [2023-08-30 23:10:29,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=491, PETRI_PLACES=66, PETRI_TRANSITIONS=64} [2023-08-30 23:10:29,635 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2023-08-30 23:10:29,635 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 64 transitions, 491 flow [2023-08-30 23:10:29,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have 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:10:29,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:10:29,636 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] [2023-08-30 23:10:29,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 23:10:29,636 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:10:29,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:10:29,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1350606384, now seen corresponding path program 1 times [2023-08-30 23:10:29,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:10:29,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532303222] [2023-08-30 23:10:29,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:10:29,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:10:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:10:30,755 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:10:30,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:10:30,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532303222] [2023-08-30 23:10:30,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532303222] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:10:30,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:10:30,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:10:30,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409408109] [2023-08-30 23:10:30,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:10:30,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:10:30,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:10:30,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:10:30,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:10:30,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 241 [2023-08-30 23:10:30,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 64 transitions, 491 flow. Second operand has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have 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:10:30,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:10:30,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 241 [2023-08-30 23:10:30,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:10:32,549 INFO L130 PetriNetUnfolder]: 10581/16866 cut-off events. [2023-08-30 23:10:32,549 INFO L131 PetriNetUnfolder]: For 50929/52698 co-relation queries the response was YES. [2023-08-30 23:10:32,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65799 conditions, 16866 events. 10581/16866 cut-off events. For 50929/52698 co-relation queries the response was YES. Maximal size of possible extension queue 986. Compared 125668 event pairs, 734 based on Foata normal form. 372/17025 useless extension candidates. Maximal degree in co-relation 65772. Up to 4944 conditions per place. [2023-08-30 23:10:32,673 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 142 selfloop transitions, 7 changer transitions 56/223 dead transitions. [2023-08-30 23:10:32,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 223 transitions, 2050 flow [2023-08-30 23:10:32,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:10:32,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:10:32,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 881 transitions. [2023-08-30 23:10:32,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5222288085358625 [2023-08-30 23:10:32,676 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 881 transitions. [2023-08-30 23:10:32,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 881 transitions. [2023-08-30 23:10:32,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:10:32,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 881 transitions. [2023-08-30 23:10:32,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.85714285714286) internal successors, (881), 7 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have 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:10:32,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have 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:10:32,681 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have 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:10:32,682 INFO L175 Difference]: Start difference. First operand has 66 places, 64 transitions, 491 flow. Second operand 7 states and 881 transitions. [2023-08-30 23:10:32,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 223 transitions, 2050 flow [2023-08-30 23:10:33,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 223 transitions, 1888 flow, removed 44 selfloop flow, removed 3 redundant places. [2023-08-30 23:10:33,035 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 533 flow [2023-08-30 23:10:33,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=533, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2023-08-30 23:10:33,035 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places. [2023-08-30 23:10:33,035 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 533 flow [2023-08-30 23:10:33,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have 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:10:33,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:10:33,036 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] [2023-08-30 23:10:33,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 23:10:33,037 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:10:33,037 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:10:33,037 INFO L85 PathProgramCache]: Analyzing trace with hash 397964994, now seen corresponding path program 2 times [2023-08-30 23:10:33,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:10:33,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398099548] [2023-08-30 23:10:33,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:10:33,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:10:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:10:33,417 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:10:33,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:10:33,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398099548] [2023-08-30 23:10:33,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398099548] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:10:33,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:10:33,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 23:10:33,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857986539] [2023-08-30 23:10:33,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:10:33,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:10:33,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:10:33,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:10:33,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:10:33,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 241 [2023-08-30 23:10:33,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 533 flow. Second operand has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have 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:10:33,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:10:33,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 241 [2023-08-30 23:10:33,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:10:34,653 INFO L130 PetriNetUnfolder]: 7584/12343 cut-off events. [2023-08-30 23:10:34,654 INFO L131 PetriNetUnfolder]: For 30363/31222 co-relation queries the response was YES. [2023-08-30 23:10:34,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47948 conditions, 12343 events. 7584/12343 cut-off events. For 30363/31222 co-relation queries the response was YES. Maximal size of possible extension queue 764. Compared 89587 event pairs, 756 based on Foata normal form. 368/12493 useless extension candidates. Maximal degree in co-relation 47921. Up to 4904 conditions per place. [2023-08-30 23:10:34,725 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 83 selfloop transitions, 18 changer transitions 14/130 dead transitions. [2023-08-30 23:10:34,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 130 transitions, 1098 flow [2023-08-30 23:10:34,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:10:34,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:10:34,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 843 transitions. [2023-08-30 23:10:34,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4997036158861885 [2023-08-30 23:10:34,727 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 843 transitions. [2023-08-30 23:10:34,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 843 transitions. [2023-08-30 23:10:34,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:10:34,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 843 transitions. [2023-08-30 23:10:34,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.42857142857143) internal successors, (843), 7 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have 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:10:34,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have 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:10:34,733 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have 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:10:34,733 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 533 flow. Second operand 7 states and 843 transitions. [2023-08-30 23:10:34,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 130 transitions, 1098 flow [2023-08-30 23:10:35,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 130 transitions, 1067 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-08-30 23:10:35,132 INFO L231 Difference]: Finished difference. Result has 74 places, 63 transitions, 510 flow [2023-08-30 23:10:35,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=510, PETRI_PLACES=74, PETRI_TRANSITIONS=63} [2023-08-30 23:10:35,133 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 31 predicate places. [2023-08-30 23:10:35,133 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 63 transitions, 510 flow [2023-08-30 23:10:35,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have 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:10:35,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:10:35,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:10:35,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 23:10:35,134 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:10:35,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:10:35,134 INFO L85 PathProgramCache]: Analyzing trace with hash -724937577, now seen corresponding path program 1 times [2023-08-30 23:10:35,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:10:35,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270873105] [2023-08-30 23:10:35,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:10:35,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:10:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:10:36,082 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:10:36,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:10:36,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270873105] [2023-08-30 23:10:36,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270873105] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:10:36,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:10:36,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 23:10:36,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281692095] [2023-08-30 23:10:36,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:10:36,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 23:10:36,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:10:36,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 23:10:36,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-30 23:10:36,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 241 [2023-08-30 23:10:36,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 510 flow. Second operand has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have 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:10:36,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:10:36,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 241 [2023-08-30 23:10:36,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:10:36,998 INFO L130 PetriNetUnfolder]: 4180/6767 cut-off events. [2023-08-30 23:10:36,998 INFO L131 PetriNetUnfolder]: For 22934/23415 co-relation queries the response was YES. [2023-08-30 23:10:37,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28738 conditions, 6767 events. 4180/6767 cut-off events. For 22934/23415 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 43367 event pairs, 710 based on Foata normal form. 121/6779 useless extension candidates. Maximal degree in co-relation 28708. Up to 3137 conditions per place. [2023-08-30 23:10:37,034 INFO L137 encePairwiseOnDemand]: 235/241 looper letters, 97 selfloop transitions, 6 changer transitions 27/145 dead transitions. [2023-08-30 23:10:37,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 145 transitions, 1391 flow [2023-08-30 23:10:37,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:10:37,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:10:37,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 838 transitions. [2023-08-30 23:10:37,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4967397747480735 [2023-08-30 23:10:37,037 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 838 transitions. [2023-08-30 23:10:37,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 838 transitions. [2023-08-30 23:10:37,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:10:37,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 838 transitions. [2023-08-30 23:10:37,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have 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:10:37,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have 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:10:37,042 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have 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:10:37,042 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 510 flow. Second operand 7 states and 838 transitions. [2023-08-30 23:10:37,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 145 transitions, 1391 flow [2023-08-30 23:10:37,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 145 transitions, 1235 flow, removed 26 selfloop flow, removed 7 redundant places. [2023-08-30 23:10:37,188 INFO L231 Difference]: Finished difference. Result has 75 places, 63 transitions, 466 flow [2023-08-30 23:10:37,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=466, PETRI_PLACES=75, PETRI_TRANSITIONS=63} [2023-08-30 23:10:37,189 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places. [2023-08-30 23:10:37,189 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 63 transitions, 466 flow [2023-08-30 23:10:37,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have 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:10:37,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:10:37,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:10:37,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 23:10:37,190 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:10:37,191 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:10:37,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1169034971, now seen corresponding path program 2 times [2023-08-30 23:10:37,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:10:37,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613715958] [2023-08-30 23:10:37,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:10:37,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:10:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:10:37,510 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:10:37,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:10:37,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613715958] [2023-08-30 23:10:37,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613715958] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:10:37,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:10:37,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:10:37,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485914492] [2023-08-30 23:10:37,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:10:37,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:10:37,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:10:37,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:10:37,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:10:37,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 241 [2023-08-30 23:10:37,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 63 transitions, 466 flow. Second operand has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have 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:10:37,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:10:37,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 241 [2023-08-30 23:10:37,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:10:38,521 INFO L130 PetriNetUnfolder]: 7007/10772 cut-off events. [2023-08-30 23:10:38,522 INFO L131 PetriNetUnfolder]: For 33940/33940 co-relation queries the response was YES. [2023-08-30 23:10:38,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43860 conditions, 10772 events. 7007/10772 cut-off events. For 33940/33940 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 64455 event pairs, 1967 based on Foata normal form. 1/10773 useless extension candidates. Maximal degree in co-relation 43837. Up to 5488 conditions per place. [2023-08-30 23:10:38,566 INFO L137 encePairwiseOnDemand]: 233/241 looper letters, 63 selfloop transitions, 10 changer transitions 88/161 dead transitions. [2023-08-30 23:10:38,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 161 transitions, 1423 flow [2023-08-30 23:10:38,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:10:38,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:10:38,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 716 transitions. [2023-08-30 23:10:38,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4951590594744122 [2023-08-30 23:10:38,569 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 716 transitions. [2023-08-30 23:10:38,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 716 transitions. [2023-08-30 23:10:38,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:10:38,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 716 transitions. [2023-08-30 23:10:38,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.33333333333333) internal successors, (716), 6 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have 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:10:38,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have 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:10:38,573 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have 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:10:38,573 INFO L175 Difference]: Start difference. First operand has 75 places, 63 transitions, 466 flow. Second operand 6 states and 716 transitions. [2023-08-30 23:10:38,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 161 transitions, 1423 flow [2023-08-30 23:10:38,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 161 transitions, 1377 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-08-30 23:10:38,798 INFO L231 Difference]: Finished difference. Result has 75 places, 53 transitions, 383 flow [2023-08-30 23:10:38,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=383, PETRI_PLACES=75, PETRI_TRANSITIONS=53} [2023-08-30 23:10:38,799 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places. [2023-08-30 23:10:38,799 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 53 transitions, 383 flow [2023-08-30 23:10:38,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have 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:10:38,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:10:38,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:10:38,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 23:10:38,800 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:10:38,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:10:38,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1650386525, now seen corresponding path program 3 times [2023-08-30 23:10:38,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:10:38,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984845475] [2023-08-30 23:10:38,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:10:38,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:10:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:10:38,844 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 23:10:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:10:38,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 23:10:38,912 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 23:10:38,913 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-30 23:10:38,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-30 23:10:38,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-30 23:10:38,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-30 23:10:38,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-30 23:10:38,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-30 23:10:38,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-30 23:10:38,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 23:10:38,916 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:10:38,922 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 23:10:38,923 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 23:10:39,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 11:10:39 BasicIcfg [2023-08-30 23:10:39,038 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 23:10:39,039 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 23:10:39,039 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 23:10:39,039 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 23:10:39,039 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:10:08" (3/4) ... [2023-08-30 23:10:39,041 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 23:10:39,134 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 23:10:39,134 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 23:10:39,135 INFO L158 Benchmark]: Toolchain (without parser) took 32116.26ms. Allocated memory was 67.1MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 43.0MB in the beginning and 2.3GB in the end (delta: -2.3GB). Peak memory consumption was 883.0MB. Max. memory is 16.1GB. [2023-08-30 23:10:39,135 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 54.5MB. Free memory was 32.2MB in the beginning and 32.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 23:10:39,135 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.65ms. Allocated memory is still 67.1MB. Free memory was 42.8MB in the beginning and 37.5MB in the end (delta: 5.3MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2023-08-30 23:10:39,136 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.77ms. Allocated memory is still 67.1MB. Free memory was 37.5MB in the beginning and 34.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:10:39,136 INFO L158 Benchmark]: Boogie Preprocessor took 55.84ms. Allocated memory is still 67.1MB. Free memory was 34.9MB in the beginning and 32.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:10:39,136 INFO L158 Benchmark]: RCFGBuilder took 769.04ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 32.8MB in the beginning and 44.3MB in the end (delta: -11.5MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2023-08-30 23:10:39,137 INFO L158 Benchmark]: TraceAbstraction took 30625.71ms. Allocated memory was 81.8MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 43.4MB in the beginning and 2.3GB in the end (delta: -2.3GB). Peak memory consumption was 851.3MB. Max. memory is 16.1GB. [2023-08-30 23:10:39,137 INFO L158 Benchmark]: Witness Printer took 95.79ms. Allocated memory is still 3.2GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-30 23:10:39,139 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 54.5MB. Free memory was 32.2MB in the beginning and 32.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 495.65ms. Allocated memory is still 67.1MB. Free memory was 42.8MB in the beginning and 37.5MB in the end (delta: 5.3MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.77ms. Allocated memory is still 67.1MB. Free memory was 37.5MB in the beginning and 34.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.84ms. Allocated memory is still 67.1MB. Free memory was 34.9MB in the beginning and 32.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 769.04ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 32.8MB in the beginning and 44.3MB in the end (delta: -11.5MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. * TraceAbstraction took 30625.71ms. Allocated memory was 81.8MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 43.4MB in the beginning and 2.3GB in the end (delta: -2.3GB). Peak memory consumption was 851.3MB. Max. memory is 16.1GB. * Witness Printer took 95.79ms. Allocated memory is still 3.2GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 138 PlacesBefore, 43 PlacesAfterwards, 127 TransitionsBefore, 31 TransitionsAfterwards, 3164 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 110 TotalNumberOfCompositions, 9238 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3605, independent: 3360, independent conditional: 0, independent unconditional: 3360, dependent: 245, dependent conditional: 0, dependent unconditional: 245, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1694, independent: 1649, independent conditional: 0, independent unconditional: 1649, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3605, independent: 1711, independent conditional: 0, independent unconditional: 1711, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 1694, unknown conditional: 0, unknown unconditional: 1694] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 152, Positive conditional cache size: 0, Positive unconditional cache size: 152, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L866] 0 pthread_t t521; [L867] FCALL, FORK 0 pthread_create(&t521, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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(&t521, ((void *)0), P0, ((void *)0))=-3, t521={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t522; [L869] FCALL, FORK 0 pthread_create(&t522, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t522, ((void *)0), P1, ((void *)0))=-2, t521={5:0}, t522={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t523; [L871] FCALL, FORK 0 pthread_create(&t523, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t523, ((void *)0), P2, ((void *)0))=-1, t521={5:0}, t522={6:0}, t523={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] 0 pthread_t t524; [L873] FCALL, FORK 0 pthread_create(&t524, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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, pthread_create(&t524, ((void *)0), P3, ((void *)0))=0, t521={5:0}, t522={6:0}, t523={7:0}, t524={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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] [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=0] [L802] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L808] 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) [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] 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 [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] 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=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L822] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 a$flush_delayed = weak$$choice2 [L831] 4 a$mem_tmp = a [L832] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L833] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L834] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L835] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L836] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L838] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EBX = a [L840] 4 a = a$flush_delayed ? a$mem_tmp : a [L841] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z=1] [L768] 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) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 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 [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 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=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z=1] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L788] 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) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 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 [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=1, x=1, y=2, z=1] [L844] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L845] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L846] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L847] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L848] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=1, x=1, y=2, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=1, main$tmp_guard1=0, t521={5:0}, t522={6:0}, t523={7:0}, t524={3:0}, weak$$choice2=1, x=1, y=2, z=1] [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 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) [L880] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L881] 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 [L882] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L883] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=1, main$tmp_guard1=0, t521={5:0}, t522={6:0}, t523={7:0}, t524={3:0}, weak$$choice2=1, x=1, y=2, z=1] [L886] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, 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: 867]: 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: 871]: 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: 873]: 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: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 168 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 30.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 20.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 862 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 744 mSDsluCounter, 242 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 197 mSDsCounter, 137 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1682 IncrementalHoareTripleChecker+Invalid, 1819 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 137 mSolverCounterUnsat, 45 mSDtfsCounter, 1682 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=533occurred in iteration=10, InterpolantAutomatonStates: 63, 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.5s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 1838 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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:10:39,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE