./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix004.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --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/mix004.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 89021de777f0aa5756284679b7b3bd19ab661d8d626f08ad7f7db0bc955b507d --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 09:40:16,079 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:40:16,081 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:40:16,124 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:40:16,124 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:40:16,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:40:16,129 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:40:16,132 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:40:16,134 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:40:16,138 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:40:16,139 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:40:16,141 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:40:16,142 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:40:16,143 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:40:16,144 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:40:16,149 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:40:16,150 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:40:16,152 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:40:16,153 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:40:16,154 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:40:16,163 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:40:16,165 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:40:16,166 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:40:16,167 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:40:16,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:40:16,175 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:40:16,175 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:40:16,177 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:40:16,177 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:40:16,178 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:40:16,178 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:40:16,180 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:40:16,182 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:40:16,182 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:40:16,183 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:40:16,183 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:40:16,184 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:40:16,184 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:40:16,185 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:40:16,185 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:40:16,186 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:40:16,187 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 09:40:16,222 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:40:16,222 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:40:16,223 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:40:16,223 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:40:16,224 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:40:16,224 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:40:16,225 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:40:16,225 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:40:16,225 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:40:16,226 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:40:16,226 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:40:16,227 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:40:16,227 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:40:16,227 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:40:16,227 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:40:16,227 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:40:16,227 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:40:16,228 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:40:16,228 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:40:16,228 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:40:16,228 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:40:16,228 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:40:16,229 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:40:16,229 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:40:16,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:40:16,229 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:40:16,229 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:40:16,230 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:40:16,230 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:40:16,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:40:16,230 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:40:16,230 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:40:16,231 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:40:16,231 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:40:16,231 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:40:16,231 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 -> 89021de777f0aa5756284679b7b3bd19ab661d8d626f08ad7f7db0bc955b507d 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 -> BEFORE [2023-09-01 09:40:16,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:40:16,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:40:16,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:40:16,592 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:40:16,593 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:40:16,594 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix004.opt.i [2023-09-01 09:40:17,736 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:40:18,028 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:40:18,029 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix004.opt.i [2023-09-01 09:40:18,041 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98cc4123c/f732817e021d448e9c20241980af6080/FLAG327924b37 [2023-09-01 09:40:18,057 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98cc4123c/f732817e021d448e9c20241980af6080 [2023-09-01 09:40:18,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:40:18,061 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:40:18,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:40:18,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:40:18,066 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:40:18,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:40:18" (1/1) ... [2023-09-01 09:40:18,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a011ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:40:18, skipping insertion in model container [2023-09-01 09:40:18,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:40:18" (1/1) ... [2023-09-01 09:40:18,075 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:40:18,129 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:40:18,295 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/mix004.opt.i[944,957] [2023-09-01 09:40:18,517 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:40:18,535 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:40:18,548 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/mix004.opt.i[944,957] [2023-09-01 09:40:18,604 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:40:18,672 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:40:18,672 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:40:18,677 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:40:18,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:40:18 WrapperNode [2023-09-01 09:40:18,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:40:18,678 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:40:18,678 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:40:18,678 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:40:18,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:40:18" (1/1) ... [2023-09-01 09:40:18,702 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:40:18" (1/1) ... [2023-09-01 09:40:18,740 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 167 [2023-09-01 09:40:18,741 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:40:18,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:40:18,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:40:18,742 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:40:18,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:40:18" (1/1) ... [2023-09-01 09:40:18,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:40:18" (1/1) ... [2023-09-01 09:40:18,768 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:40:18" (1/1) ... [2023-09-01 09:40:18,772 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:40:18" (1/1) ... [2023-09-01 09:40:18,795 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:40:18" (1/1) ... [2023-09-01 09:40:18,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:40:18" (1/1) ... [2023-09-01 09:40:18,799 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:40:18" (1/1) ... [2023-09-01 09:40:18,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:40:18" (1/1) ... [2023-09-01 09:40:18,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:40:18,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:40:18,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:40:18,813 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:40:18,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:40:18" (1/1) ... [2023-09-01 09:40:18,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:40:18,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:40:18,842 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-09-01 09:40:18,846 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-09-01 09:40:18,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:40:18,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:40:18,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:40:18,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:40:18,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:40:18,871 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:40:18,871 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:40:18,871 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:40:18,872 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:40:18,872 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-09-01 09:40:18,872 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-09-01 09:40:18,872 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-09-01 09:40:18,872 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-09-01 09:40:18,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:40:18,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:40:18,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:40:18,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:40:18,874 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 09:40:19,091 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:40:19,093 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:40:19,512 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:40:19,621 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:40:19,621 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:40:19,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:40:19 BoogieIcfgContainer [2023-09-01 09:40:19,623 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:40:19,626 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:40:19,626 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:40:19,629 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:40:19,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:40:18" (1/3) ... [2023-09-01 09:40:19,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c373424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:40:19, skipping insertion in model container [2023-09-01 09:40:19,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:40:18" (2/3) ... [2023-09-01 09:40:19,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c373424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:40:19, skipping insertion in model container [2023-09-01 09:40:19,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:40:19" (3/3) ... [2023-09-01 09:40:19,631 INFO L112 eAbstractionObserver]: Analyzing ICFG mix004.opt.i [2023-09-01 09:40:19,638 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:40:19,646 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:40:19,646 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-01 09:40:19,647 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:40:19,711 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:40:19,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 282 flow [2023-09-01 09:40:19,818 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2023-09-01 09:40:19,818 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:40:19,824 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 68 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-09-01 09:40:19,824 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 282 flow [2023-09-01 09:40:19,833 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2023-09-01 09:40:19,837 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:40:19,849 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 266 flow [2023-09-01 09:40:19,851 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 266 flow [2023-09-01 09:40:19,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 266 flow [2023-09-01 09:40:19,882 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2023-09-01 09:40:19,883 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:40:19,885 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 68 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-09-01 09:40:19,888 INFO L119 LiptonReduction]: Number of co-enabled transitions 2836 [2023-09-01 09:40:23,809 INFO L134 LiptonReduction]: Checked pairs total: 6966 [2023-09-01 09:40:23,810 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-09-01 09:40:23,822 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:40:23,827 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;@15500bfc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:40:23,828 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-09-01 09:40:23,834 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2023-09-01 09:40:23,834 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:40:23,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:40:23,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:40:23,836 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:40:23,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:40:23,840 INFO L85 PathProgramCache]: Analyzing trace with hash 956559065, now seen corresponding path program 1 times [2023-09-01 09:40:23,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:40:23,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649276643] [2023-09-01 09:40:23,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:40:23,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:40:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:40:24,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:40:24,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:40:24,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649276643] [2023-09-01 09:40:24,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649276643] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:40:24,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:40:24,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:40:24,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618235936] [2023-09-01 09:40:24,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:40:24,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:40:24,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:40:24,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:40:24,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:40:24,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 241 [2023-09-01 09:40:24,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:24,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:40:24,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 241 [2023-09-01 09:40:24,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:40:24,894 INFO L130 PetriNetUnfolder]: 2594/3797 cut-off events. [2023-09-01 09:40:24,894 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2023-09-01 09:40:24,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7492 conditions, 3797 events. 2594/3797 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 20226 event pairs, 518 based on Foata normal form. 0/3604 useless extension candidates. Maximal degree in co-relation 7480. Up to 2797 conditions per place. [2023-09-01 09:40:24,921 INFO L137 encePairwiseOnDemand]: 237/241 looper letters, 30 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2023-09-01 09:40:24,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 156 flow [2023-09-01 09:40:24,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:40:24,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:40:24,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-09-01 09:40:24,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5366528354080221 [2023-09-01 09:40:24,934 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-09-01 09:40:24,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-09-01 09:40:24,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:40:24,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-09-01 09:40:24,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:24,945 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-09-01 09:40:24,946 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-09-01 09:40:24,947 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 388 transitions. [2023-09-01 09:40:24,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 156 flow [2023-09-01 09:40:24,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 152 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 09:40:24,952 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2023-09-01 09:40:24,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-09-01 09:40:24,956 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-09-01 09:40:24,956 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2023-09-01 09:40:24,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:24,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:40:24,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:40:24,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:40:24,957 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:40:24,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:40:24,958 INFO L85 PathProgramCache]: Analyzing trace with hash 130318247, now seen corresponding path program 1 times [2023-09-01 09:40:24,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:40:24,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106022069] [2023-09-01 09:40:24,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:40:24,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:40:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:40:25,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:40:25,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:40:25,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106022069] [2023-09-01 09:40:25,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106022069] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:40:25,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:40:25,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:40:25,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208282335] [2023-09-01 09:40:25,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:40:25,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:40:25,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:40:25,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:40:25,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:40:25,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 241 [2023-09-01 09:40:25,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:25,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:40:25,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 241 [2023-09-01 09:40:25,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:40:26,041 INFO L130 PetriNetUnfolder]: 5895/8000 cut-off events. [2023-09-01 09:40:26,042 INFO L131 PetriNetUnfolder]: For 304/304 co-relation queries the response was YES. [2023-09-01 09:40:26,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16518 conditions, 8000 events. 5895/8000 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 34925 event pairs, 2395 based on Foata normal form. 16/8016 useless extension candidates. Maximal degree in co-relation 16508. Up to 7809 conditions per place. [2023-09-01 09:40:26,086 INFO L137 encePairwiseOnDemand]: 235/241 looper letters, 37 selfloop transitions, 5 changer transitions 0/42 dead transitions. [2023-09-01 09:40:26,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 188 flow [2023-09-01 09:40:26,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:40:26,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:40:26,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-09-01 09:40:26,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076071922544951 [2023-09-01 09:40:26,089 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-09-01 09:40:26,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-09-01 09:40:26,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:40:26,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-09-01 09:40:26,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:26,092 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-09-01 09:40:26,093 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-09-01 09:40:26,093 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states and 367 transitions. [2023-09-01 09:40:26,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 188 flow [2023-09-01 09:40:26,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:40:26,121 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 93 flow [2023-09-01 09:40:26,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2023-09-01 09:40:26,122 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-09-01 09:40:26,122 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 93 flow [2023-09-01 09:40:26,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:26,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:40:26,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:40:26,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:40:26,123 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:40:26,124 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:40:26,124 INFO L85 PathProgramCache]: Analyzing trace with hash 2083893735, now seen corresponding path program 1 times [2023-09-01 09:40:26,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:40:26,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878304054] [2023-09-01 09:40:26,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:40:26,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:40:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:40:26,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:40:26,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:40:26,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878304054] [2023-09-01 09:40:26,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878304054] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:40:26,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:40:26,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:40:26,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646931980] [2023-09-01 09:40:26,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:40:26,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:40:26,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:40:26,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:40:26,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:40:26,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 241 [2023-09-01 09:40:26,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:26,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:40:26,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 241 [2023-09-01 09:40:26,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:40:27,187 INFO L130 PetriNetUnfolder]: 5319/7248 cut-off events. [2023-09-01 09:40:27,187 INFO L131 PetriNetUnfolder]: For 1347/1347 co-relation queries the response was YES. [2023-09-01 09:40:27,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16691 conditions, 7248 events. 5319/7248 cut-off events. For 1347/1347 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 32007 event pairs, 1779 based on Foata normal form. 176/7424 useless extension candidates. Maximal degree in co-relation 16680. Up to 4945 conditions per place. [2023-09-01 09:40:27,222 INFO L137 encePairwiseOnDemand]: 238/241 looper letters, 42 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2023-09-01 09:40:27,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 221 flow [2023-09-01 09:40:27,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:40:27,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:40:27,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2023-09-01 09:40:27,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5062240663900415 [2023-09-01 09:40:27,224 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2023-09-01 09:40:27,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2023-09-01 09:40:27,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:40:27,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2023-09-01 09:40:27,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:27,227 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-09-01 09:40:27,228 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-09-01 09:40:27,228 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 93 flow. Second operand 3 states and 366 transitions. [2023-09-01 09:40:27,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 221 flow [2023-09-01 09:40:27,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:40:27,230 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 99 flow [2023-09-01 09:40:27,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-09-01 09:40:27,231 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2023-09-01 09:40:27,231 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 99 flow [2023-09-01 09:40:27,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:27,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:40:27,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:40:27,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:40:27,232 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:40:27,232 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:40:27,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1772084970, now seen corresponding path program 1 times [2023-09-01 09:40:27,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:40:27,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427697786] [2023-09-01 09:40:27,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:40:27,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:40:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:40:27,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:40:27,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:40:27,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427697786] [2023-09-01 09:40:27,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427697786] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:40:27,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:40:27,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:40:27,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389004025] [2023-09-01 09:40:27,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:40:27,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:40:27,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:40:27,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:40:27,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:40:27,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 241 [2023-09-01 09:40:27,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:27,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:40:27,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 241 [2023-09-01 09:40:27,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:40:28,035 INFO L130 PetriNetUnfolder]: 5015/6848 cut-off events. [2023-09-01 09:40:28,035 INFO L131 PetriNetUnfolder]: For 2287/2287 co-relation queries the response was YES. [2023-09-01 09:40:28,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16403 conditions, 6848 events. 5015/6848 cut-off events. For 2287/2287 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 28956 event pairs, 1571 based on Foata normal form. 96/6944 useless extension candidates. Maximal degree in co-relation 16390. Up to 4561 conditions per place. [2023-09-01 09:40:28,075 INFO L137 encePairwiseOnDemand]: 238/241 looper letters, 39 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2023-09-01 09:40:28,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 42 transitions, 216 flow [2023-09-01 09:40:28,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:40:28,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:40:28,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2023-09-01 09:40:28,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020746887966805 [2023-09-01 09:40:28,082 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2023-09-01 09:40:28,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2023-09-01 09:40:28,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:40:28,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2023-09-01 09:40:28,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:28,085 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-09-01 09:40:28,085 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-09-01 09:40:28,085 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 99 flow. Second operand 3 states and 363 transitions. [2023-09-01 09:40:28,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 42 transitions, 216 flow [2023-09-01 09:40:28,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:40:28,090 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 104 flow [2023-09-01 09:40:28,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2023-09-01 09:40:28,092 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2023-09-01 09:40:28,092 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 104 flow [2023-09-01 09:40:28,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:28,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:40:28,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:40:28,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:40:28,093 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:40:28,094 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:40:28,094 INFO L85 PathProgramCache]: Analyzing trace with hash -114956155, now seen corresponding path program 1 times [2023-09-01 09:40:28,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:40:28,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260474329] [2023-09-01 09:40:28,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:40:28,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:40:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:40:28,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:40:28,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:40:28,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260474329] [2023-09-01 09:40:28,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260474329] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:40:28,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:40:28,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:40:28,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578138908] [2023-09-01 09:40:28,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:40:28,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:40:28,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:40:28,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:40:28,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:40:28,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 241 [2023-09-01 09:40:28,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:28,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:40:28,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 241 [2023-09-01 09:40:28,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:40:29,027 INFO L130 PetriNetUnfolder]: 2746/4177 cut-off events. [2023-09-01 09:40:29,027 INFO L131 PetriNetUnfolder]: For 1074/1121 co-relation queries the response was YES. [2023-09-01 09:40:29,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9604 conditions, 4177 events. 2746/4177 cut-off events. For 1074/1121 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 23423 event pairs, 458 based on Foata normal form. 317/4354 useless extension candidates. Maximal degree in co-relation 9590. Up to 1830 conditions per place. [2023-09-01 09:40:29,044 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 46 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2023-09-01 09:40:29,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 59 transitions, 282 flow [2023-09-01 09:40:29,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:40:29,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:40:29,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 497 transitions. [2023-09-01 09:40:29,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5155601659751037 [2023-09-01 09:40:29,047 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 497 transitions. [2023-09-01 09:40:29,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 497 transitions. [2023-09-01 09:40:29,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:40:29,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 497 transitions. [2023-09-01 09:40:29,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:29,050 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-09-01 09:40:29,051 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-09-01 09:40:29,051 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 104 flow. Second operand 4 states and 497 transitions. [2023-09-01 09:40:29,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 59 transitions, 282 flow [2023-09-01 09:40:29,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 59 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:40:29,054 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 144 flow [2023-09-01 09:40:29,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2023-09-01 09:40:29,056 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2023-09-01 09:40:29,057 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 144 flow [2023-09-01 09:40:29,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:29,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:40:29,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:40:29,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:40:29,058 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:40:29,058 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:40:29,058 INFO L85 PathProgramCache]: Analyzing trace with hash -488720069, now seen corresponding path program 1 times [2023-09-01 09:40:29,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:40:29,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021500428] [2023-09-01 09:40:29,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:40:29,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:40:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:40:29,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:40:29,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:40:29,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021500428] [2023-09-01 09:40:29,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021500428] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:40:29,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:40:29,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:40:29,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048751374] [2023-09-01 09:40:29,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:40:29,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:40:29,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:40:29,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:40:29,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:40:29,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 241 [2023-09-01 09:40:29,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:29,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:40:29,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 241 [2023-09-01 09:40:29,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:40:29,804 INFO L130 PetriNetUnfolder]: 2218/3533 cut-off events. [2023-09-01 09:40:29,804 INFO L131 PetriNetUnfolder]: For 1579/1630 co-relation queries the response was YES. [2023-09-01 09:40:29,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9868 conditions, 3533 events. 2218/3533 cut-off events. For 1579/1630 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 20376 event pairs, 428 based on Foata normal form. 243/3652 useless extension candidates. Maximal degree in co-relation 9852. Up to 1265 conditions per place. [2023-09-01 09:40:29,823 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 58 selfloop transitions, 10 changer transitions 0/75 dead transitions. [2023-09-01 09:40:29,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 75 transitions, 398 flow [2023-09-01 09:40:29,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:40:29,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:40:29,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 624 transitions. [2023-09-01 09:40:29,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5178423236514523 [2023-09-01 09:40:29,826 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 624 transitions. [2023-09-01 09:40:29,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 624 transitions. [2023-09-01 09:40:29,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:40:29,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 624 transitions. [2023-09-01 09:40:29,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:29,830 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-09-01 09:40:29,831 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-09-01 09:40:29,831 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 144 flow. Second operand 5 states and 624 transitions. [2023-09-01 09:40:29,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 75 transitions, 398 flow [2023-09-01 09:40:29,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 75 transitions, 395 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:40:29,835 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 209 flow [2023-09-01 09:40:29,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=209, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-09-01 09:40:29,835 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2023-09-01 09:40:29,836 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 209 flow [2023-09-01 09:40:29,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:29,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:40:29,836 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] [2023-09-01 09:40:29,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:40:29,837 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:40:29,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:40:29,837 INFO L85 PathProgramCache]: Analyzing trace with hash -990181233, now seen corresponding path program 1 times [2023-09-01 09:40:29,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:40:29,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453205431] [2023-09-01 09:40:29,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:40:29,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:40:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:40:30,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:40:30,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:40:30,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453205431] [2023-09-01 09:40:30,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453205431] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:40:30,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:40:30,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:40:30,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36415263] [2023-09-01 09:40:30,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:40:30,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:40:30,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:40:30,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:40:30,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:40:30,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 241 [2023-09-01 09:40:30,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 209 flow. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:30,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:40:30,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 241 [2023-09-01 09:40:30,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:40:30,713 INFO L130 PetriNetUnfolder]: 5208/7663 cut-off events. [2023-09-01 09:40:30,713 INFO L131 PetriNetUnfolder]: For 12575/12575 co-relation queries the response was YES. [2023-09-01 09:40:30,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25894 conditions, 7663 events. 5208/7663 cut-off events. For 12575/12575 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 41046 event pairs, 272 based on Foata normal form. 39/7702 useless extension candidates. Maximal degree in co-relation 25875. Up to 4999 conditions per place. [2023-09-01 09:40:30,757 INFO L137 encePairwiseOnDemand]: 232/241 looper letters, 82 selfloop transitions, 15 changer transitions 7/104 dead transitions. [2023-09-01 09:40:30,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 104 transitions, 736 flow [2023-09-01 09:40:30,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:40:30,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:40:30,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2023-09-01 09:40:30,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5012448132780083 [2023-09-01 09:40:30,760 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 604 transitions. [2023-09-01 09:40:30,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 604 transitions. [2023-09-01 09:40:30,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:40:30,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 604 transitions. [2023-09-01 09:40:30,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:30,763 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-09-01 09:40:30,764 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-09-01 09:40:30,764 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 209 flow. Second operand 5 states and 604 transitions. [2023-09-01 09:40:30,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 104 transitions, 736 flow [2023-09-01 09:40:30,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 104 transitions, 698 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-09-01 09:40:30,778 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 292 flow [2023-09-01 09:40:30,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=292, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2023-09-01 09:40:30,779 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2023-09-01 09:40:30,779 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 292 flow [2023-09-01 09:40:30,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:30,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:40:30,780 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-09-01 09:40:30,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:40:30,780 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:40:30,780 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:40:30,780 INFO L85 PathProgramCache]: Analyzing trace with hash -2015369401, now seen corresponding path program 1 times [2023-09-01 09:40:30,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:40:30,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355928346] [2023-09-01 09:40:30,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:40:30,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:40:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:40:31,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:40:31,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:40:31,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355928346] [2023-09-01 09:40:31,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355928346] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:40:31,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:40:31,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:40:31,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944804251] [2023-09-01 09:40:31,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:40:31,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:40:31,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:40:31,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:40:31,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:40:31,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 241 [2023-09-01 09:40:31,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 292 flow. Second operand has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:31,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:40:31,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 241 [2023-09-01 09:40:31,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:40:31,415 INFO L130 PetriNetUnfolder]: 1482/2449 cut-off events. [2023-09-01 09:40:31,415 INFO L131 PetriNetUnfolder]: For 4011/4240 co-relation queries the response was YES. [2023-09-01 09:40:31,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8606 conditions, 2449 events. 1482/2449 cut-off events. For 4011/4240 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 13451 event pairs, 221 based on Foata normal form. 233/2594 useless extension candidates. Maximal degree in co-relation 8584. Up to 765 conditions per place. [2023-09-01 09:40:31,431 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 78 selfloop transitions, 14 changer transitions 0/105 dead transitions. [2023-09-01 09:40:31,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 105 transitions, 722 flow [2023-09-01 09:40:31,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:40:31,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:40:31,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 747 transitions. [2023-09-01 09:40:31,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.516597510373444 [2023-09-01 09:40:31,434 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 747 transitions. [2023-09-01 09:40:31,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 747 transitions. [2023-09-01 09:40:31,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:40:31,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 747 transitions. [2023-09-01 09:40:31,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.5) internal successors, (747), 6 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:31,438 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-09-01 09:40:31,439 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-09-01 09:40:31,439 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 292 flow. Second operand 6 states and 747 transitions. [2023-09-01 09:40:31,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 105 transitions, 722 flow [2023-09-01 09:40:31,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 105 transitions, 700 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-09-01 09:40:31,462 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 355 flow [2023-09-01 09:40:31,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=355, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2023-09-01 09:40:31,464 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2023-09-01 09:40:31,464 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 355 flow [2023-09-01 09:40:31,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:31,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:40:31,465 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] [2023-09-01 09:40:31,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:40:31,465 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:40:31,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:40:31,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1251549145, now seen corresponding path program 1 times [2023-09-01 09:40:31,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:40:31,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068110863] [2023-09-01 09:40:31,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:40:31,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:40:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:40:31,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:40:31,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:40:31,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068110863] [2023-09-01 09:40:31,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068110863] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:40:31,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:40:31,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:40:31,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455439245] [2023-09-01 09:40:31,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:40:31,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:40:31,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:40:31,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:40:31,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:40:31,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 241 [2023-09-01 09:40:31,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 355 flow. Second operand has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:31,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:40:31,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 241 [2023-09-01 09:40:31,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:40:32,187 INFO L130 PetriNetUnfolder]: 2321/3906 cut-off events. [2023-09-01 09:40:32,187 INFO L131 PetriNetUnfolder]: For 8788/8880 co-relation queries the response was YES. [2023-09-01 09:40:32,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15270 conditions, 3906 events. 2321/3906 cut-off events. For 8788/8880 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 23545 event pairs, 377 based on Foata normal form. 32/3879 useless extension candidates. Maximal degree in co-relation 15246. Up to 1885 conditions per place. [2023-09-01 09:40:32,205 INFO L137 encePairwiseOnDemand]: 238/241 looper letters, 69 selfloop transitions, 2 changer transitions 32/112 dead transitions. [2023-09-01 09:40:32,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 112 transitions, 952 flow [2023-09-01 09:40:32,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:40:32,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:40:32,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 512 transitions. [2023-09-01 09:40:32,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5311203319502075 [2023-09-01 09:40:32,208 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 512 transitions. [2023-09-01 09:40:32,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 512 transitions. [2023-09-01 09:40:32,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:40:32,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 512 transitions. [2023-09-01 09:40:32,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:32,211 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-09-01 09:40:32,211 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-09-01 09:40:32,212 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 355 flow. Second operand 4 states and 512 transitions. [2023-09-01 09:40:32,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 112 transitions, 952 flow [2023-09-01 09:40:32,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 112 transitions, 870 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-09-01 09:40:32,243 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 337 flow [2023-09-01 09:40:32,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=337, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2023-09-01 09:40:32,244 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2023-09-01 09:40:32,244 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 337 flow [2023-09-01 09:40:32,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:32,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:40:32,245 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-09-01 09:40:32,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:40:32,245 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:40:32,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:40:32,245 INFO L85 PathProgramCache]: Analyzing trace with hash -661049186, now seen corresponding path program 1 times [2023-09-01 09:40:32,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:40:32,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555022858] [2023-09-01 09:40:32,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:40:32,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:40:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:40:32,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:40:32,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:40:32,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555022858] [2023-09-01 09:40:32,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555022858] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:40:32,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:40:32,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:40:32,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170314683] [2023-09-01 09:40:32,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:40:32,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:40:32,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:40:32,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:40:32,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:40:32,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 241 [2023-09-01 09:40:32,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 337 flow. Second operand has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:32,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:40:32,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 241 [2023-09-01 09:40:32,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:40:33,098 INFO L130 PetriNetUnfolder]: 3878/6168 cut-off events. [2023-09-01 09:40:33,098 INFO L131 PetriNetUnfolder]: For 11837/11837 co-relation queries the response was YES. [2023-09-01 09:40:33,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24078 conditions, 6168 events. 3878/6168 cut-off events. For 11837/11837 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 35361 event pairs, 845 based on Foata normal form. 10/6178 useless extension candidates. Maximal degree in co-relation 24053. Up to 3805 conditions per place. [2023-09-01 09:40:33,121 INFO L137 encePairwiseOnDemand]: 233/241 looper letters, 89 selfloop transitions, 14 changer transitions 34/137 dead transitions. [2023-09-01 09:40:33,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 137 transitions, 1087 flow [2023-09-01 09:40:33,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:40:33,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:40:33,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 721 transitions. [2023-09-01 09:40:33,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49861687413554634 [2023-09-01 09:40:33,124 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 721 transitions. [2023-09-01 09:40:33,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 721 transitions. [2023-09-01 09:40:33,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:40:33,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 721 transitions. [2023-09-01 09:40:33,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.16666666666667) internal successors, (721), 6 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:33,129 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-09-01 09:40:33,129 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-09-01 09:40:33,129 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 337 flow. Second operand 6 states and 721 transitions. [2023-09-01 09:40:33,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 137 transitions, 1087 flow [2023-09-01 09:40:33,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 137 transitions, 1082 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:40:33,189 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 405 flow [2023-09-01 09:40:33,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=405, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2023-09-01 09:40:33,190 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places. [2023-09-01 09:40:33,190 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 405 flow [2023-09-01 09:40:33,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:33,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:40:33,191 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] [2023-09-01 09:40:33,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 09:40:33,191 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:40:33,191 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:40:33,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1568431443, now seen corresponding path program 2 times [2023-09-01 09:40:33,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:40:33,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127297617] [2023-09-01 09:40:33,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:40:33,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:40:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:40:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:40:33,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:40:33,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127297617] [2023-09-01 09:40:33,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127297617] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:40:33,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:40:33,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 09:40:33,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106984361] [2023-09-01 09:40:33,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:40:33,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:40:33,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:40:33,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:40:33,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:40:33,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 241 [2023-09-01 09:40:33,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 405 flow. Second operand has 7 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:33,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:40:33,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 241 [2023-09-01 09:40:33,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:40:33,897 INFO L130 PetriNetUnfolder]: 2148/3569 cut-off events. [2023-09-01 09:40:33,897 INFO L131 PetriNetUnfolder]: For 5933/6396 co-relation queries the response was YES. [2023-09-01 09:40:33,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13447 conditions, 3569 events. 2148/3569 cut-off events. For 5933/6396 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 22143 event pairs, 279 based on Foata normal form. 295/3691 useless extension candidates. Maximal degree in co-relation 13419. Up to 1231 conditions per place. [2023-09-01 09:40:33,911 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 36 selfloop transitions, 18 changer transitions 36/97 dead transitions. [2023-09-01 09:40:33,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 97 transitions, 742 flow [2023-09-01 09:40:33,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:40:33,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:40:33,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 847 transitions. [2023-09-01 09:40:33,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020746887966805 [2023-09-01 09:40:33,914 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 847 transitions. [2023-09-01 09:40:33,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 847 transitions. [2023-09-01 09:40:33,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:40:33,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 847 transitions. [2023-09-01 09:40:33,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:33,920 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-09-01 09:40:33,920 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-09-01 09:40:33,920 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 405 flow. Second operand 7 states and 847 transitions. [2023-09-01 09:40:33,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 97 transitions, 742 flow [2023-09-01 09:40:34,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 97 transitions, 693 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-09-01 09:40:34,012 INFO L231 Difference]: Finished difference. Result has 69 places, 46 transitions, 317 flow [2023-09-01 09:40:34,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=317, PETRI_PLACES=69, PETRI_TRANSITIONS=46} [2023-09-01 09:40:34,012 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 28 predicate places. [2023-09-01 09:40:34,013 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 46 transitions, 317 flow [2023-09-01 09:40:34,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:34,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:40:34,013 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] [2023-09-01 09:40:34,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 09:40:34,014 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:40:34,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:40:34,014 INFO L85 PathProgramCache]: Analyzing trace with hash -951210749, now seen corresponding path program 1 times [2023-09-01 09:40:34,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:40:34,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957079136] [2023-09-01 09:40:34,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:40:34,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:40:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:40:34,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:40:34,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:40:34,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957079136] [2023-09-01 09:40:34,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957079136] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:40:34,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:40:34,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:40:34,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764732468] [2023-09-01 09:40:34,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:40:34,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:40:34,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:40:34,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:40:34,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:40:34,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 241 [2023-09-01 09:40:34,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 46 transitions, 317 flow. Second operand has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:34,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:40:34,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 241 [2023-09-01 09:40:34,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:40:34,515 INFO L130 PetriNetUnfolder]: 1167/1995 cut-off events. [2023-09-01 09:40:34,515 INFO L131 PetriNetUnfolder]: For 4534/4560 co-relation queries the response was YES. [2023-09-01 09:40:34,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7839 conditions, 1995 events. 1167/1995 cut-off events. For 4534/4560 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 10913 event pairs, 239 based on Foata normal form. 10/1948 useless extension candidates. Maximal degree in co-relation 7816. Up to 983 conditions per place. [2023-09-01 09:40:34,521 INFO L137 encePairwiseOnDemand]: 238/241 looper letters, 44 selfloop transitions, 1 changer transitions 40/88 dead transitions. [2023-09-01 09:40:34,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 88 transitions, 771 flow [2023-09-01 09:40:34,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:40:34,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:40:34,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 505 transitions. [2023-09-01 09:40:34,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238589211618258 [2023-09-01 09:40:34,523 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 505 transitions. [2023-09-01 09:40:34,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 505 transitions. [2023-09-01 09:40:34,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:40:34,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 505 transitions. [2023-09-01 09:40:34,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:34,527 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-09-01 09:40:34,527 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-09-01 09:40:34,527 INFO L175 Difference]: Start difference. First operand has 69 places, 46 transitions, 317 flow. Second operand 4 states and 505 transitions. [2023-09-01 09:40:34,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 88 transitions, 771 flow [2023-09-01 09:40:34,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 88 transitions, 657 flow, removed 26 selfloop flow, removed 7 redundant places. [2023-09-01 09:40:34,549 INFO L231 Difference]: Finished difference. Result has 63 places, 38 transitions, 211 flow [2023-09-01 09:40:34,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=63, PETRI_TRANSITIONS=38} [2023-09-01 09:40:34,550 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2023-09-01 09:40:34,550 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 38 transitions, 211 flow [2023-09-01 09:40:34,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:34,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:40:34,551 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] [2023-09-01 09:40:34,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-09-01 09:40:34,551 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:40:34,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:40:34,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1119007949, now seen corresponding path program 2 times [2023-09-01 09:40:34,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:40:34,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959564543] [2023-09-01 09:40:34,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:40:34,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:40:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:40:35,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:40:35,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:40:35,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959564543] [2023-09-01 09:40:35,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959564543] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:40:35,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:40:35,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:40:35,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879346033] [2023-09-01 09:40:35,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:40:35,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:40:35,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:40:35,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:40:35,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:40:35,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 241 [2023-09-01 09:40:35,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 38 transitions, 211 flow. Second operand has 7 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:35,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:40:35,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 241 [2023-09-01 09:40:35,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:40:36,122 INFO L130 PetriNetUnfolder]: 431/785 cut-off events. [2023-09-01 09:40:36,123 INFO L131 PetriNetUnfolder]: For 1366/1385 co-relation queries the response was YES. [2023-09-01 09:40:36,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2799 conditions, 785 events. 431/785 cut-off events. For 1366/1385 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3921 event pairs, 89 based on Foata normal form. 1/749 useless extension candidates. Maximal degree in co-relation 2779. Up to 349 conditions per place. [2023-09-01 09:40:36,125 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 38 selfloop transitions, 5 changer transitions 26/73 dead transitions. [2023-09-01 09:40:36,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 73 transitions, 560 flow [2023-09-01 09:40:36,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 09:40:36,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 09:40:36,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 936 transitions. [2023-09-01 09:40:36,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4854771784232365 [2023-09-01 09:40:36,128 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 936 transitions. [2023-09-01 09:40:36,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 936 transitions. [2023-09-01 09:40:36,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:40:36,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 936 transitions. [2023-09-01 09:40:36,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:36,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 241.0) internal successors, (2169), 9 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:36,134 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 241.0) internal successors, (2169), 9 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:36,134 INFO L175 Difference]: Start difference. First operand has 63 places, 38 transitions, 211 flow. Second operand 8 states and 936 transitions. [2023-09-01 09:40:36,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 73 transitions, 560 flow [2023-09-01 09:40:36,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 73 transitions, 429 flow, removed 12 selfloop flow, removed 11 redundant places. [2023-09-01 09:40:36,142 INFO L231 Difference]: Finished difference. Result has 59 places, 38 transitions, 167 flow [2023-09-01 09:40:36,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=167, PETRI_PLACES=59, PETRI_TRANSITIONS=38} [2023-09-01 09:40:36,143 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2023-09-01 09:40:36,143 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 38 transitions, 167 flow [2023-09-01 09:40:36,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:40:36,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:40:36,144 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] [2023-09-01 09:40:36,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-09-01 09:40:36,144 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:40:36,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:40:36,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1396154401, now seen corresponding path program 3 times [2023-09-01 09:40:36,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:40:36,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495331880] [2023-09-01 09:40:36,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:40:36,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:40:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:40:36,220 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:40:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:40:36,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:40:36,315 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:40:36,315 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-09-01 09:40:36,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-09-01 09:40:36,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-09-01 09:40:36,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-09-01 09:40:36,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-09-01 09:40:36,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-09-01 09:40:36,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-09-01 09:40:36,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-09-01 09:40:36,320 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:40:36,326 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:40:36,326 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:40:36,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:40:36 BasicIcfg [2023-09-01 09:40:36,422 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:40:36,423 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:40:36,423 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:40:36,423 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:40:36,423 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:40:19" (3/4) ... [2023-09-01 09:40:36,425 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:40:36,517 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:40:36,517 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:40:36,517 INFO L158 Benchmark]: Toolchain (without parser) took 18456.52ms. Allocated memory was 79.7MB in the beginning and 920.6MB in the end (delta: 841.0MB). Free memory was 56.5MB in the beginning and 677.1MB in the end (delta: -620.6MB). Peak memory consumption was 222.5MB. Max. memory is 16.1GB. [2023-09-01 09:40:36,518 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 65.0MB. Free memory is still 43.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:40:36,518 INFO L158 Benchmark]: CACSL2BoogieTranslator took 614.15ms. Allocated memory is still 79.7MB. Free memory was 56.2MB in the beginning and 53.8MB in the end (delta: 2.4MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2023-09-01 09:40:36,518 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.08ms. Allocated memory is still 79.7MB. Free memory was 53.8MB in the beginning and 51.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:40:36,518 INFO L158 Benchmark]: Boogie Preprocessor took 70.72ms. Allocated memory is still 79.7MB. Free memory was 51.0MB in the beginning and 48.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:40:36,519 INFO L158 Benchmark]: RCFGBuilder took 810.45ms. Allocated memory is still 79.7MB. Free memory was 48.9MB in the beginning and 36.1MB in the end (delta: 12.7MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2023-09-01 09:40:36,521 INFO L158 Benchmark]: TraceAbstraction took 16796.58ms. Allocated memory was 79.7MB in the beginning and 920.6MB in the end (delta: 841.0MB). Free memory was 35.7MB in the beginning and 692.8MB in the end (delta: -657.1MB). Peak memory consumption was 182.2MB. Max. memory is 16.1GB. [2023-09-01 09:40:36,522 INFO L158 Benchmark]: Witness Printer took 94.17ms. Allocated memory is still 920.6MB. Free memory was 692.8MB in the beginning and 677.1MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-09-01 09:40:36,523 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 65.0MB. Free memory is still 43.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 614.15ms. Allocated memory is still 79.7MB. Free memory was 56.2MB in the beginning and 53.8MB in the end (delta: 2.4MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.08ms. Allocated memory is still 79.7MB. Free memory was 53.8MB in the beginning and 51.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.72ms. Allocated memory is still 79.7MB. Free memory was 51.0MB in the beginning and 48.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 810.45ms. Allocated memory is still 79.7MB. Free memory was 48.9MB in the beginning and 36.1MB in the end (delta: 12.7MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * TraceAbstraction took 16796.58ms. Allocated memory was 79.7MB in the beginning and 920.6MB in the end (delta: 841.0MB). Free memory was 35.7MB in the beginning and 692.8MB in the end (delta: -657.1MB). Peak memory consumption was 182.2MB. Max. memory is 16.1GB. * Witness Printer took 94.17ms. Allocated memory is still 920.6MB. Free memory was 692.8MB in the beginning and 677.1MB in the end (delta: 15.7MB). 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.0s, 138 PlacesBefore, 41 PlacesAfterwards, 127 TransitionsBefore, 29 TransitionsAfterwards, 2836 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 110 TotalNumberOfCompositions, 6966 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3467, independent: 3263, independent conditional: 0, independent unconditional: 3263, dependent: 204, dependent conditional: 0, dependent unconditional: 204, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1554, independent: 1510, independent conditional: 0, independent unconditional: 1510, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3467, independent: 1753, independent conditional: 0, independent unconditional: 1753, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 1554, unknown conditional: 0, unknown unconditional: 1554] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 131, Positive conditional cache size: 0, Positive unconditional cache size: 131, 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_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L871] 0 pthread_t t93; [L872] FCALL, FORK 0 pthread_create(&t93, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t93, ((void *)0), P0, ((void *)0))=-2, t93={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t94; [L874] FCALL, FORK 0 pthread_create(&t94, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t94, ((void *)0), P1, ((void *)0))=-1, t93={5:0}, t94={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L875] 0 pthread_t t95; [L876] FCALL, FORK 0 pthread_create(&t95, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t95, ((void *)0), P2, ((void *)0))=0, t93={5:0}, t94={6:0}, t95={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L877] 0 pthread_t t96; [L878] FCALL, FORK 0 pthread_create(&t96, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t96, ((void *)0), P3, ((void *)0))=1, t93={5:0}, t94={6:0}, t95={7:0}, t96={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L821] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L821] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L835] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L836] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L837] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L838] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L840] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EAX = z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L786] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L789] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L797] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L798] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L799] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L800] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L802] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EBX = z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 2 return 0; [L849] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L880] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t93={5:0}, t94={6:0}, t95={7:0}, t96={3:0}, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L885] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L886] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L887] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L888] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t93={5:0}, t94={6:0}, t95={7:0}, t96={3:0}, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L891] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 878]: 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: 874]: 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: 876]: 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: 872]: 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, 166 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: 16.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 685 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 591 mSDsluCounter, 140 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 100 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1271 IncrementalHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 40 mSDtfsCounter, 1271 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=405occurred in iteration=10, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 1653 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-09-01 09:40:36,552 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