./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe021_power.opt_pso.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe021_power.opt_pso.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 10a668ec1ea7995e15ba3bf7e664e16993ba1d6d90153ec7cf305acc426b53b6 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 16:57:52,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:57:52,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:57:52,639 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:57:52,640 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:57:52,642 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:57:52,644 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:57:52,646 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:57:52,647 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:57:52,650 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:57:52,651 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:57:52,653 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:57:52,653 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:57:52,654 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:57:52,655 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:57:52,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:57:52,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:57:52,661 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:57:52,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:57:52,665 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:57:52,666 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:57:52,667 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:57:52,675 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:57:52,675 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:57:52,681 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:57:52,681 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:57:52,681 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:57:52,683 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:57:52,683 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:57:52,684 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:57:52,684 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:57:52,688 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:57:52,689 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:57:52,689 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:57:52,690 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:57:52,691 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:57:52,691 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:57:52,692 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:57:52,692 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:57:52,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:57:52,693 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:57:52,694 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 16:57:52,719 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:57:52,719 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:57:52,720 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:57:52,720 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:57:52,721 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:57:52,721 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:57:52,721 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:57:52,721 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:57:52,721 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:57:52,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:57:52,722 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:57:52,722 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:57:52,722 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:57:52,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:57:52,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:57:52,723 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:57:52,723 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:57:52,723 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:57:52,723 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:57:52,723 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:57:52,724 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:57:52,724 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:57:52,724 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:57:52,724 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:57:52,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:57:52,724 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:57:52,725 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:57:52,725 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:57:52,725 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:57:52,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:57:52,725 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:57:52,725 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:57:52,726 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:57:52,726 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:57:52,726 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:57:52,726 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 -> 10a668ec1ea7995e15ba3bf7e664e16993ba1d6d90153ec7cf305acc426b53b6 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 16:57:52,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:57:52,972 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:57:52,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:57:52,974 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:57:52,974 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:57:52,975 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_power.opt_pso.opt.i [2023-08-30 16:57:54,099 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:57:54,298 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:57:54,299 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_power.opt_pso.opt.i [2023-08-30 16:57:54,306 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d94cd7b0/5c45e1209fe148ee9969e918d65f050d/FLAG06a3c5381 [2023-08-30 16:57:54,317 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d94cd7b0/5c45e1209fe148ee9969e918d65f050d [2023-08-30 16:57:54,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:57:54,319 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:57:54,320 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:57:54,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:57:54,322 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:57:54,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:57:54" (1/1) ... [2023-08-30 16:57:54,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67c1a134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:57:54, skipping insertion in model container [2023-08-30 16:57:54,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:57:54" (1/1) ... [2023-08-30 16:57:54,327 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:57:54,351 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:57:54,446 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/safe021_power.opt_pso.opt.i[959,972] [2023-08-30 16:57:54,611 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:57:54,626 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:57:54,635 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/safe021_power.opt_pso.opt.i[959,972] [2023-08-30 16:57:54,687 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:57:54,717 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:57:54,717 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:57:54,721 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:57:54,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:57:54 WrapperNode [2023-08-30 16:57:54,722 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:57:54,723 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:57:54,723 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:57:54,723 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:57:54,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:57:54" (1/1) ... [2023-08-30 16:57:54,749 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:57:54" (1/1) ... [2023-08-30 16:57:54,772 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-30 16:57:54,772 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:57:54,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:57:54,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:57:54,774 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:57:54,779 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:57:54" (1/1) ... [2023-08-30 16:57:54,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:57:54" (1/1) ... [2023-08-30 16:57:54,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:57:54" (1/1) ... [2023-08-30 16:57:54,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:57:54" (1/1) ... [2023-08-30 16:57:54,797 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:57:54" (1/1) ... [2023-08-30 16:57:54,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:57:54" (1/1) ... [2023-08-30 16:57:54,809 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:57:54" (1/1) ... [2023-08-30 16:57:54,809 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:57:54" (1/1) ... [2023-08-30 16:57:54,814 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:57:54,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:57:54,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:57:54,816 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:57:54,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:57:54" (1/1) ... [2023-08-30 16:57:54,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:57:54,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:57:54,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-08-30 16:57:54,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 16:57:54,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:57:54,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:57:54,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:57:54,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:57:54,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:57:54,864 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:57:54,864 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:57:54,865 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:57:54,865 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:57:54,865 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 16:57:54,865 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 16:57:54,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:57:54,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:57:54,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:57:54,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:57:54,866 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 16:57:54,969 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:57:54,980 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:57:55,308 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:57:55,424 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:57:55,424 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:57:55,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:57:55 BoogieIcfgContainer [2023-08-30 16:57:55,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:57:55,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:57:55,427 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:57:55,429 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:57:55,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:57:54" (1/3) ... [2023-08-30 16:57:55,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6715e654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:57:55, skipping insertion in model container [2023-08-30 16:57:55,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:57:54" (2/3) ... [2023-08-30 16:57:55,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6715e654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:57:55, skipping insertion in model container [2023-08-30 16:57:55,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:57:55" (3/3) ... [2023-08-30 16:57:55,432 INFO L112 eAbstractionObserver]: Analyzing ICFG safe021_power.opt_pso.opt.i [2023-08-30 16:57:55,437 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:57:55,444 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:57:55,444 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:57:55,445 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:57:55,495 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:57:55,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2023-08-30 16:57:55,581 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2023-08-30 16:57:55,582 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:57:55,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-08-30 16:57:55,588 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2023-08-30 16:57:55,592 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2023-08-30 16:57:55,595 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:57:55,613 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2023-08-30 16:57:55,617 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2023-08-30 16:57:55,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2023-08-30 16:57:55,649 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2023-08-30 16:57:55,651 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:57:55,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-08-30 16:57:55,653 INFO L119 LiptonReduction]: Number of co-enabled transitions 1906 [2023-08-30 16:57:58,544 INFO L134 LiptonReduction]: Checked pairs total: 5044 [2023-08-30 16:57:58,544 INFO L136 LiptonReduction]: Total number of compositions: 90 [2023-08-30 16:57:58,553 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:57:58,557 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;@37d86bb0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:57:58,557 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-30 16:57:58,560 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2023-08-30 16:57:58,560 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:57:58,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:57:58,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 16:57:58,561 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:57:58,564 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:57:58,564 INFO L85 PathProgramCache]: Analyzing trace with hash 449641034, now seen corresponding path program 1 times [2023-08-30 16:57:58,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:57:58,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799953161] [2023-08-30 16:57:58,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:57:58,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:57:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:57:58,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:57:58,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:57:58,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799953161] [2023-08-30 16:57:58,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799953161] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:57:58,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:57:58,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:57:58,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258811197] [2023-08-30 16:57:58,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:57:58,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:57:58,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:57:58,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:57:58,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:57:58,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 198 [2023-08-30 16:57:58,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:57:58,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:57:58,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 198 [2023-08-30 16:57:58,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:57:59,145 INFO L130 PetriNetUnfolder]: 855/1390 cut-off events. [2023-08-30 16:57:59,146 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-30 16:57:59,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2717 conditions, 1390 events. 855/1390 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7214 event pairs, 141 based on Foata normal form. 0/1321 useless extension candidates. Maximal degree in co-relation 2706. Up to 1027 conditions per place. [2023-08-30 16:57:59,155 INFO L137 encePairwiseOnDemand]: 194/198 looper letters, 29 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2023-08-30 16:57:59,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 150 flow [2023-08-30 16:57:59,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:57:59,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:57:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2023-08-30 16:57:59,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5353535353535354 [2023-08-30 16:57:59,165 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 318 transitions. [2023-08-30 16:57:59,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 318 transitions. [2023-08-30 16:57:59,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:57:59,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 318 transitions. [2023-08-30 16:57:59,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:57:59,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:57:59,175 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:57:59,176 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 318 transitions. [2023-08-30 16:57:59,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 150 flow [2023-08-30 16:57:59,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 16:57:59,184 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2023-08-30 16:57:59,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-08-30 16:57:59,187 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-08-30 16:57:59,188 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2023-08-30 16:57:59,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:57:59,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:57:59,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:57:59,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:57:59,189 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:57:59,190 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:57:59,190 INFO L85 PathProgramCache]: Analyzing trace with hash 921111519, now seen corresponding path program 1 times [2023-08-30 16:57:59,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:57:59,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85829298] [2023-08-30 16:57:59,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:57:59,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:57:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:57:59,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:57:59,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:57:59,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85829298] [2023-08-30 16:57:59,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85829298] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:57:59,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:57:59,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:57:59,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31219331] [2023-08-30 16:57:59,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:57:59,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:57:59,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:57:59,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:57:59,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:57:59,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 198 [2023-08-30 16:57:59,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:57:59,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:57:59,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 198 [2023-08-30 16:57:59,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:00,082 INFO L130 PetriNetUnfolder]: 935/1429 cut-off events. [2023-08-30 16:58:00,082 INFO L131 PetriNetUnfolder]: For 117/117 co-relation queries the response was YES. [2023-08-30 16:58:00,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3019 conditions, 1429 events. 935/1429 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6586 event pairs, 207 based on Foata normal form. 80/1505 useless extension candidates. Maximal degree in co-relation 3009. Up to 1025 conditions per place. [2023-08-30 16:58:00,086 INFO L137 encePairwiseOnDemand]: 194/198 looper letters, 26 selfloop transitions, 2 changer transitions 17/47 dead transitions. [2023-08-30 16:58:00,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 47 transitions, 200 flow [2023-08-30 16:58:00,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:58:00,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:58:00,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 462 transitions. [2023-08-30 16:58:00,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2023-08-30 16:58:00,092 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 462 transitions. [2023-08-30 16:58:00,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 462 transitions. [2023-08-30 16:58:00,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:00,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 462 transitions. [2023-08-30 16:58:00,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:00,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:00,098 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:00,098 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 5 states and 462 transitions. [2023-08-30 16:58:00,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 47 transitions, 200 flow [2023-08-30 16:58:00,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 47 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:58:00,100 INFO L231 Difference]: Finished difference. Result has 36 places, 22 transitions, 62 flow [2023-08-30 16:58:00,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=22} [2023-08-30 16:58:00,102 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2023-08-30 16:58:00,102 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 22 transitions, 62 flow [2023-08-30 16:58:00,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:00,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:00,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:58:00,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:58:00,103 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:58:00,105 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:00,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1510341379, now seen corresponding path program 1 times [2023-08-30 16:58:00,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:00,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033978859] [2023-08-30 16:58:00,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:00,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:58:00,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:58:00,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:58:00,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033978859] [2023-08-30 16:58:00,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033978859] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:58:00,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:58:00,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:58:00,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180570204] [2023-08-30 16:58:00,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:58:00,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:58:00,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:58:00,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:58:00,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:58:00,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 198 [2023-08-30 16:58:00,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 22 transitions, 62 flow. Second operand has 6 states, 6 states have (on average 83.83333333333333) internal successors, (503), 6 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:00,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:58:00,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 198 [2023-08-30 16:58:00,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:01,032 INFO L130 PetriNetUnfolder]: 1152/1844 cut-off events. [2023-08-30 16:58:01,033 INFO L131 PetriNetUnfolder]: For 436/436 co-relation queries the response was YES. [2023-08-30 16:58:01,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3996 conditions, 1844 events. 1152/1844 cut-off events. For 436/436 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9009 event pairs, 227 based on Foata normal form. 83/1927 useless extension candidates. Maximal degree in co-relation 3983. Up to 1436 conditions per place. [2023-08-30 16:58:01,039 INFO L137 encePairwiseOnDemand]: 188/198 looper letters, 37 selfloop transitions, 9 changer transitions 23/70 dead transitions. [2023-08-30 16:58:01,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 70 transitions, 314 flow [2023-08-30 16:58:01,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:58:01,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:58:01,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 646 transitions. [2023-08-30 16:58:01,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4660894660894661 [2023-08-30 16:58:01,041 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 646 transitions. [2023-08-30 16:58:01,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 646 transitions. [2023-08-30 16:58:01,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:01,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 646 transitions. [2023-08-30 16:58:01,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 92.28571428571429) internal successors, (646), 7 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:01,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:01,045 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:01,045 INFO L175 Difference]: Start difference. First operand has 36 places, 22 transitions, 62 flow. Second operand 7 states and 646 transitions. [2023-08-30 16:58:01,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 70 transitions, 314 flow [2023-08-30 16:58:01,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 70 transitions, 302 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-30 16:58:01,049 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 131 flow [2023-08-30 16:58:01,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=131, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2023-08-30 16:58:01,050 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2023-08-30 16:58:01,050 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 131 flow [2023-08-30 16:58:01,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.83333333333333) internal successors, (503), 6 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:01,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:01,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:58:01,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:58:01,051 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:58:01,051 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:01,052 INFO L85 PathProgramCache]: Analyzing trace with hash -222132835, now seen corresponding path program 1 times [2023-08-30 16:58:01,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:01,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119823304] [2023-08-30 16:58:01,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:01,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:58:01,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:58:01,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:58:01,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119823304] [2023-08-30 16:58:01,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119823304] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:58:01,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:58:01,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:58:01,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073429075] [2023-08-30 16:58:01,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:58:01,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:58:01,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:58:01,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:58:01,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:58:01,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 198 [2023-08-30 16:58:01,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 131 flow. Second operand has 6 states, 6 states have (on average 83.0) internal successors, (498), 6 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:01,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:58:01,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 198 [2023-08-30 16:58:01,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:01,742 INFO L130 PetriNetUnfolder]: 1596/2430 cut-off events. [2023-08-30 16:58:01,743 INFO L131 PetriNetUnfolder]: For 2179/2187 co-relation queries the response was YES. [2023-08-30 16:58:01,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7189 conditions, 2430 events. 1596/2430 cut-off events. For 2179/2187 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11365 event pairs, 338 based on Foata normal form. 99/2528 useless extension candidates. Maximal degree in co-relation 7173. Up to 967 conditions per place. [2023-08-30 16:58:01,750 INFO L137 encePairwiseOnDemand]: 193/198 looper letters, 43 selfloop transitions, 3 changer transitions 21/69 dead transitions. [2023-08-30 16:58:01,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 69 transitions, 414 flow [2023-08-30 16:58:01,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:58:01,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:58:01,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 548 transitions. [2023-08-30 16:58:01,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4612794612794613 [2023-08-30 16:58:01,752 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 548 transitions. [2023-08-30 16:58:01,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 548 transitions. [2023-08-30 16:58:01,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:01,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 548 transitions. [2023-08-30 16:58:01,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:01,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:01,756 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:01,756 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 131 flow. Second operand 6 states and 548 transitions. [2023-08-30 16:58:01,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 69 transitions, 414 flow [2023-08-30 16:58:01,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 69 transitions, 412 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 16:58:01,759 INFO L231 Difference]: Finished difference. Result has 46 places, 28 transitions, 138 flow [2023-08-30 16:58:01,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=46, PETRI_TRANSITIONS=28} [2023-08-30 16:58:01,760 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2023-08-30 16:58:01,760 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 28 transitions, 138 flow [2023-08-30 16:58:01,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.0) internal successors, (498), 6 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:01,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:01,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:58:01,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:58:01,761 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:58:01,761 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:01,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1683585870, now seen corresponding path program 1 times [2023-08-30 16:58:01,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:01,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888619492] [2023-08-30 16:58:01,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:01,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:58:02,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:58:02,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:58:02,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888619492] [2023-08-30 16:58:02,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888619492] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:58:02,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:58:02,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:58:02,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338869790] [2023-08-30 16:58:02,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:58:02,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:58:02,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:58:02,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:58:02,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:58:02,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 198 [2023-08-30 16:58:02,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 28 transitions, 138 flow. Second operand has 7 states, 7 states have (on average 82.71428571428571) internal successors, (579), 7 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:02,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:58:02,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 198 [2023-08-30 16:58:02,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:02,650 INFO L130 PetriNetUnfolder]: 1427/2254 cut-off events. [2023-08-30 16:58:02,651 INFO L131 PetriNetUnfolder]: For 3072/3080 co-relation queries the response was YES. [2023-08-30 16:58:02,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7007 conditions, 2254 events. 1427/2254 cut-off events. For 3072/3080 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11115 event pairs, 371 based on Foata normal form. 69/2323 useless extension candidates. Maximal degree in co-relation 6986. Up to 1751 conditions per place. [2023-08-30 16:58:02,658 INFO L137 encePairwiseOnDemand]: 187/198 looper letters, 40 selfloop transitions, 14 changer transitions 29/84 dead transitions. [2023-08-30 16:58:02,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 84 transitions, 551 flow [2023-08-30 16:58:02,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:58:02,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:58:02,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 729 transitions. [2023-08-30 16:58:02,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4602272727272727 [2023-08-30 16:58:02,661 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 729 transitions. [2023-08-30 16:58:02,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 729 transitions. [2023-08-30 16:58:02,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:02,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 729 transitions. [2023-08-30 16:58:02,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 91.125) internal successors, (729), 8 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:02,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:02,665 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:02,665 INFO L175 Difference]: Start difference. First operand has 46 places, 28 transitions, 138 flow. Second operand 8 states and 729 transitions. [2023-08-30 16:58:02,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 84 transitions, 551 flow [2023-08-30 16:58:02,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 84 transitions, 541 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-30 16:58:02,670 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 240 flow [2023-08-30 16:58:02,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=240, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2023-08-30 16:58:02,671 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 18 predicate places. [2023-08-30 16:58:02,671 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 240 flow [2023-08-30 16:58:02,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.71428571428571) internal successors, (579), 7 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:02,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:02,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:58:02,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:58:02,672 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:58:02,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:02,672 INFO L85 PathProgramCache]: Analyzing trace with hash -458766210, now seen corresponding path program 1 times [2023-08-30 16:58:02,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:02,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894252591] [2023-08-30 16:58:02,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:02,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:58:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:58:02,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:58:02,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894252591] [2023-08-30 16:58:02,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894252591] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:58:02,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:58:02,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:58:02,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888561542] [2023-08-30 16:58:02,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:58:02,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:58:02,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:58:02,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:58:02,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:58:02,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 198 [2023-08-30 16:58:02,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 240 flow. Second operand has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:02,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:58:02,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 198 [2023-08-30 16:58:02,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:02,996 INFO L130 PetriNetUnfolder]: 502/871 cut-off events. [2023-08-30 16:58:02,997 INFO L131 PetriNetUnfolder]: For 2152/2221 co-relation queries the response was YES. [2023-08-30 16:58:02,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3358 conditions, 871 events. 502/871 cut-off events. For 2152/2221 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3892 event pairs, 100 based on Foata normal form. 89/946 useless extension candidates. Maximal degree in co-relation 3334. Up to 375 conditions per place. [2023-08-30 16:58:03,001 INFO L137 encePairwiseOnDemand]: 192/198 looper letters, 46 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2023-08-30 16:58:03,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 57 transitions, 427 flow [2023-08-30 16:58:03,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:58:03,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:58:03,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 400 transitions. [2023-08-30 16:58:03,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5050505050505051 [2023-08-30 16:58:03,002 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 400 transitions. [2023-08-30 16:58:03,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 400 transitions. [2023-08-30 16:58:03,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:03,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 400 transitions. [2023-08-30 16:58:03,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:03,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:03,005 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:03,005 INFO L175 Difference]: Start difference. First operand has 52 places, 36 transitions, 240 flow. Second operand 4 states and 400 transitions. [2023-08-30 16:58:03,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 57 transitions, 427 flow [2023-08-30 16:58:03,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 387 flow, removed 15 selfloop flow, removed 6 redundant places. [2023-08-30 16:58:03,008 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 229 flow [2023-08-30 16:58:03,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=229, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-08-30 16:58:03,009 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2023-08-30 16:58:03,009 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 229 flow [2023-08-30 16:58:03,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:03,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:03,009 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:58:03,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:58:03,010 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:58:03,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:03,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1474558119, now seen corresponding path program 1 times [2023-08-30 16:58:03,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:03,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356019303] [2023-08-30 16:58:03,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:03,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:58:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:58:03,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:58:03,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356019303] [2023-08-30 16:58:03,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356019303] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:58:03,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:58:03,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:58:03,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173656443] [2023-08-30 16:58:03,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:58:03,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:58:03,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:58:03,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:58:03,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:58:03,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 198 [2023-08-30 16:58:03,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 229 flow. Second operand has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:03,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:58:03,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 198 [2023-08-30 16:58:03,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:03,300 INFO L130 PetriNetUnfolder]: 337/630 cut-off events. [2023-08-30 16:58:03,301 INFO L131 PetriNetUnfolder]: For 1227/1297 co-relation queries the response was YES. [2023-08-30 16:58:03,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2432 conditions, 630 events. 337/630 cut-off events. For 1227/1297 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2834 event pairs, 78 based on Foata normal form. 54/677 useless extension candidates. Maximal degree in co-relation 2410. Up to 226 conditions per place. [2023-08-30 16:58:03,303 INFO L137 encePairwiseOnDemand]: 192/198 looper letters, 53 selfloop transitions, 8 changer transitions 0/67 dead transitions. [2023-08-30 16:58:03,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 67 transitions, 492 flow [2023-08-30 16:58:03,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:58:03,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:58:03,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 499 transitions. [2023-08-30 16:58:03,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5040404040404041 [2023-08-30 16:58:03,305 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 499 transitions. [2023-08-30 16:58:03,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 499 transitions. [2023-08-30 16:58:03,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:03,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 499 transitions. [2023-08-30 16:58:03,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:03,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:03,308 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:03,308 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 229 flow. Second operand 5 states and 499 transitions. [2023-08-30 16:58:03,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 67 transitions, 492 flow [2023-08-30 16:58:03,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 67 transitions, 489 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:58:03,310 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 281 flow [2023-08-30 16:58:03,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=281, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2023-08-30 16:58:03,310 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 19 predicate places. [2023-08-30 16:58:03,311 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 281 flow [2023-08-30 16:58:03,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:03,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:03,311 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:58:03,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:58:03,311 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:58:03,312 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:03,312 INFO L85 PathProgramCache]: Analyzing trace with hash 290599346, now seen corresponding path program 1 times [2023-08-30 16:58:03,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:03,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841182211] [2023-08-30 16:58:03,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:03,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:58:03,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:58:03,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:58:03,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841182211] [2023-08-30 16:58:03,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841182211] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:58:03,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:58:03,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:58:03,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144531110] [2023-08-30 16:58:03,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:58:03,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:58:03,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:58:03,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:58:03,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:58:03,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 198 [2023-08-30 16:58:03,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 281 flow. Second operand has 6 states, 6 states have (on average 91.66666666666667) internal successors, (550), 6 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:03,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:58:03,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 198 [2023-08-30 16:58:03,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:03,671 INFO L130 PetriNetUnfolder]: 308/574 cut-off events. [2023-08-30 16:58:03,671 INFO L131 PetriNetUnfolder]: For 1606/1662 co-relation queries the response was YES. [2023-08-30 16:58:03,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2400 conditions, 574 events. 308/574 cut-off events. For 1606/1662 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2590 event pairs, 75 based on Foata normal form. 25/593 useless extension candidates. Maximal degree in co-relation 2375. Up to 226 conditions per place. [2023-08-30 16:58:03,674 INFO L137 encePairwiseOnDemand]: 192/198 looper letters, 43 selfloop transitions, 11 changer transitions 0/60 dead transitions. [2023-08-30 16:58:03,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 60 transitions, 478 flow [2023-08-30 16:58:03,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:58:03,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:58:03,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 581 transitions. [2023-08-30 16:58:03,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4890572390572391 [2023-08-30 16:58:03,676 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 581 transitions. [2023-08-30 16:58:03,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 581 transitions. [2023-08-30 16:58:03,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:03,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 581 transitions. [2023-08-30 16:58:03,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 96.83333333333333) internal successors, (581), 6 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:03,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:03,679 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:03,679 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 281 flow. Second operand 6 states and 581 transitions. [2023-08-30 16:58:03,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 60 transitions, 478 flow [2023-08-30 16:58:03,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 60 transitions, 444 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-08-30 16:58:03,682 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 294 flow [2023-08-30 16:58:03,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=294, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2023-08-30 16:58:03,683 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2023-08-30 16:58:03,683 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 294 flow [2023-08-30 16:58:03,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.66666666666667) internal successors, (550), 6 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:03,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:03,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:58:03,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:58:03,684 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:58:03,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:03,684 INFO L85 PathProgramCache]: Analyzing trace with hash -782968002, now seen corresponding path program 1 times [2023-08-30 16:58:03,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:03,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257356311] [2023-08-30 16:58:03,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:03,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:58:04,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:58:04,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:58:04,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257356311] [2023-08-30 16:58:04,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257356311] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:58:04,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:58:04,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:58:04,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348788640] [2023-08-30 16:58:04,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:58:04,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:58:04,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:58:04,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:58:04,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:58:04,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 198 [2023-08-30 16:58:04,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 294 flow. Second operand has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:04,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:58:04,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 198 [2023-08-30 16:58:04,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:04,268 INFO L130 PetriNetUnfolder]: 471/872 cut-off events. [2023-08-30 16:58:04,269 INFO L131 PetriNetUnfolder]: For 2781/2781 co-relation queries the response was YES. [2023-08-30 16:58:04,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3775 conditions, 872 events. 471/872 cut-off events. For 2781/2781 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4097 event pairs, 80 based on Foata normal form. 1/873 useless extension candidates. Maximal degree in co-relation 3750. Up to 468 conditions per place. [2023-08-30 16:58:04,272 INFO L137 encePairwiseOnDemand]: 191/198 looper letters, 45 selfloop transitions, 3 changer transitions 42/93 dead transitions. [2023-08-30 16:58:04,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 93 transitions, 803 flow [2023-08-30 16:58:04,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:58:04,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:58:04,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 620 transitions. [2023-08-30 16:58:04,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44733044733044736 [2023-08-30 16:58:04,274 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 620 transitions. [2023-08-30 16:58:04,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 620 transitions. [2023-08-30 16:58:04,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:04,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 620 transitions. [2023-08-30 16:58:04,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 88.57142857142857) internal successors, (620), 7 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:04,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:04,278 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:04,278 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 294 flow. Second operand 7 states and 620 transitions. [2023-08-30 16:58:04,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 93 transitions, 803 flow [2023-08-30 16:58:04,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 93 transitions, 731 flow, removed 22 selfloop flow, removed 4 redundant places. [2023-08-30 16:58:04,285 INFO L231 Difference]: Finished difference. Result has 61 places, 37 transitions, 235 flow [2023-08-30 16:58:04,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=235, PETRI_PLACES=61, PETRI_TRANSITIONS=37} [2023-08-30 16:58:04,285 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 27 predicate places. [2023-08-30 16:58:04,285 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 37 transitions, 235 flow [2023-08-30 16:58:04,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:04,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:04,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:58:04,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:58:04,286 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:58:04,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:04,287 INFO L85 PathProgramCache]: Analyzing trace with hash 199548594, now seen corresponding path program 2 times [2023-08-30 16:58:04,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:04,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283472223] [2023-08-30 16:58:04,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:04,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:58:04,317 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:58:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:58:04,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:58:04,362 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:58:04,363 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-30 16:58:04,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-30 16:58:04,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-30 16:58:04,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-30 16:58:04,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-30 16:58:04,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-30 16:58:04,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:58:04,365 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:58:04,368 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:58:04,368 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:58:04,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:58:04 BasicIcfg [2023-08-30 16:58:04,402 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:58:04,402 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:58:04,402 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:58:04,402 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:58:04,403 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:57:55" (3/4) ... [2023-08-30 16:58:04,404 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:58:04,443 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:58:04,443 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:58:04,444 INFO L158 Benchmark]: Toolchain (without parser) took 10124.48ms. Allocated memory was 75.5MB in the beginning and 419.4MB in the end (delta: 343.9MB). Free memory was 49.4MB in the beginning and 234.4MB in the end (delta: -184.9MB). Peak memory consumption was 158.6MB. Max. memory is 16.1GB. [2023-08-30 16:58:04,444 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 58.7MB. Free memory is still 36.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:58:04,444 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.95ms. Allocated memory is still 75.5MB. Free memory was 49.3MB in the beginning and 45.0MB in the end (delta: 4.3MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2023-08-30 16:58:04,444 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.83ms. Allocated memory is still 75.5MB. Free memory was 45.0MB in the beginning and 42.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 16:58:04,444 INFO L158 Benchmark]: Boogie Preprocessor took 40.95ms. Allocated memory is still 75.5MB. Free memory was 42.2MB in the beginning and 40.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:58:04,445 INFO L158 Benchmark]: RCFGBuilder took 611.45ms. Allocated memory is still 75.5MB. Free memory was 40.1MB in the beginning and 50.5MB in the end (delta: -10.4MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2023-08-30 16:58:04,445 INFO L158 Benchmark]: TraceAbstraction took 8974.76ms. Allocated memory was 75.5MB in the beginning and 419.4MB in the end (delta: 343.9MB). Free memory was 49.6MB in the beginning and 244.9MB in the end (delta: -195.2MB). Peak memory consumption was 148.0MB. Max. memory is 16.1GB. [2023-08-30 16:58:04,445 INFO L158 Benchmark]: Witness Printer took 41.15ms. Allocated memory is still 419.4MB. Free memory was 244.9MB in the beginning and 234.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-08-30 16:58:04,446 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.14ms. Allocated memory is still 58.7MB. Free memory is still 36.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 401.95ms. Allocated memory is still 75.5MB. Free memory was 49.3MB in the beginning and 45.0MB in the end (delta: 4.3MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.83ms. Allocated memory is still 75.5MB. Free memory was 45.0MB in the beginning and 42.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.95ms. Allocated memory is still 75.5MB. Free memory was 42.2MB in the beginning and 40.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 611.45ms. Allocated memory is still 75.5MB. Free memory was 40.1MB in the beginning and 50.5MB in the end (delta: -10.4MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8974.76ms. Allocated memory was 75.5MB in the beginning and 419.4MB in the end (delta: 343.9MB). Free memory was 49.6MB in the beginning and 244.9MB in the end (delta: -195.2MB). Peak memory consumption was 148.0MB. Max. memory is 16.1GB. * Witness Printer took 41.15ms. Allocated memory is still 419.4MB. Free memory was 244.9MB in the beginning and 234.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 113 PlacesBefore, 34 PlacesAfterwards, 105 TransitionsBefore, 25 TransitionsAfterwards, 1906 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 90 TotalNumberOfCompositions, 5044 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2207, independent: 2031, independent conditional: 0, independent unconditional: 2031, dependent: 176, dependent conditional: 0, dependent unconditional: 176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1009, independent: 976, independent conditional: 0, independent unconditional: 976, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2207, independent: 1055, independent conditional: 0, independent unconditional: 1055, dependent: 143, dependent conditional: 0, dependent unconditional: 143, unknown: 1009, unknown conditional: 0, unknown unconditional: 1009] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 79, Positive conditional cache size: 0, Positive unconditional cache size: 79, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t2284; [L821] FCALL, FORK 0 pthread_create(&t2284, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2284, ((void *)0), P0, ((void *)0))=-3, t2284={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L822] 0 pthread_t t2285; [L823] FCALL, FORK 0 pthread_create(&t2285, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2285, ((void *)0), P1, ((void *)0))=-2, t2284={5:0}, t2285={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L824] 0 pthread_t t2286; [L825] FCALL, FORK 0 pthread_create(&t2286, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2286, ((void *)0), P2, ((void *)0))=-1, t2284={5:0}, t2285={6:0}, t2286={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L792] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L795] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L798] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2284={5:0}, t2285={6:0}, t2286={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L835] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2284={5:0}, t2285={6:0}, t2286={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 x$flush_delayed = weak$$choice2 [L841] 0 x$mem_tmp = x [L842] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L843] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L844] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L845] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L846] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L848] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L850] 0 x = x$flush_delayed ? x$mem_tmp : x [L851] 0 x$flush_delayed = (_Bool)0 [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 825]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 135 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 626 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 540 mSDsluCounter, 344 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 270 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 977 IncrementalHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 74 mSDtfsCounter, 977 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=294occurred in iteration=8, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 111 ConstructedInterpolants, 0 QuantifiedInterpolants, 1112 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-30 16:58:04,461 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