./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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 ../sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bdec055c4bfc04b6b0c3fc918f7b96def91dcb331178222835136af29a7feef5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:09:22,116 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:09:22,118 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:09:22,154 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:09:22,154 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:09:22,155 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:09:22,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:09:22,158 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:09:22,160 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:09:22,163 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:09:22,164 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:09:22,165 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:09:22,166 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:09:22,167 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:09:22,168 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:09:22,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:09:22,171 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:09:22,172 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:09:22,173 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:09:22,177 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:09:22,179 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:09:22,180 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:09:22,180 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:09:22,181 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:09:22,182 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:09:22,187 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:09:22,187 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:09:22,188 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:09:22,189 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:09:22,189 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:09:22,190 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:09:22,190 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:09:22,191 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:09:22,192 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:09:22,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:09:22,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:09:22,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:09:22,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:09:22,194 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:09:22,194 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:09:22,195 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:09:22,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:09:22,197 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 10:09:22,219 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:09:22,220 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:09:22,220 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:09:22,220 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:09:22,221 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:09:22,221 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:09:22,221 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:09:22,221 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:09:22,221 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:09:22,222 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:09:22,222 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 10:09:22,222 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:09:22,223 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 10:09:22,223 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:09:22,223 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:09:22,223 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:09:22,223 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:09:22,223 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 10:09:22,223 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:09:22,225 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:09:22,225 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:09:22,225 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:09:22,225 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:09:22,225 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:09:22,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:09:22,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:09:22,226 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:09:22,226 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:09:22,226 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:09:22,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:09:22,226 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:09:22,227 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:09:22,227 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:09:22,227 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> bdec055c4bfc04b6b0c3fc918f7b96def91dcb331178222835136af29a7feef5 [2022-07-12 10:09:22,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:09:22,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:09:22,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:09:22,426 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:09:22,426 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:09:22,427 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i [2022-07-12 10:09:22,506 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b5aa3e02/30da2e2b267b4a4ea8f67c29c87c0c1d/FLAG2e0d51c47 [2022-07-12 10:09:22,911 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:09:22,911 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i [2022-07-12 10:09:22,926 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b5aa3e02/30da2e2b267b4a4ea8f67c29c87c0c1d/FLAG2e0d51c47 [2022-07-12 10:09:22,946 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b5aa3e02/30da2e2b267b4a4ea8f67c29c87c0c1d [2022-07-12 10:09:22,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:09:22,949 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:09:22,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:09:22,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:09:22,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:09:22,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:09:22" (1/1) ... [2022-07-12 10:09:22,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e41aa75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:22, skipping insertion in model container [2022-07-12 10:09:22,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:09:22" (1/1) ... [2022-07-12 10:09:22,960 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:09:22,997 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:09:23,155 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i[959,972] [2022-07-12 10:09:23,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:09:23,349 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:09:23,362 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i[959,972] [2022-07-12 10:09:23,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:09:23,443 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:09:23,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:23 WrapperNode [2022-07-12 10:09:23,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:09:23,444 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:09:23,444 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:09:23,444 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:09:23,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:23" (1/1) ... [2022-07-12 10:09:23,472 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:23" (1/1) ... [2022-07-12 10:09:23,499 INFO L137 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 274 [2022-07-12 10:09:23,499 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:09:23,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:09:23,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:09:23,500 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:09:23,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:23" (1/1) ... [2022-07-12 10:09:23,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:23" (1/1) ... [2022-07-12 10:09:23,520 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:23" (1/1) ... [2022-07-12 10:09:23,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:23" (1/1) ... [2022-07-12 10:09:23,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:23" (1/1) ... [2022-07-12 10:09:23,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:23" (1/1) ... [2022-07-12 10:09:23,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:23" (1/1) ... [2022-07-12 10:09:23,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:09:23,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:09:23,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:09:23,558 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:09:23,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:23" (1/1) ... [2022-07-12 10:09:23,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:09:23,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:09:23,589 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) [2022-07-12 10:09:23,607 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 [2022-07-12 10:09:23,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:09:23,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-12 10:09:23,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:09:23,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:09:23,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:09:23,627 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-12 10:09:23,627 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-12 10:09:23,627 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-12 10:09:23,627 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-12 10:09:23,627 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-12 10:09:23,627 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-12 10:09:23,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:09:23,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-12 10:09:23,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:09:23,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:09:23,630 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-12 10:09:23,744 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:09:23,746 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:09:24,160 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:09:24,390 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:09:24,390 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 10:09:24,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:09:24 BoogieIcfgContainer [2022-07-12 10:09:24,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:09:24,394 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:09:24,394 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:09:24,396 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:09:24,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:09:22" (1/3) ... [2022-07-12 10:09:24,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15877a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:09:24, skipping insertion in model container [2022-07-12 10:09:24,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:09:23" (2/3) ... [2022-07-12 10:09:24,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15877a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:09:24, skipping insertion in model container [2022-07-12 10:09:24,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:09:24" (3/3) ... [2022-07-12 10:09:24,399 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_power.opt_pso.opt.i [2022-07-12 10:09:24,404 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-12 10:09:24,410 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:09:24,410 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-12 10:09:24,410 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-12 10:09:24,453 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-12 10:09:24,501 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-07-12 10:09:24,549 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2022-07-12 10:09:24,549 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-12 10:09:24,554 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-07-12 10:09:24,554 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-07-12 10:09:24,558 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-07-12 10:09:24,569 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:09:24,578 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5de9c6a9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@15679c62 [2022-07-12 10:09:24,578 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-12 10:09:24,594 INFO L129 PetriNetUnfolder]: 0/58 cut-off events. [2022-07-12 10:09:24,595 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-12 10:09:24,595 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:24,595 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:24,596 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:24,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:24,600 INFO L85 PathProgramCache]: Analyzing trace with hash -401119588, now seen corresponding path program 1 times [2022-07-12 10:09:24,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:24,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106822332] [2022-07-12 10:09:24,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:24,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:24,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:24,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:24,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106822332] [2022-07-12 10:09:24,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106822332] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:24,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:24,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 10:09:24,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659996650] [2022-07-12 10:09:24,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:24,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:09:24,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:24,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:09:24,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:09:24,924 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 114 [2022-07-12 10:09:24,926 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:24,927 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:24,927 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 114 [2022-07-12 10:09:24,928 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:25,040 INFO L129 PetriNetUnfolder]: 57/323 cut-off events. [2022-07-12 10:09:25,042 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-07-12 10:09:25,044 INFO L84 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 323 events. 57/323 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1323 event pairs, 11 based on Foata normal form. 12/318 useless extension candidates. Maximal degree in co-relation 397. Up to 75 conditions per place. [2022-07-12 10:09:25,047 INFO L132 encePairwiseOnDemand]: 109/114 looper letters, 13 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2022-07-12 10:09:25,048 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 112 transitions, 266 flow [2022-07-12 10:09:25,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:09:25,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:09:25,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2022-07-12 10:09:25,063 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.935672514619883 [2022-07-12 10:09:25,063 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions. [2022-07-12 10:09:25,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions. [2022-07-12 10:09:25,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:25,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions. [2022-07-12 10:09:25,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:25,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:25,079 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:25,081 INFO L186 Difference]: Start difference. First operand has 119 places, 111 transitions, 231 flow. Second operand 3 states and 320 transitions. [2022-07-12 10:09:25,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 112 transitions, 266 flow [2022-07-12 10:09:25,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 112 transitions, 262 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-12 10:09:25,087 INFO L242 Difference]: Finished difference. Result has 116 places, 107 transitions, 224 flow [2022-07-12 10:09:25,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2022-07-12 10:09:25,091 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2022-07-12 10:09:25,091 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 224 flow [2022-07-12 10:09:25,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:25,092 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:25,092 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:25,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:09:25,093 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:25,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:25,094 INFO L85 PathProgramCache]: Analyzing trace with hash -824296931, now seen corresponding path program 1 times [2022-07-12 10:09:25,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:25,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979412201] [2022-07-12 10:09:25,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:25,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:25,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:25,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:25,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979412201] [2022-07-12 10:09:25,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979412201] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:25,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:25,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:09:25,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17294049] [2022-07-12 10:09:25,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:25,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:09:25,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:25,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:09:25,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:09:25,359 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 114 [2022-07-12 10:09:25,359 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:25,359 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:25,363 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 114 [2022-07-12 10:09:25,363 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:25,687 INFO L129 PetriNetUnfolder]: 330/1074 cut-off events. [2022-07-12 10:09:25,687 INFO L130 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-07-12 10:09:25,690 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1702 conditions, 1074 events. 330/1074 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7265 event pairs, 53 based on Foata normal form. 0/1043 useless extension candidates. Maximal degree in co-relation 1651. Up to 257 conditions per place. [2022-07-12 10:09:25,692 INFO L132 encePairwiseOnDemand]: 108/114 looper letters, 18 selfloop transitions, 2 changer transitions 45/144 dead transitions. [2022-07-12 10:09:25,692 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 144 transitions, 420 flow [2022-07-12 10:09:25,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:09:25,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:09:25,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 893 transitions. [2022-07-12 10:09:25,695 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8703703703703703 [2022-07-12 10:09:25,695 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 893 transitions. [2022-07-12 10:09:25,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 893 transitions. [2022-07-12 10:09:25,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:25,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 893 transitions. [2022-07-12 10:09:25,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.22222222222223) internal successors, (893), 9 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:25,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:25,700 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:25,701 INFO L186 Difference]: Start difference. First operand has 116 places, 107 transitions, 224 flow. Second operand 9 states and 893 transitions. [2022-07-12 10:09:25,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 144 transitions, 420 flow [2022-07-12 10:09:25,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 144 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-12 10:09:25,704 INFO L242 Difference]: Finished difference. Result has 129 places, 95 transitions, 216 flow [2022-07-12 10:09:25,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=216, PETRI_PLACES=129, PETRI_TRANSITIONS=95} [2022-07-12 10:09:25,705 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2022-07-12 10:09:25,705 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 95 transitions, 216 flow [2022-07-12 10:09:25,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:25,705 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:25,705 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:25,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 10:09:25,706 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:25,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:25,706 INFO L85 PathProgramCache]: Analyzing trace with hash -969752196, now seen corresponding path program 1 times [2022-07-12 10:09:25,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:25,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322436721] [2022-07-12 10:09:25,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:25,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:25,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:25,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:25,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322436721] [2022-07-12 10:09:25,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322436721] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:25,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:25,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:09:25,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553232296] [2022-07-12 10:09:25,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:25,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:09:25,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:25,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:09:25,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:09:25,875 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 114 [2022-07-12 10:09:25,876 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 95 transitions, 216 flow. Second operand has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:25,876 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:25,876 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 114 [2022-07-12 10:09:25,876 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:26,149 INFO L129 PetriNetUnfolder]: 268/661 cut-off events. [2022-07-12 10:09:26,149 INFO L130 PetriNetUnfolder]: For 155/155 co-relation queries the response was YES. [2022-07-12 10:09:26,151 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1311 conditions, 661 events. 268/661 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3757 event pairs, 54 based on Foata normal form. 16/649 useless extension candidates. Maximal degree in co-relation 1252. Up to 141 conditions per place. [2022-07-12 10:09:26,153 INFO L132 encePairwiseOnDemand]: 106/114 looper letters, 20 selfloop transitions, 4 changer transitions 32/133 dead transitions. [2022-07-12 10:09:26,153 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 133 transitions, 429 flow [2022-07-12 10:09:26,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:09:26,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-12 10:09:26,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 968 transitions. [2022-07-12 10:09:26,155 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8491228070175438 [2022-07-12 10:09:26,155 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 968 transitions. [2022-07-12 10:09:26,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 968 transitions. [2022-07-12 10:09:26,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:26,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 968 transitions. [2022-07-12 10:09:26,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.8) internal successors, (968), 10 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:26,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:26,160 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:26,160 INFO L186 Difference]: Start difference. First operand has 129 places, 95 transitions, 216 flow. Second operand 10 states and 968 transitions. [2022-07-12 10:09:26,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 133 transitions, 429 flow [2022-07-12 10:09:26,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 133 transitions, 395 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-07-12 10:09:26,165 INFO L242 Difference]: Finished difference. Result has 120 places, 95 transitions, 230 flow [2022-07-12 10:09:26,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=230, PETRI_PLACES=120, PETRI_TRANSITIONS=95} [2022-07-12 10:09:26,166 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 1 predicate places. [2022-07-12 10:09:26,166 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 95 transitions, 230 flow [2022-07-12 10:09:26,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:26,166 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:26,166 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:26,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 10:09:26,167 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:26,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:26,167 INFO L85 PathProgramCache]: Analyzing trace with hash -143836331, now seen corresponding path program 1 times [2022-07-12 10:09:26,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:26,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595646493] [2022-07-12 10:09:26,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:26,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:26,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:26,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:26,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595646493] [2022-07-12 10:09:26,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595646493] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:26,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:26,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:09:26,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822910568] [2022-07-12 10:09:26,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:26,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:09:26,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:26,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:09:26,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:09:26,250 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2022-07-12 10:09:26,251 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 95 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:26,251 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:26,251 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2022-07-12 10:09:26,251 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:26,498 INFO L129 PetriNetUnfolder]: 326/791 cut-off events. [2022-07-12 10:09:26,498 INFO L130 PetriNetUnfolder]: For 266/266 co-relation queries the response was YES. [2022-07-12 10:09:26,500 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1622 conditions, 791 events. 326/791 cut-off events. For 266/266 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4051 event pairs, 161 based on Foata normal form. 18/771 useless extension candidates. Maximal degree in co-relation 1560. Up to 332 conditions per place. [2022-07-12 10:09:26,503 INFO L132 encePairwiseOnDemand]: 107/114 looper letters, 21 selfloop transitions, 3 changer transitions 31/133 dead transitions. [2022-07-12 10:09:26,503 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 133 transitions, 442 flow [2022-07-12 10:09:26,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:09:26,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:09:26,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 885 transitions. [2022-07-12 10:09:26,505 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8625730994152047 [2022-07-12 10:09:26,505 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 885 transitions. [2022-07-12 10:09:26,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 885 transitions. [2022-07-12 10:09:26,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:26,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 885 transitions. [2022-07-12 10:09:26,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.33333333333333) internal successors, (885), 9 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:26,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:26,509 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:26,509 INFO L186 Difference]: Start difference. First operand has 120 places, 95 transitions, 230 flow. Second operand 9 states and 885 transitions. [2022-07-12 10:09:26,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 133 transitions, 442 flow [2022-07-12 10:09:26,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 133 transitions, 396 flow, removed 18 selfloop flow, removed 10 redundant places. [2022-07-12 10:09:26,514 INFO L242 Difference]: Finished difference. Result has 119 places, 97 transitions, 247 flow [2022-07-12 10:09:26,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=247, PETRI_PLACES=119, PETRI_TRANSITIONS=97} [2022-07-12 10:09:26,515 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 0 predicate places. [2022-07-12 10:09:26,515 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 97 transitions, 247 flow [2022-07-12 10:09:26,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:26,516 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:26,516 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:26,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 10:09:26,516 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:26,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:26,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1014147123, now seen corresponding path program 1 times [2022-07-12 10:09:26,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:26,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856595374] [2022-07-12 10:09:26,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:26,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:26,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:26,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:26,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856595374] [2022-07-12 10:09:26,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856595374] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:26,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:26,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:09:26,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54643592] [2022-07-12 10:09:26,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:26,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:09:26,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:26,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:09:26,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:09:26,642 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2022-07-12 10:09:26,643 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 97 transitions, 247 flow. Second operand has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:26,643 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:26,643 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2022-07-12 10:09:26,643 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:26,893 INFO L129 PetriNetUnfolder]: 358/930 cut-off events. [2022-07-12 10:09:26,893 INFO L130 PetriNetUnfolder]: For 685/691 co-relation queries the response was YES. [2022-07-12 10:09:26,896 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2076 conditions, 930 events. 358/930 cut-off events. For 685/691 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5502 event pairs, 106 based on Foata normal form. 20/913 useless extension candidates. Maximal degree in co-relation 2016. Up to 243 conditions per place. [2022-07-12 10:09:26,899 INFO L132 encePairwiseOnDemand]: 108/114 looper letters, 24 selfloop transitions, 3 changer transitions 28/133 dead transitions. [2022-07-12 10:09:26,899 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 133 transitions, 485 flow [2022-07-12 10:09:26,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:09:26,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:09:26,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 884 transitions. [2022-07-12 10:09:26,902 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8615984405458089 [2022-07-12 10:09:26,902 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 884 transitions. [2022-07-12 10:09:26,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 884 transitions. [2022-07-12 10:09:26,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:26,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 884 transitions. [2022-07-12 10:09:26,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.22222222222223) internal successors, (884), 9 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:26,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:26,907 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:26,907 INFO L186 Difference]: Start difference. First operand has 119 places, 97 transitions, 247 flow. Second operand 9 states and 884 transitions. [2022-07-12 10:09:26,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 133 transitions, 485 flow [2022-07-12 10:09:26,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 133 transitions, 454 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-07-12 10:09:26,911 INFO L242 Difference]: Finished difference. Result has 124 places, 97 transitions, 259 flow [2022-07-12 10:09:26,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=259, PETRI_PLACES=124, PETRI_TRANSITIONS=97} [2022-07-12 10:09:26,914 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 5 predicate places. [2022-07-12 10:09:26,915 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 97 transitions, 259 flow [2022-07-12 10:09:26,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:26,915 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:26,915 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:26,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 10:09:26,916 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:26,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:26,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1964596618, now seen corresponding path program 1 times [2022-07-12 10:09:26,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:26,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824626889] [2022-07-12 10:09:26,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:26,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:27,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:27,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:27,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824626889] [2022-07-12 10:09:27,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824626889] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:27,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:27,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 10:09:27,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556607589] [2022-07-12 10:09:27,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:27,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 10:09:27,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:27,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 10:09:27,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-07-12 10:09:27,153 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2022-07-12 10:09:27,154 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 97 transitions, 259 flow. Second operand has 12 states, 12 states have (on average 89.41666666666667) internal successors, (1073), 12 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:27,155 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:27,155 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2022-07-12 10:09:27,155 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:27,488 INFO L129 PetriNetUnfolder]: 409/1099 cut-off events. [2022-07-12 10:09:27,488 INFO L130 PetriNetUnfolder]: For 1348/1356 co-relation queries the response was YES. [2022-07-12 10:09:27,492 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2516 conditions, 1099 events. 409/1099 cut-off events. For 1348/1356 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6791 event pairs, 220 based on Foata normal form. 30/1067 useless extension candidates. Maximal degree in co-relation 2447. Up to 423 conditions per place. [2022-07-12 10:09:27,496 INFO L132 encePairwiseOnDemand]: 100/114 looper letters, 20 selfloop transitions, 11 changer transitions 28/135 dead transitions. [2022-07-12 10:09:27,496 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 135 transitions, 489 flow [2022-07-12 10:09:27,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 10:09:27,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-07-12 10:09:27,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1381 transitions. [2022-07-12 10:09:27,499 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8076023391812865 [2022-07-12 10:09:27,499 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1381 transitions. [2022-07-12 10:09:27,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1381 transitions. [2022-07-12 10:09:27,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:27,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1381 transitions. [2022-07-12 10:09:27,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 92.06666666666666) internal successors, (1381), 15 states have internal predecessors, (1381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:27,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:27,505 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:27,505 INFO L186 Difference]: Start difference. First operand has 124 places, 97 transitions, 259 flow. Second operand 15 states and 1381 transitions. [2022-07-12 10:09:27,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 135 transitions, 489 flow [2022-07-12 10:09:27,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 135 transitions, 452 flow, removed 17 selfloop flow, removed 7 redundant places. [2022-07-12 10:09:27,512 INFO L242 Difference]: Finished difference. Result has 133 places, 102 transitions, 311 flow [2022-07-12 10:09:27,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=311, PETRI_PLACES=133, PETRI_TRANSITIONS=102} [2022-07-12 10:09:27,513 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 14 predicate places. [2022-07-12 10:09:27,513 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 102 transitions, 311 flow [2022-07-12 10:09:27,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 89.41666666666667) internal successors, (1073), 12 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:27,514 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:27,514 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:27,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 10:09:27,515 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:27,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:27,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1077524961, now seen corresponding path program 1 times [2022-07-12 10:09:27,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:27,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827025726] [2022-07-12 10:09:27,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:27,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:27,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:27,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:27,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827025726] [2022-07-12 10:09:27,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827025726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:27,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:27,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 10:09:27,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375650842] [2022-07-12 10:09:27,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:27,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 10:09:27,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:27,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 10:09:27,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:09:27,689 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2022-07-12 10:09:27,690 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 102 transitions, 311 flow. Second operand has 11 states, 11 states have (on average 90.54545454545455) internal successors, (996), 11 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:27,690 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:27,691 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2022-07-12 10:09:27,691 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:27,998 INFO L129 PetriNetUnfolder]: 311/870 cut-off events. [2022-07-12 10:09:27,998 INFO L130 PetriNetUnfolder]: For 2224/2318 co-relation queries the response was YES. [2022-07-12 10:09:28,024 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2803 conditions, 870 events. 311/870 cut-off events. For 2224/2318 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5105 event pairs, 137 based on Foata normal form. 12/835 useless extension candidates. Maximal degree in co-relation 2727. Up to 412 conditions per place. [2022-07-12 10:09:28,028 INFO L132 encePairwiseOnDemand]: 102/114 looper letters, 26 selfloop transitions, 10 changer transitions 26/139 dead transitions. [2022-07-12 10:09:28,028 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 139 transitions, 663 flow [2022-07-12 10:09:28,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:09:28,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-12 10:09:28,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1217 transitions. [2022-07-12 10:09:28,030 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8211875843454791 [2022-07-12 10:09:28,030 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1217 transitions. [2022-07-12 10:09:28,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1217 transitions. [2022-07-12 10:09:28,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:28,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1217 transitions. [2022-07-12 10:09:28,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 93.61538461538461) internal successors, (1217), 13 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:28,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:28,035 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:28,035 INFO L186 Difference]: Start difference. First operand has 133 places, 102 transitions, 311 flow. Second operand 13 states and 1217 transitions. [2022-07-12 10:09:28,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 139 transitions, 663 flow [2022-07-12 10:09:28,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 139 transitions, 639 flow, removed 7 selfloop flow, removed 8 redundant places. [2022-07-12 10:09:28,040 INFO L242 Difference]: Finished difference. Result has 138 places, 106 transitions, 368 flow [2022-07-12 10:09:28,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=368, PETRI_PLACES=138, PETRI_TRANSITIONS=106} [2022-07-12 10:09:28,040 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 19 predicate places. [2022-07-12 10:09:28,040 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 106 transitions, 368 flow [2022-07-12 10:09:28,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.54545454545455) internal successors, (996), 11 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:28,041 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:28,041 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:28,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 10:09:28,041 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:28,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:28,041 INFO L85 PathProgramCache]: Analyzing trace with hash -393449371, now seen corresponding path program 2 times [2022-07-12 10:09:28,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:28,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633660573] [2022-07-12 10:09:28,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:28,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:28,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:28,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:28,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633660573] [2022-07-12 10:09:28,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633660573] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:28,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:28,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:09:28,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743236477] [2022-07-12 10:09:28,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:28,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:09:28,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:28,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:09:28,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:09:28,174 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 114 [2022-07-12 10:09:28,175 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 106 transitions, 368 flow. Second operand has 8 states, 8 states have (on average 92.875) internal successors, (743), 8 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:28,175 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:28,175 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 114 [2022-07-12 10:09:28,175 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:28,582 INFO L129 PetriNetUnfolder]: 390/1086 cut-off events. [2022-07-12 10:09:28,582 INFO L130 PetriNetUnfolder]: For 7533/7661 co-relation queries the response was YES. [2022-07-12 10:09:28,586 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4629 conditions, 1086 events. 390/1086 cut-off events. For 7533/7661 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6810 event pairs, 100 based on Foata normal form. 30/1063 useless extension candidates. Maximal degree in co-relation 4552. Up to 377 conditions per place. [2022-07-12 10:09:28,589 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 26 selfloop transitions, 11 changer transitions 25/141 dead transitions. [2022-07-12 10:09:28,590 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 141 transitions, 870 flow [2022-07-12 10:09:28,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:09:28,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-12 10:09:28,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1057 transitions. [2022-07-12 10:09:28,592 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8429027113237639 [2022-07-12 10:09:28,592 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1057 transitions. [2022-07-12 10:09:28,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1057 transitions. [2022-07-12 10:09:28,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:28,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1057 transitions. [2022-07-12 10:09:28,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 96.0909090909091) internal successors, (1057), 11 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:28,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:28,596 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:28,596 INFO L186 Difference]: Start difference. First operand has 138 places, 106 transitions, 368 flow. Second operand 11 states and 1057 transitions. [2022-07-12 10:09:28,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 141 transitions, 870 flow [2022-07-12 10:09:28,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 141 transitions, 721 flow, removed 73 selfloop flow, removed 8 redundant places. [2022-07-12 10:09:28,603 INFO L242 Difference]: Finished difference. Result has 141 places, 109 transitions, 428 flow [2022-07-12 10:09:28,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=428, PETRI_PLACES=141, PETRI_TRANSITIONS=109} [2022-07-12 10:09:28,605 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 22 predicate places. [2022-07-12 10:09:28,605 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 109 transitions, 428 flow [2022-07-12 10:09:28,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.875) internal successors, (743), 8 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:28,605 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:28,606 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:28,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 10:09:28,606 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:28,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:28,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1954014332, now seen corresponding path program 1 times [2022-07-12 10:09:28,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:28,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625756270] [2022-07-12 10:09:28,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:28,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:28,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:28,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:28,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625756270] [2022-07-12 10:09:28,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625756270] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:28,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:28,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:09:28,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563312301] [2022-07-12 10:09:28,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:28,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:09:28,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:28,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:09:28,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:09:28,681 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-07-12 10:09:28,681 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 109 transitions, 428 flow. Second operand has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:28,681 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:28,681 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-07-12 10:09:28,681 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:29,192 INFO L129 PetriNetUnfolder]: 1645/3267 cut-off events. [2022-07-12 10:09:29,192 INFO L130 PetriNetUnfolder]: For 29678/30128 co-relation queries the response was YES. [2022-07-12 10:09:29,201 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13738 conditions, 3267 events. 1645/3267 cut-off events. For 29678/30128 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 22795 event pairs, 74 based on Foata normal form. 175/3306 useless extension candidates. Maximal degree in co-relation 13661. Up to 1055 conditions per place. [2022-07-12 10:09:29,211 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 45 selfloop transitions, 6 changer transitions 74/204 dead transitions. [2022-07-12 10:09:29,212 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 204 transitions, 1503 flow [2022-07-12 10:09:29,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:09:29,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-12 10:09:29,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 982 transitions. [2022-07-12 10:09:29,215 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8614035087719298 [2022-07-12 10:09:29,215 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 982 transitions. [2022-07-12 10:09:29,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 982 transitions. [2022-07-12 10:09:29,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:29,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 982 transitions. [2022-07-12 10:09:29,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.2) internal successors, (982), 10 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:29,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:29,219 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:29,219 INFO L186 Difference]: Start difference. First operand has 141 places, 109 transitions, 428 flow. Second operand 10 states and 982 transitions. [2022-07-12 10:09:29,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 204 transitions, 1503 flow [2022-07-12 10:09:29,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 204 transitions, 1391 flow, removed 36 selfloop flow, removed 6 redundant places. [2022-07-12 10:09:29,232 INFO L242 Difference]: Finished difference. Result has 144 places, 111 transitions, 453 flow [2022-07-12 10:09:29,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=453, PETRI_PLACES=144, PETRI_TRANSITIONS=111} [2022-07-12 10:09:29,233 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 25 predicate places. [2022-07-12 10:09:29,233 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 111 transitions, 453 flow [2022-07-12 10:09:29,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:29,234 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:29,234 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:29,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 10:09:29,235 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:29,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:29,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1900743553, now seen corresponding path program 1 times [2022-07-12 10:09:29,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:29,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750680624] [2022-07-12 10:09:29,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:29,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:29,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:29,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750680624] [2022-07-12 10:09:29,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750680624] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:29,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:29,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:09:29,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710199601] [2022-07-12 10:09:29,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:29,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:09:29,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:29,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:09:29,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:09:29,307 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-07-12 10:09:29,308 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 111 transitions, 453 flow. Second operand has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:29,308 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:29,308 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-07-12 10:09:29,308 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:29,626 INFO L129 PetriNetUnfolder]: 540/1355 cut-off events. [2022-07-12 10:09:29,626 INFO L130 PetriNetUnfolder]: For 9622/9787 co-relation queries the response was YES. [2022-07-12 10:09:29,632 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5827 conditions, 1355 events. 540/1355 cut-off events. For 9622/9787 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8565 event pairs, 28 based on Foata normal form. 107/1433 useless extension candidates. Maximal degree in co-relation 5747. Up to 368 conditions per place. [2022-07-12 10:09:29,636 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 47 selfloop transitions, 9 changer transitions 41/176 dead transitions. [2022-07-12 10:09:29,636 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 176 transitions, 1304 flow [2022-07-12 10:09:29,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:09:29,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-12 10:09:29,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 976 transitions. [2022-07-12 10:09:29,638 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.856140350877193 [2022-07-12 10:09:29,639 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 976 transitions. [2022-07-12 10:09:29,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 976 transitions. [2022-07-12 10:09:29,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:29,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 976 transitions. [2022-07-12 10:09:29,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.6) internal successors, (976), 10 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:29,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:29,643 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:29,643 INFO L186 Difference]: Start difference. First operand has 144 places, 111 transitions, 453 flow. Second operand 10 states and 976 transitions. [2022-07-12 10:09:29,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 176 transitions, 1304 flow [2022-07-12 10:09:29,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 176 transitions, 1280 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-07-12 10:09:29,651 INFO L242 Difference]: Finished difference. Result has 148 places, 114 transitions, 521 flow [2022-07-12 10:09:29,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=521, PETRI_PLACES=148, PETRI_TRANSITIONS=114} [2022-07-12 10:09:29,652 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 29 predicate places. [2022-07-12 10:09:29,652 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 114 transitions, 521 flow [2022-07-12 10:09:29,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:29,653 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:29,653 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:29,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 10:09:29,653 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:29,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:29,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1261261089, now seen corresponding path program 1 times [2022-07-12 10:09:29,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:29,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224581736] [2022-07-12 10:09:29,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:29,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:29,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:29,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:29,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224581736] [2022-07-12 10:09:29,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224581736] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:29,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:29,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:09:29,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043858596] [2022-07-12 10:09:29,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:29,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:09:29,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:29,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:09:29,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:09:29,734 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-07-12 10:09:29,734 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 114 transitions, 521 flow. Second operand has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:29,734 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:29,734 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-07-12 10:09:29,735 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:29,938 INFO L129 PetriNetUnfolder]: 172/566 cut-off events. [2022-07-12 10:09:29,938 INFO L130 PetriNetUnfolder]: For 3722/3787 co-relation queries the response was YES. [2022-07-12 10:09:29,941 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2437 conditions, 566 events. 172/566 cut-off events. For 3722/3787 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2848 event pairs, 13 based on Foata normal form. 31/584 useless extension candidates. Maximal degree in co-relation 2370. Up to 135 conditions per place. [2022-07-12 10:09:29,942 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 29 selfloop transitions, 12 changer transitions 30/149 dead transitions. [2022-07-12 10:09:29,942 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 149 transitions, 1045 flow [2022-07-12 10:09:29,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:09:29,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-12 10:09:29,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1046 transitions. [2022-07-12 10:09:29,946 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8341307814992025 [2022-07-12 10:09:29,946 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1046 transitions. [2022-07-12 10:09:29,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1046 transitions. [2022-07-12 10:09:29,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:29,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1046 transitions. [2022-07-12 10:09:29,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 95.0909090909091) internal successors, (1046), 11 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:29,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:29,950 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:29,950 INFO L186 Difference]: Start difference. First operand has 148 places, 114 transitions, 521 flow. Second operand 11 states and 1046 transitions. [2022-07-12 10:09:29,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 149 transitions, 1045 flow [2022-07-12 10:09:29,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 149 transitions, 892 flow, removed 66 selfloop flow, removed 13 redundant places. [2022-07-12 10:09:29,956 INFO L242 Difference]: Finished difference. Result has 147 places, 108 transitions, 425 flow [2022-07-12 10:09:29,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=425, PETRI_PLACES=147, PETRI_TRANSITIONS=108} [2022-07-12 10:09:29,957 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 28 predicate places. [2022-07-12 10:09:29,957 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 108 transitions, 425 flow [2022-07-12 10:09:29,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:09:29,957 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:29,957 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:29,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 10:09:29,957 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:29,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:29,958 INFO L85 PathProgramCache]: Analyzing trace with hash -2041991158, now seen corresponding path program 1 times [2022-07-12 10:09:29,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:29,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285995244] [2022-07-12 10:09:29,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:29,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:09:30,006 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 10:09:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:09:30,065 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 10:09:30,065 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 10:09:30,066 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-07-12 10:09:30,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-07-12 10:09:30,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-07-12 10:09:30,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-07-12 10:09:30,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-07-12 10:09:30,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-07-12 10:09:30,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 10:09:30,069 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:30,074 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-12 10:09:30,074 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 10:09:30,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 10:09:30 BasicIcfg [2022-07-12 10:09:30,159 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 10:09:30,160 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 10:09:30,160 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 10:09:30,160 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 10:09:30,160 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:09:24" (3/4) ... [2022-07-12 10:09:30,161 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 10:09:30,224 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 10:09:30,224 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 10:09:30,225 INFO L158 Benchmark]: Toolchain (without parser) took 7275.82ms. Allocated memory was 90.2MB in the beginning and 264.2MB in the end (delta: 174.1MB). Free memory was 53.7MB in the beginning and 111.5MB in the end (delta: -57.8MB). Peak memory consumption was 115.1MB. Max. memory is 16.1GB. [2022-07-12 10:09:30,225 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 90.2MB. Free memory was 60.4MB in the beginning and 60.4MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 10:09:30,225 INFO L158 Benchmark]: CACSL2BoogieTranslator took 491.30ms. Allocated memory was 90.2MB in the beginning and 138.4MB in the end (delta: 48.2MB). Free memory was 53.5MB in the beginning and 99.9MB in the end (delta: -46.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 10:09:30,225 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.40ms. Allocated memory is still 138.4MB. Free memory was 99.9MB in the beginning and 97.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 10:09:30,226 INFO L158 Benchmark]: Boogie Preprocessor took 56.57ms. Allocated memory is still 138.4MB. Free memory was 97.1MB in the beginning and 95.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 10:09:30,226 INFO L158 Benchmark]: RCFGBuilder took 834.95ms. Allocated memory is still 138.4MB. Free memory was 95.0MB in the beginning and 83.7MB in the end (delta: 11.3MB). Peak memory consumption was 61.6MB. Max. memory is 16.1GB. [2022-07-12 10:09:30,226 INFO L158 Benchmark]: TraceAbstraction took 5765.51ms. Allocated memory was 138.4MB in the beginning and 264.2MB in the end (delta: 125.8MB). Free memory was 83.4MB in the beginning and 136.6MB in the end (delta: -53.3MB). Peak memory consumption was 72.6MB. Max. memory is 16.1GB. [2022-07-12 10:09:30,226 INFO L158 Benchmark]: Witness Printer took 64.75ms. Allocated memory is still 264.2MB. Free memory was 136.6MB in the beginning and 111.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-07-12 10:09:30,227 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 90.2MB. Free memory was 60.4MB in the beginning and 60.4MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 491.30ms. Allocated memory was 90.2MB in the beginning and 138.4MB in the end (delta: 48.2MB). Free memory was 53.5MB in the beginning and 99.9MB in the end (delta: -46.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.40ms. Allocated memory is still 138.4MB. Free memory was 99.9MB in the beginning and 97.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.57ms. Allocated memory is still 138.4MB. Free memory was 97.1MB in the beginning and 95.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 834.95ms. Allocated memory is still 138.4MB. Free memory was 95.0MB in the beginning and 83.7MB in the end (delta: 11.3MB). Peak memory consumption was 61.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5765.51ms. Allocated memory was 138.4MB in the beginning and 264.2MB in the end (delta: 125.8MB). Free memory was 83.4MB in the beginning and 136.6MB in the end (delta: -53.3MB). Peak memory consumption was 72.6MB. Max. memory is 16.1GB. * Witness Printer took 64.75ms. Allocated memory is still 264.2MB. Free memory was 136.6MB in the beginning and 111.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L716] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L717] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L718] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L719] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L720] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L721] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L722] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L723] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L724] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L725] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L726] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L727] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L728] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L729] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L730] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L731] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L733] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L735] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L818] 0 pthread_t t2028; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2028={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L819] FCALL, FORK 0 pthread_create(&t2028, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2028, ((void *)0), P0, ((void *)0))=-2, t2028={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] 0 pthread_t t2029; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2028={5:0}, t2029={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L821] FCALL, FORK 0 pthread_create(&t2029, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2029, ((void *)0), P1, ((void *)0))=-1, t2028={5:0}, t2029={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] 0 pthread_t t2030; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2028={5:0}, t2029={6:0}, t2030={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L823] FCALL, FORK 0 pthread_create(&t2030, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2030, ((void *)0), P2, ((void *)0))=0, t2028={5:0}, t2029={6:0}, t2030={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, 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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=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$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, 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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028={5:0}, t2029={6:0}, t2030={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028={5:0}, t2029={6:0}, t2030={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - 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: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 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: 5.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 524 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 524 mSDsluCounter, 368 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 753 mSDsCounter, 122 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1230 IncrementalHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 122 mSolverCounterUnsat, 83 mSDtfsCounter, 1230 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 141 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=521occurred in iteration=10, InterpolantAutomatonStates: 110, 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, 1.0s InterpolantComputationTime, 934 NumberOfCodeBlocks, 934 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 835 ConstructedInterpolants, 0 QuantifiedInterpolants, 3456 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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! [2022-07-12 10:09:30,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE