./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix010.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix010.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7921b56e8fb93a995ae84202df419b3b13e0137d1aac925ef124b626f5414f7b --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 23:08:08,437 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 23:08:08,439 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 23:08:08,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 23:08:08,486 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 23:08:08,489 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 23:08:08,491 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 23:08:08,493 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 23:08:08,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 23:08:08,499 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 23:08:08,500 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 23:08:08,502 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 23:08:08,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 23:08:08,504 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 23:08:08,505 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 23:08:08,508 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 23:08:08,512 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 23:08:08,512 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 23:08:08,514 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 23:08:08,516 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 23:08:08,519 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 23:08:08,519 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 23:08:08,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 23:08:08,521 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 23:08:08,525 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 23:08:08,528 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 23:08:08,528 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 23:08:08,529 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 23:08:08,530 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 23:08:08,531 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 23:08:08,531 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 23:08:08,534 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 23:08:08,535 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 23:08:08,536 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 23:08:08,537 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 23:08:08,537 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 23:08:08,538 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 23:08:08,538 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 23:08:08,538 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 23:08:08,539 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 23:08:08,540 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 23:08:08,542 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 23:08:08,580 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 23:08:08,581 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 23:08:08,582 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 23:08:08,582 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 23:08:08,583 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 23:08:08,583 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 23:08:08,583 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 23:08:08,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 23:08:08,584 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 23:08:08,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 23:08:08,585 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 23:08:08,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 23:08:08,585 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 23:08:08,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 23:08:08,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 23:08:08,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 23:08:08,586 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 23:08:08,586 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 23:08:08,586 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 23:08:08,587 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 23:08:08,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 23:08:08,587 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 23:08:08,587 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 23:08:08,587 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 23:08:08,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:08:08,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 23:08:08,588 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 23:08:08,588 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 23:08:08,588 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 23:08:08,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 23:08:08,589 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 23:08:08,589 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 23:08:08,589 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 23:08:08,589 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 23:08:08,590 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 23:08:08,590 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 -> 7921b56e8fb93a995ae84202df419b3b13e0137d1aac925ef124b626f5414f7b Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 23:08:08,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 23:08:08,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 23:08:08,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 23:08:08,868 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 23:08:08,869 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 23:08:08,870 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010.oepc.i [2023-08-30 23:08:10,051 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 23:08:10,357 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 23:08:10,357 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010.oepc.i [2023-08-30 23:08:10,370 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa12ceaee/fab8a9848cc84c769f31c4583384ee83/FLAG4e9546274 [2023-08-30 23:08:10,386 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa12ceaee/fab8a9848cc84c769f31c4583384ee83 [2023-08-30 23:08:10,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 23:08:10,389 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 23:08:10,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 23:08:10,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 23:08:10,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 23:08:10,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:08:10" (1/1) ... [2023-08-30 23:08:10,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6336dcfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:10, skipping insertion in model container [2023-08-30 23:08:10,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:08:10" (1/1) ... [2023-08-30 23:08:10,400 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 23:08:10,452 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 23:08:10,618 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/mix010.oepc.i[945,958] [2023-08-30 23:08:10,812 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:08:10,826 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 23:08:10,838 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010.oepc.i[945,958] [2023-08-30 23:08:10,908 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:08:10,956 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:08:10,956 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:08:10,962 INFO L208 MainTranslator]: Completed translation [2023-08-30 23:08:10,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:10 WrapperNode [2023-08-30 23:08:10,963 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 23:08:10,964 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 23:08:10,964 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 23:08:10,964 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 23:08:10,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:10" (1/1) ... [2023-08-30 23:08:10,999 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:10" (1/1) ... [2023-08-30 23:08:11,037 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2023-08-30 23:08:11,038 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 23:08:11,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 23:08:11,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 23:08:11,039 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 23:08:11,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:10" (1/1) ... [2023-08-30 23:08:11,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:10" (1/1) ... [2023-08-30 23:08:11,058 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:10" (1/1) ... [2023-08-30 23:08:11,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:10" (1/1) ... [2023-08-30 23:08:11,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:10" (1/1) ... [2023-08-30 23:08:11,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:10" (1/1) ... [2023-08-30 23:08:11,081 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:10" (1/1) ... [2023-08-30 23:08:11,088 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:10" (1/1) ... [2023-08-30 23:08:11,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 23:08:11,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 23:08:11,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 23:08:11,098 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 23:08:11,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:10" (1/1) ... [2023-08-30 23:08:11,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:08:11,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 23:08:11,126 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 23:08:11,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 23:08:11,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 23:08:11,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 23:08:11,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 23:08:11,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 23:08:11,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 23:08:11,164 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 23:08:11,164 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 23:08:11,164 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 23:08:11,164 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 23:08:11,164 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 23:08:11,164 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 23:08:11,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 23:08:11,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 23:08:11,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 23:08:11,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 23:08:11,166 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 23:08:11,361 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 23:08:11,362 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 23:08:11,581 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 23:08:11,729 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 23:08:11,730 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 23:08:11,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:08:11 BoogieIcfgContainer [2023-08-30 23:08:11,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 23:08:11,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 23:08:11,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 23:08:11,736 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 23:08:11,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 11:08:10" (1/3) ... [2023-08-30 23:08:11,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bec3011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:08:11, skipping insertion in model container [2023-08-30 23:08:11,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:10" (2/3) ... [2023-08-30 23:08:11,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bec3011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:08:11, skipping insertion in model container [2023-08-30 23:08:11,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:08:11" (3/3) ... [2023-08-30 23:08:11,739 INFO L112 eAbstractionObserver]: Analyzing ICFG mix010.oepc.i [2023-08-30 23:08:11,745 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 23:08:11,752 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 23:08:11,753 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 23:08:11,753 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 23:08:11,807 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 23:08:11,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2023-08-30 23:08:11,904 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2023-08-30 23:08:11,904 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:08:11,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-08-30 23:08:11,910 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2023-08-30 23:08:11,913 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2023-08-30 23:08:11,916 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 23:08:11,927 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 233 flow [2023-08-30 23:08:11,929 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 233 flow [2023-08-30 23:08:11,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 233 flow [2023-08-30 23:08:11,982 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2023-08-30 23:08:11,982 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:08:11,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-08-30 23:08:11,985 INFO L119 LiptonReduction]: Number of co-enabled transitions 2216 [2023-08-30 23:08:15,288 INFO L134 LiptonReduction]: Checked pairs total: 6622 [2023-08-30 23:08:15,289 INFO L136 LiptonReduction]: Total number of compositions: 95 [2023-08-30 23:08:15,299 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 23:08:15,304 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;@5fbede57, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 23:08:15,304 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-30 23:08:15,306 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-08-30 23:08:15,307 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:08:15,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:15,307 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 23:08:15,308 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:08:15,312 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:15,312 INFO L85 PathProgramCache]: Analyzing trace with hash 489458, now seen corresponding path program 1 times [2023-08-30 23:08:15,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:15,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92074746] [2023-08-30 23:08:15,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:15,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:15,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:15,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:15,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92074746] [2023-08-30 23:08:15,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92074746] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:15,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:15,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:08:15,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298746682] [2023-08-30 23:08:15,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:15,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:08:15,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:15,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:08:15,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:08:15,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 210 [2023-08-30 23:08:15,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:15,686 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:15,686 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 210 [2023-08-30 23:08:15,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:16,076 INFO L130 PetriNetUnfolder]: 1614/2556 cut-off events. [2023-08-30 23:08:16,077 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-08-30 23:08:16,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4974 conditions, 2556 events. 1614/2556 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 14404 event pairs, 264 based on Foata normal form. 100/2447 useless extension candidates. Maximal degree in co-relation 4963. Up to 1912 conditions per place. [2023-08-30 23:08:16,092 INFO L137 encePairwiseOnDemand]: 206/210 looper letters, 35 selfloop transitions, 2 changer transitions 4/44 dead transitions. [2023-08-30 23:08:16,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 44 transitions, 185 flow [2023-08-30 23:08:16,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:08:16,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:08:16,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2023-08-30 23:08:16,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5507936507936508 [2023-08-30 23:08:16,111 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 347 transitions. [2023-08-30 23:08:16,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 347 transitions. [2023-08-30 23:08:16,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:16,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 347 transitions. [2023-08-30 23:08:16,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:16,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:16,125 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:16,126 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 65 flow. Second operand 3 states and 347 transitions. [2023-08-30 23:08:16,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 44 transitions, 185 flow [2023-08-30 23:08:16,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 23:08:16,131 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 58 flow [2023-08-30 23:08:16,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2023-08-30 23:08:16,137 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2023-08-30 23:08:16,137 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 58 flow [2023-08-30 23:08:16,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:16,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:16,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:16,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 23:08:16,141 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:08:16,148 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:16,149 INFO L85 PathProgramCache]: Analyzing trace with hash 502737743, now seen corresponding path program 1 times [2023-08-30 23:08:16,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:16,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633156508] [2023-08-30 23:08:16,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:16,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:16,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:16,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:16,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633156508] [2023-08-30 23:08:16,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633156508] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:16,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:16,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:08:16,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547185142] [2023-08-30 23:08:16,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:16,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:08:16,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:16,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:08:16,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:08:16,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 210 [2023-08-30 23:08:16,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:16,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:16,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 210 [2023-08-30 23:08:16,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:16,995 INFO L130 PetriNetUnfolder]: 2371/3506 cut-off events. [2023-08-30 23:08:16,996 INFO L131 PetriNetUnfolder]: For 221/221 co-relation queries the response was YES. [2023-08-30 23:08:17,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7310 conditions, 3506 events. 2371/3506 cut-off events. For 221/221 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 15916 event pairs, 1191 based on Foata normal form. 180/3686 useless extension candidates. Maximal degree in co-relation 7300. Up to 2979 conditions per place. [2023-08-30 23:08:17,011 INFO L137 encePairwiseOnDemand]: 204/210 looper letters, 32 selfloop transitions, 4 changer transitions 21/57 dead transitions. [2023-08-30 23:08:17,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 57 transitions, 248 flow [2023-08-30 23:08:17,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:08:17,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:08:17,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 504 transitions. [2023-08-30 23:08:17,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48 [2023-08-30 23:08:17,014 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 504 transitions. [2023-08-30 23:08:17,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 504 transitions. [2023-08-30 23:08:17,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:17,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 504 transitions. [2023-08-30 23:08:17,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.8) internal successors, (504), 5 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:17,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:17,020 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:17,020 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 58 flow. Second operand 5 states and 504 transitions. [2023-08-30 23:08:17,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 57 transitions, 248 flow [2023-08-30 23:08:17,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 57 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:08:17,022 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 90 flow [2023-08-30 23:08:17,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2023-08-30 23:08:17,023 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2023-08-30 23:08:17,023 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 90 flow [2023-08-30 23:08:17,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:17,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:17,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:17,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 23:08:17,024 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:08:17,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:17,026 INFO L85 PathProgramCache]: Analyzing trace with hash -248772060, now seen corresponding path program 1 times [2023-08-30 23:08:17,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:17,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296023607] [2023-08-30 23:08:17,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:17,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:17,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:17,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:17,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296023607] [2023-08-30 23:08:17,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296023607] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:17,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:17,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:08:17,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434606474] [2023-08-30 23:08:17,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:17,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:08:17,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:17,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:08:17,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:08:17,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 210 [2023-08-30 23:08:17,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:17,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:17,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 210 [2023-08-30 23:08:17,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:17,659 INFO L130 PetriNetUnfolder]: 2103/3110 cut-off events. [2023-08-30 23:08:17,659 INFO L131 PetriNetUnfolder]: For 1509/1509 co-relation queries the response was YES. [2023-08-30 23:08:17,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7647 conditions, 3110 events. 2103/3110 cut-off events. For 1509/1509 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 13586 event pairs, 579 based on Foata normal form. 156/3266 useless extension candidates. Maximal degree in co-relation 7634. Up to 2001 conditions per place. [2023-08-30 23:08:17,674 INFO L137 encePairwiseOnDemand]: 206/210 looper letters, 35 selfloop transitions, 3 changer transitions 24/62 dead transitions. [2023-08-30 23:08:17,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 62 transitions, 314 flow [2023-08-30 23:08:17,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:08:17,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:08:17,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 506 transitions. [2023-08-30 23:08:17,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4819047619047619 [2023-08-30 23:08:17,677 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 506 transitions. [2023-08-30 23:08:17,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 506 transitions. [2023-08-30 23:08:17,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:17,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 506 transitions. [2023-08-30 23:08:17,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:17,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:17,682 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:17,682 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 90 flow. Second operand 5 states and 506 transitions. [2023-08-30 23:08:17,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 62 transitions, 314 flow [2023-08-30 23:08:17,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 62 transitions, 308 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 23:08:17,691 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 99 flow [2023-08-30 23:08:17,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2023-08-30 23:08:17,692 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2023-08-30 23:08:17,693 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 99 flow [2023-08-30 23:08:17,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:17,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:17,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:17,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 23:08:17,694 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:08:17,695 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:17,695 INFO L85 PathProgramCache]: Analyzing trace with hash 727207216, now seen corresponding path program 1 times [2023-08-30 23:08:17,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:17,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223407372] [2023-08-30 23:08:17,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:17,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:17,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:17,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:17,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223407372] [2023-08-30 23:08:17,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223407372] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:17,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:17,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:08:17,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562203317] [2023-08-30 23:08:17,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:17,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:08:17,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:17,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:08:17,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:08:17,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 210 [2023-08-30 23:08:17,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:17,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:17,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 210 [2023-08-30 23:08:17,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:18,156 INFO L130 PetriNetUnfolder]: 1225/1976 cut-off events. [2023-08-30 23:08:18,156 INFO L131 PetriNetUnfolder]: For 1228/1257 co-relation queries the response was YES. [2023-08-30 23:08:18,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4652 conditions, 1976 events. 1225/1976 cut-off events. For 1228/1257 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9884 event pairs, 415 based on Foata normal form. 100/2052 useless extension candidates. Maximal degree in co-relation 4636. Up to 1146 conditions per place. [2023-08-30 23:08:18,165 INFO L137 encePairwiseOnDemand]: 206/210 looper letters, 30 selfloop transitions, 3 changer transitions 17/55 dead transitions. [2023-08-30 23:08:18,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 55 transitions, 265 flow [2023-08-30 23:08:18,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:08:18,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:08:18,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 531 transitions. [2023-08-30 23:08:18,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5057142857142857 [2023-08-30 23:08:18,167 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 531 transitions. [2023-08-30 23:08:18,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 531 transitions. [2023-08-30 23:08:18,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:18,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 531 transitions. [2023-08-30 23:08:18,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:18,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:18,171 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:18,171 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 99 flow. Second operand 5 states and 531 transitions. [2023-08-30 23:08:18,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 55 transitions, 265 flow [2023-08-30 23:08:18,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 55 transitions, 255 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-30 23:08:18,178 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 104 flow [2023-08-30 23:08:18,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2023-08-30 23:08:18,179 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2023-08-30 23:08:18,179 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 104 flow [2023-08-30 23:08:18,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:18,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:18,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:18,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 23:08:18,180 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:08:18,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:18,181 INFO L85 PathProgramCache]: Analyzing trace with hash -592144845, now seen corresponding path program 1 times [2023-08-30 23:08:18,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:18,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020427174] [2023-08-30 23:08:18,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:18,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:18,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:18,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:18,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020427174] [2023-08-30 23:08:18,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020427174] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:18,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:18,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:08:18,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453681316] [2023-08-30 23:08:18,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:18,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:08:18,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:18,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:08:18,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:08:18,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 210 [2023-08-30 23:08:18,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:18,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:18,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 210 [2023-08-30 23:08:18,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:18,487 INFO L130 PetriNetUnfolder]: 573/980 cut-off events. [2023-08-30 23:08:18,488 INFO L131 PetriNetUnfolder]: For 609/620 co-relation queries the response was YES. [2023-08-30 23:08:18,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2519 conditions, 980 events. 573/980 cut-off events. For 609/620 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4457 event pairs, 162 based on Foata normal form. 60/1035 useless extension candidates. Maximal degree in co-relation 2502. Up to 729 conditions per place. [2023-08-30 23:08:18,493 INFO L137 encePairwiseOnDemand]: 205/210 looper letters, 33 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2023-08-30 23:08:18,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 42 transitions, 219 flow [2023-08-30 23:08:18,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:08:18,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:08:18,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2023-08-30 23:08:18,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5253968253968254 [2023-08-30 23:08:18,495 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 331 transitions. [2023-08-30 23:08:18,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 331 transitions. [2023-08-30 23:08:18,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:18,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 331 transitions. [2023-08-30 23:08:18,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:18,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:18,499 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:18,500 INFO L175 Difference]: Start difference. First operand has 42 places, 27 transitions, 104 flow. Second operand 3 states and 331 transitions. [2023-08-30 23:08:18,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 42 transitions, 219 flow [2023-08-30 23:08:18,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 42 transitions, 207 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-30 23:08:18,503 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 120 flow [2023-08-30 23:08:18,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2023-08-30 23:08:18,505 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2023-08-30 23:08:18,505 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 120 flow [2023-08-30 23:08:18,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:18,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:18,506 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:18,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 23:08:18,506 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:08:18,506 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:18,506 INFO L85 PathProgramCache]: Analyzing trace with hash -317512214, now seen corresponding path program 1 times [2023-08-30 23:08:18,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:18,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633817257] [2023-08-30 23:08:18,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:18,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:18,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:18,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:18,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633817257] [2023-08-30 23:08:18,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633817257] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:18,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:18,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:08:18,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934409949] [2023-08-30 23:08:18,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:18,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:08:18,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:18,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:08:18,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:08:18,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 210 [2023-08-30 23:08:18,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:18,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:18,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 210 [2023-08-30 23:08:18,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:18,885 INFO L130 PetriNetUnfolder]: 281/536 cut-off events. [2023-08-30 23:08:18,885 INFO L131 PetriNetUnfolder]: For 203/204 co-relation queries the response was YES. [2023-08-30 23:08:18,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1514 conditions, 536 events. 281/536 cut-off events. For 203/204 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2274 event pairs, 109 based on Foata normal form. 50/583 useless extension candidates. Maximal degree in co-relation 1498. Up to 206 conditions per place. [2023-08-30 23:08:18,889 INFO L137 encePairwiseOnDemand]: 205/210 looper letters, 43 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2023-08-30 23:08:18,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 55 transitions, 292 flow [2023-08-30 23:08:18,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:08:18,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:08:18,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 442 transitions. [2023-08-30 23:08:18,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5261904761904762 [2023-08-30 23:08:18,891 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 442 transitions. [2023-08-30 23:08:18,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 442 transitions. [2023-08-30 23:08:18,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:18,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 442 transitions. [2023-08-30 23:08:18,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:18,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:18,895 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:18,895 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 120 flow. Second operand 4 states and 442 transitions. [2023-08-30 23:08:18,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 55 transitions, 292 flow [2023-08-30 23:08:18,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 55 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 23:08:18,899 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 156 flow [2023-08-30 23:08:18,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2023-08-30 23:08:18,901 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2023-08-30 23:08:18,901 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 156 flow [2023-08-30 23:08:18,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:18,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:18,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:18,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 23:08:18,903 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:08:18,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:18,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1092294704, now seen corresponding path program 1 times [2023-08-30 23:08:18,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:18,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752085750] [2023-08-30 23:08:18,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:18,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:19,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:19,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:19,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752085750] [2023-08-30 23:08:19,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752085750] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:19,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:19,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:08:19,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236053477] [2023-08-30 23:08:19,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:19,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:08:19,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:19,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:08:19,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:08:19,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 210 [2023-08-30 23:08:19,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:19,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:19,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 210 [2023-08-30 23:08:19,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:19,400 INFO L130 PetriNetUnfolder]: 238/449 cut-off events. [2023-08-30 23:08:19,400 INFO L131 PetriNetUnfolder]: For 427/427 co-relation queries the response was YES. [2023-08-30 23:08:19,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1332 conditions, 449 events. 238/449 cut-off events. For 427/427 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1911 event pairs, 105 based on Foata normal form. 13/459 useless extension candidates. Maximal degree in co-relation 1314. Up to 206 conditions per place. [2023-08-30 23:08:19,403 INFO L137 encePairwiseOnDemand]: 205/210 looper letters, 40 selfloop transitions, 10 changer transitions 0/55 dead transitions. [2023-08-30 23:08:19,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 55 transitions, 316 flow [2023-08-30 23:08:19,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:08:19,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:08:19,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2023-08-30 23:08:19,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2023-08-30 23:08:19,406 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 540 transitions. [2023-08-30 23:08:19,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 540 transitions. [2023-08-30 23:08:19,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:19,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 540 transitions. [2023-08-30 23:08:19,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:19,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:19,410 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:19,410 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 156 flow. Second operand 5 states and 540 transitions. [2023-08-30 23:08:19,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 55 transitions, 316 flow [2023-08-30 23:08:19,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 55 transitions, 286 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-08-30 23:08:19,414 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 156 flow [2023-08-30 23:08:19,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-08-30 23:08:19,414 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 6 predicate places. [2023-08-30 23:08:19,415 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 156 flow [2023-08-30 23:08:19,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:19,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:19,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:19,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 23:08:19,416 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:08:19,416 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:19,416 INFO L85 PathProgramCache]: Analyzing trace with hash 360292321, now seen corresponding path program 1 times [2023-08-30 23:08:19,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:19,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458566503] [2023-08-30 23:08:19,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:19,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:20,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:20,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:20,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458566503] [2023-08-30 23:08:20,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458566503] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:20,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:20,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 23:08:20,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271997431] [2023-08-30 23:08:20,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:20,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 23:08:20,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:20,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 23:08:20,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 23:08:20,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 210 [2023-08-30 23:08:20,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 156 flow. Second operand has 8 states, 8 states have (on average 87.0) internal successors, (696), 8 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:20,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:20,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 210 [2023-08-30 23:08:20,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:20,777 INFO L130 PetriNetUnfolder]: 547/957 cut-off events. [2023-08-30 23:08:20,777 INFO L131 PetriNetUnfolder]: For 1258/1258 co-relation queries the response was YES. [2023-08-30 23:08:20,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2999 conditions, 957 events. 547/957 cut-off events. For 1258/1258 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4327 event pairs, 63 based on Foata normal form. 1/958 useless extension candidates. Maximal degree in co-relation 2982. Up to 297 conditions per place. [2023-08-30 23:08:20,782 INFO L137 encePairwiseOnDemand]: 198/210 looper letters, 96 selfloop transitions, 15 changer transitions 9/120 dead transitions. [2023-08-30 23:08:20,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 120 transitions, 786 flow [2023-08-30 23:08:20,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 23:08:20,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 23:08:20,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 855 transitions. [2023-08-30 23:08:20,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2023-08-30 23:08:20,785 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 855 transitions. [2023-08-30 23:08:20,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 855 transitions. [2023-08-30 23:08:20,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:20,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 855 transitions. [2023-08-30 23:08:20,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 95.0) internal successors, (855), 9 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:20,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 210.0) internal successors, (2100), 10 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:20,791 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 210.0) internal successors, (2100), 10 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:20,791 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 156 flow. Second operand 9 states and 855 transitions. [2023-08-30 23:08:20,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 120 transitions, 786 flow [2023-08-30 23:08:20,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 120 transitions, 678 flow, removed 29 selfloop flow, removed 4 redundant places. [2023-08-30 23:08:20,798 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 213 flow [2023-08-30 23:08:20,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=213, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2023-08-30 23:08:20,800 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 14 predicate places. [2023-08-30 23:08:20,800 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 213 flow [2023-08-30 23:08:20,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.0) internal successors, (696), 8 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:20,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:20,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:20,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 23:08:20,801 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:08:20,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:20,802 INFO L85 PathProgramCache]: Analyzing trace with hash -293756201, now seen corresponding path program 2 times [2023-08-30 23:08:20,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:20,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472777914] [2023-08-30 23:08:20,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:20,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:21,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:21,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:21,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472777914] [2023-08-30 23:08:21,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472777914] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:21,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:21,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:08:21,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166962318] [2023-08-30 23:08:21,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:21,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:08:21,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:21,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:08:21,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:08:21,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 210 [2023-08-30 23:08:21,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 213 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 23:08:21,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:21,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 210 [2023-08-30 23:08:21,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:21,393 INFO L130 PetriNetUnfolder]: 688/1220 cut-off events. [2023-08-30 23:08:21,393 INFO L131 PetriNetUnfolder]: For 1382/1382 co-relation queries the response was YES. [2023-08-30 23:08:21,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4141 conditions, 1220 events. 688/1220 cut-off events. For 1382/1382 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5829 event pairs, 85 based on Foata normal form. 2/1222 useless extension candidates. Maximal degree in co-relation 4124. Up to 702 conditions per place. [2023-08-30 23:08:21,399 INFO L137 encePairwiseOnDemand]: 201/210 looper letters, 63 selfloop transitions, 16 changer transitions 12/91 dead transitions. [2023-08-30 23:08:21,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 91 transitions, 621 flow [2023-08-30 23:08:21,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:08:21,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:08:21,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 580 transitions. [2023-08-30 23:08:21,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2023-08-30 23:08:21,401 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 580 transitions. [2023-08-30 23:08:21,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 580 transitions. [2023-08-30 23:08:21,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:21,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 580 transitions. [2023-08-30 23:08:21,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 96.66666666666667) internal successors, (580), 6 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:21,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:21,405 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:21,406 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 213 flow. Second operand 6 states and 580 transitions. [2023-08-30 23:08:21,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 91 transitions, 621 flow [2023-08-30 23:08:21,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 91 transitions, 600 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-30 23:08:21,413 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 290 flow [2023-08-30 23:08:21,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=290, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2023-08-30 23:08:21,414 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 18 predicate places. [2023-08-30 23:08:21,414 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 290 flow [2023-08-30 23:08:21,415 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 23:08:21,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:21,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:21,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 23:08:21,416 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:08:21,416 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:21,416 INFO L85 PathProgramCache]: Analyzing trace with hash 505320137, now seen corresponding path program 3 times [2023-08-30 23:08:21,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:21,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400165115] [2023-08-30 23:08:21,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:21,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:21,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:21,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:21,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400165115] [2023-08-30 23:08:21,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400165115] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:21,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:21,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:08:21,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274758232] [2023-08-30 23:08:21,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:21,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:08:21,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:21,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:08:21,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:08:21,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 210 [2023-08-30 23:08:21,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 290 flow. Second operand has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:21,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:21,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 210 [2023-08-30 23:08:21,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:21,935 INFO L130 PetriNetUnfolder]: 717/1390 cut-off events. [2023-08-30 23:08:21,935 INFO L131 PetriNetUnfolder]: For 2124/2162 co-relation queries the response was YES. [2023-08-30 23:08:21,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5000 conditions, 1390 events. 717/1390 cut-off events. For 2124/2162 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8117 event pairs, 143 based on Foata normal form. 10/1390 useless extension candidates. Maximal degree in co-relation 4984. Up to 654 conditions per place. [2023-08-30 23:08:21,941 INFO L137 encePairwiseOnDemand]: 206/210 looper letters, 39 selfloop transitions, 1 changer transitions 48/94 dead transitions. [2023-08-30 23:08:21,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 94 transitions, 710 flow [2023-08-30 23:08:21,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:08:21,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:08:21,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 517 transitions. [2023-08-30 23:08:21,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49238095238095236 [2023-08-30 23:08:21,943 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 517 transitions. [2023-08-30 23:08:21,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 517 transitions. [2023-08-30 23:08:21,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:21,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 517 transitions. [2023-08-30 23:08:21,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:21,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:21,947 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:21,947 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 290 flow. Second operand 5 states and 517 transitions. [2023-08-30 23:08:21,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 94 transitions, 710 flow [2023-08-30 23:08:21,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 94 transitions, 696 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-30 23:08:21,956 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 247 flow [2023-08-30 23:08:21,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2023-08-30 23:08:21,957 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 21 predicate places. [2023-08-30 23:08:21,957 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 247 flow [2023-08-30 23:08:21,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:08:21,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:21,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:21,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 23:08:21,958 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:08:21,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:21,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1951034557, now seen corresponding path program 4 times [2023-08-30 23:08:21,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:21,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386367567] [2023-08-30 23:08:21,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:21,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:08:22,007 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 23:08:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:08:22,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 23:08:22,076 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 23:08:22,077 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-30 23:08:22,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-30 23:08:22,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-30 23:08:22,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-30 23:08:22,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-30 23:08:22,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-30 23:08:22,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 23:08:22,080 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:22,084 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 23:08:22,084 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 23:08:22,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 11:08:22 BasicIcfg [2023-08-30 23:08:22,162 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 23:08:22,162 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 23:08:22,162 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 23:08:22,163 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 23:08:22,163 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:08:11" (3/4) ... [2023-08-30 23:08:22,164 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 23:08:22,258 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 23:08:22,258 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 23:08:22,259 INFO L158 Benchmark]: Toolchain (without parser) took 11869.70ms. Allocated memory was 71.3MB in the beginning and 423.6MB in the end (delta: 352.3MB). Free memory was 48.3MB in the beginning and 364.2MB in the end (delta: -315.9MB). Peak memory consumption was 286.3MB. Max. memory is 16.1GB. [2023-08-30 23:08:22,259 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 71.3MB. Free memory is still 49.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 23:08:22,259 INFO L158 Benchmark]: CACSL2BoogieTranslator took 571.93ms. Allocated memory was 71.3MB in the beginning and 90.2MB in the end (delta: 18.9MB). Free memory was 48.1MB in the beginning and 67.5MB in the end (delta: -19.4MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2023-08-30 23:08:22,260 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.08ms. Allocated memory is still 90.2MB. Free memory was 67.5MB in the beginning and 65.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:08:22,260 INFO L158 Benchmark]: Boogie Preprocessor took 57.88ms. Allocated memory is still 90.2MB. Free memory was 65.2MB in the beginning and 63.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:08:22,260 INFO L158 Benchmark]: RCFGBuilder took 634.83ms. Allocated memory is still 90.2MB. Free memory was 63.3MB in the beginning and 54.8MB in the end (delta: 8.5MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2023-08-30 23:08:22,261 INFO L158 Benchmark]: TraceAbstraction took 10428.32ms. Allocated memory was 90.2MB in the beginning and 423.6MB in the end (delta: 333.4MB). Free memory was 54.3MB in the beginning and 125.1MB in the end (delta: -70.7MB). Peak memory consumption was 263.1MB. Max. memory is 16.1GB. [2023-08-30 23:08:22,261 INFO L158 Benchmark]: Witness Printer took 96.09ms. Allocated memory is still 423.6MB. Free memory was 125.1MB in the beginning and 364.2MB in the end (delta: -239.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-08-30 23:08:22,263 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 71.3MB. Free memory is still 49.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 571.93ms. Allocated memory was 71.3MB in the beginning and 90.2MB in the end (delta: 18.9MB). Free memory was 48.1MB in the beginning and 67.5MB in the end (delta: -19.4MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.08ms. Allocated memory is still 90.2MB. Free memory was 67.5MB in the beginning and 65.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.88ms. Allocated memory is still 90.2MB. Free memory was 65.2MB in the beginning and 63.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 634.83ms. Allocated memory is still 90.2MB. Free memory was 63.3MB in the beginning and 54.8MB in the end (delta: 8.5MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10428.32ms. Allocated memory was 90.2MB in the beginning and 423.6MB in the end (delta: 333.4MB). Free memory was 54.3MB in the beginning and 125.1MB in the end (delta: -70.7MB). Peak memory consumption was 263.1MB. Max. memory is 16.1GB. * Witness Printer took 96.09ms. Allocated memory is still 423.6MB. Free memory was 125.1MB in the beginning and 364.2MB in the end (delta: -239.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 120 PlacesBefore, 37 PlacesAfterwards, 112 TransitionsBefore, 28 TransitionsAfterwards, 2216 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 95 TotalNumberOfCompositions, 6622 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3264, independent: 3044, independent conditional: 0, independent unconditional: 3044, dependent: 220, dependent conditional: 0, dependent unconditional: 220, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1231, independent: 1193, independent conditional: 0, independent unconditional: 1193, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3264, independent: 1851, independent conditional: 0, independent unconditional: 1851, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 1231, unknown conditional: 0, unknown unconditional: 1231] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 124, Positive conditional cache size: 0, Positive unconditional cache size: 124, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool a$flush_delayed; [L723] 0 int a$mem_tmp; [L724] 0 _Bool a$r_buff0_thd0; [L725] 0 _Bool a$r_buff0_thd1; [L726] 0 _Bool a$r_buff0_thd2; [L727] 0 _Bool a$r_buff0_thd3; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$read_delayed; [L733] 0 int *a$read_delayed_var; [L734] 0 int a$w_buff0; [L735] 0 _Bool a$w_buff0_used; [L736] 0 int a$w_buff1; [L737] 0 _Bool a$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L850] 0 pthread_t t257; [L851] FCALL, FORK 0 pthread_create(&t257, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t257, ((void *)0), P0, ((void *)0))=-2, t257={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t258; [L751] 1 a$w_buff1 = a$w_buff0 [L752] 1 a$w_buff0 = 1 [L753] 1 a$w_buff1_used = a$w_buff0_used [L754] 1 a$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L756] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L757] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L758] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L759] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L853] FCALL, FORK 0 pthread_create(&t258, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t258, ((void *)0), P1, ((void *)0))=-1, t257={5:0}, t258={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L854] 0 pthread_t t259; [L855] FCALL, FORK 0 pthread_create(&t259, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t259, ((void *)0), P2, ((void *)0))=0, t257={5:0}, t258={6:0}, t259={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L780] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L783] 2 y = 1 [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 a$flush_delayed = weak$$choice2 [L815] 3 a$mem_tmp = a [L816] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L817] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L818] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L819] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L820] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L822] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EBX = a [L824] 3 a = a$flush_delayed ? a$mem_tmp : a [L825] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L792] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L828] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L829] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L830] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L831] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L832] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L862] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L863] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L864] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L865] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t257={5:0}, t258={6:0}, t259={3:0}, weak$$choice2=0, x=1, y=1, z=1] [L868] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 855]: 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: 851]: 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, 145 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: 10.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 463 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 342 mSDsluCounter, 262 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 203 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1150 IncrementalHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 59 mSDtfsCounter, 1150 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=9, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 1013 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-30 23:08:22,293 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