./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix001.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/mix001.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 21c0308f80ae5e3a4b410ebaece3730b9f788bd0cc89fb6ef65f8dd9f7120f36 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 21:44:00,881 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 21:44:00,885 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 21:44:00,920 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 21:44:00,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 21:44:00,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 21:44:00,924 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 21:44:00,929 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 21:44:00,931 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 21:44:00,935 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 21:44:00,936 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 21:44:00,938 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 21:44:00,938 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 21:44:00,940 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 21:44:00,942 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 21:44:00,944 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 21:44:00,945 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 21:44:00,947 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 21:44:00,948 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 21:44:00,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 21:44:00,955 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 21:44:00,956 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 21:44:00,956 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 21:44:00,957 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 21:44:00,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 21:44:00,965 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 21:44:00,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 21:44:00,966 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 21:44:00,967 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 21:44:00,967 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 21:44:00,968 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 21:44:00,969 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 21:44:00,971 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 21:44:00,971 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 21:44:00,972 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 21:44:00,973 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 21:44:00,974 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 21:44:00,974 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 21:44:00,974 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 21:44:00,975 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 21:44:00,975 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 21:44:00,977 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 21:44:00,978 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 21:44:01,012 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 21:44:01,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 21:44:01,013 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 21:44:01,013 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 21:44:01,014 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 21:44:01,014 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 21:44:01,015 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 21:44:01,015 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 21:44:01,015 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 21:44:01,016 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 21:44:01,016 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 21:44:01,016 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 21:44:01,017 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 21:44:01,017 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 21:44:01,017 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 21:44:01,017 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 21:44:01,017 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 21:44:01,018 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 21:44:01,018 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 21:44:01,019 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 21:44:01,019 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 21:44:01,019 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 21:44:01,020 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 21:44:01,020 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 21:44:01,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:44:01,020 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 21:44:01,020 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 21:44:01,021 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 21:44:01,021 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 21:44:01,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 21:44:01,021 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 21:44:01,022 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 21:44:01,022 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 21:44:01,022 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 -> 21c0308f80ae5e3a4b410ebaece3730b9f788bd0cc89fb6ef65f8dd9f7120f36 [2022-07-13 21:44:01,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 21:44:01,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 21:44:01,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 21:44:01,232 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 21:44:01,232 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 21:44:01,233 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix001.opt.i [2022-07-13 21:44:01,309 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca9ce36b7/ea80bfc3c74b49789e5d74aac93f8e47/FLAG55ae4a3cb [2022-07-13 21:44:01,748 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 21:44:01,749 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix001.opt.i [2022-07-13 21:44:01,764 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca9ce36b7/ea80bfc3c74b49789e5d74aac93f8e47/FLAG55ae4a3cb [2022-07-13 21:44:01,781 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca9ce36b7/ea80bfc3c74b49789e5d74aac93f8e47 [2022-07-13 21:44:01,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 21:44:01,784 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 21:44:01,786 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 21:44:01,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 21:44:01,789 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 21:44:01,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:44:01" (1/1) ... [2022-07-13 21:44:01,790 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@274e2f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:44:01, skipping insertion in model container [2022-07-13 21:44:01,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:44:01" (1/1) ... [2022-07-13 21:44:01,795 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 21:44:01,843 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 21:44:02,004 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/mix001.opt.i[944,957] [2022-07-13 21:44:02,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:44:02,215 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 21:44:02,228 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/mix001.opt.i[944,957] [2022-07-13 21:44:02,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:44:02,325 INFO L208 MainTranslator]: Completed translation [2022-07-13 21:44:02,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:44:02 WrapperNode [2022-07-13 21:44:02,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 21:44:02,327 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 21:44:02,327 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 21:44:02,327 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 21:44:02,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:44:02" (1/1) ... [2022-07-13 21:44:02,361 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:44:02" (1/1) ... [2022-07-13 21:44:02,399 INFO L137 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 282 [2022-07-13 21:44:02,400 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 21:44:02,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 21:44:02,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 21:44:02,401 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 21:44:02,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:44:02" (1/1) ... [2022-07-13 21:44:02,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:44:02" (1/1) ... [2022-07-13 21:44:02,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:44:02" (1/1) ... [2022-07-13 21:44:02,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:44:02" (1/1) ... [2022-07-13 21:44:02,421 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:44:02" (1/1) ... [2022-07-13 21:44:02,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:44:02" (1/1) ... [2022-07-13 21:44:02,428 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:44:02" (1/1) ... [2022-07-13 21:44:02,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 21:44:02,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 21:44:02,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 21:44:02,433 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 21:44:02,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:44:02" (1/1) ... [2022-07-13 21:44:02,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:44:02,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:44:02,473 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-13 21:44:02,484 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-13 21:44:02,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 21:44:02,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-13 21:44:02,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 21:44:02,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 21:44:02,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 21:44:02,511 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-13 21:44:02,511 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-13 21:44:02,511 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-13 21:44:02,511 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-13 21:44:02,511 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-13 21:44:02,512 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-13 21:44:02,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 21:44:02,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-13 21:44:02,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 21:44:02,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 21:44:02,514 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-13 21:44:02,659 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 21:44:02,661 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 21:44:03,085 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 21:44:03,414 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 21:44:03,414 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 21:44:03,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:44:03 BoogieIcfgContainer [2022-07-13 21:44:03,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 21:44:03,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 21:44:03,419 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 21:44:03,422 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 21:44:03,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 09:44:01" (1/3) ... [2022-07-13 21:44:03,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5021c2b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:44:03, skipping insertion in model container [2022-07-13 21:44:03,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:44:02" (2/3) ... [2022-07-13 21:44:03,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5021c2b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:44:03, skipping insertion in model container [2022-07-13 21:44:03,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:44:03" (3/3) ... [2022-07-13 21:44:03,425 INFO L111 eAbstractionObserver]: Analyzing ICFG mix001.opt.i [2022-07-13 21:44:03,432 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-13 21:44:03,440 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 21:44:03,441 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-13 21:44:03,441 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-13 21:44:03,516 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-13 21:44:03,564 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 120 transitions, 255 flow [2022-07-13 21:44:03,631 INFO L129 PetriNetUnfolder]: 2/117 cut-off events. [2022-07-13 21:44:03,632 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-13 21:44:03,636 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 2/117 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/113 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-07-13 21:44:03,636 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 120 transitions, 255 flow [2022-07-13 21:44:03,642 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 117 transitions, 243 flow [2022-07-13 21:44:03,656 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 21:44:03,664 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@4ef0caa6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@74ed595f [2022-07-13 21:44:03,665 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-13 21:44:03,692 INFO L129 PetriNetUnfolder]: 0/78 cut-off events. [2022-07-13 21:44:03,692 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-13 21:44:03,692 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:44:03,693 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] [2022-07-13 21:44:03,694 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:44:03,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:44:03,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1182076203, now seen corresponding path program 1 times [2022-07-13 21:44:03,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:44:03,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672184267] [2022-07-13 21:44:03,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:44:03,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:44:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:44:04,042 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-13 21:44:04,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:44:04,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672184267] [2022-07-13 21:44:04,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672184267] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:44:04,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:44:04,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 21:44:04,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950536456] [2022-07-13 21:44:04,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:44:04,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:44:04,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:44:04,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:44:04,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 21:44:04,090 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 120 [2022-07-13 21:44:04,096 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 117 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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-13 21:44:04,096 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:44:04,096 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 120 [2022-07-13 21:44:04,097 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:44:04,227 INFO L129 PetriNetUnfolder]: 14/194 cut-off events. [2022-07-13 21:44:04,227 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-13 21:44:04,229 INFO L84 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 194 events. 14/194 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 435 event pairs, 6 based on Foata normal form. 6/189 useless extension candidates. Maximal degree in co-relation 185. Up to 25 conditions per place. [2022-07-13 21:44:04,232 INFO L132 encePairwiseOnDemand]: 115/120 looper letters, 9 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2022-07-13 21:44:04,232 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 115 transitions, 261 flow [2022-07-13 21:44:04,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:44:04,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 21:44:04,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2022-07-13 21:44:04,269 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9361111111111111 [2022-07-13 21:44:04,270 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 337 transitions. [2022-07-13 21:44:04,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions. [2022-07-13 21:44:04,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:44:04,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions. [2022-07-13 21:44:04,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 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-13 21:44:04,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 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-13 21:44:04,289 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 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-13 21:44:04,290 INFO L186 Difference]: Start difference. First operand has 125 places, 117 transitions, 243 flow. Second operand 3 states and 337 transitions. [2022-07-13 21:44:04,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 115 transitions, 261 flow [2022-07-13 21:44:04,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 115 transitions, 258 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-13 21:44:04,297 INFO L242 Difference]: Finished difference. Result has 122 places, 113 transitions, 236 flow [2022-07-13 21:44:04,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=122, PETRI_TRANSITIONS=113} [2022-07-13 21:44:04,302 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, -3 predicate places. [2022-07-13 21:44:04,303 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 113 transitions, 236 flow [2022-07-13 21:44:04,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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-13 21:44:04,303 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:44:04,304 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-13 21:44:04,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 21:44:04,304 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:44:04,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:44:04,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1278907714, now seen corresponding path program 1 times [2022-07-13 21:44:04,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:44:04,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950076125] [2022-07-13 21:44:04,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:44:04,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:44:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:44:04,604 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-13 21:44:04,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:44:04,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950076125] [2022-07-13 21:44:04,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950076125] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:44:04,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:44:04,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:44:04,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185613337] [2022-07-13 21:44:04,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:44:04,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:44:04,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:44:04,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:44:04,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:44:04,614 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120 [2022-07-13 21:44:04,615 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 113 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 0 states have call successors, (0), 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-13 21:44:04,615 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:44:04,619 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120 [2022-07-13 21:44:04,619 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:44:05,369 INFO L129 PetriNetUnfolder]: 966/2623 cut-off events. [2022-07-13 21:44:05,369 INFO L130 PetriNetUnfolder]: For 99/99 co-relation queries the response was YES. [2022-07-13 21:44:05,376 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4232 conditions, 2623 events. 966/2623 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 20100 event pairs, 124 based on Foata normal form. 0/2555 useless extension candidates. Maximal degree in co-relation 4171. Up to 730 conditions per place. [2022-07-13 21:44:05,383 INFO L132 encePairwiseOnDemand]: 112/120 looper letters, 28 selfloop transitions, 4 changer transitions 63/172 dead transitions. [2022-07-13 21:44:05,384 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 172 transitions, 538 flow [2022-07-13 21:44:05,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 21:44:05,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-13 21:44:05,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 996 transitions. [2022-07-13 21:44:05,387 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.83 [2022-07-13 21:44:05,387 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 996 transitions. [2022-07-13 21:44:05,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 996 transitions. [2022-07-13 21:44:05,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:44:05,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 996 transitions. [2022-07-13 21:44:05,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.6) internal successors, (996), 10 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-13 21:44:05,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 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-13 21:44:05,395 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 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-13 21:44:05,395 INFO L186 Difference]: Start difference. First operand has 122 places, 113 transitions, 236 flow. Second operand 10 states and 996 transitions. [2022-07-13 21:44:05,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 172 transitions, 538 flow [2022-07-13 21:44:05,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 172 transitions, 520 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-13 21:44:05,399 INFO L242 Difference]: Finished difference. Result has 136 places, 101 transitions, 232 flow [2022-07-13 21:44:05,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=232, PETRI_PLACES=136, PETRI_TRANSITIONS=101} [2022-07-13 21:44:05,400 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, 11 predicate places. [2022-07-13 21:44:05,400 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 101 transitions, 232 flow [2022-07-13 21:44:05,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 0 states have call successors, (0), 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-13 21:44:05,401 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:44:05,401 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-13 21:44:05,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 21:44:05,402 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:44:05,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:44:05,402 INFO L85 PathProgramCache]: Analyzing trace with hash -2141315781, now seen corresponding path program 1 times [2022-07-13 21:44:05,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:44:05,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073696237] [2022-07-13 21:44:05,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:44:05,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:44:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:44:05,524 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-13 21:44:05,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:44:05,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073696237] [2022-07-13 21:44:05,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073696237] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:44:05,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:44:05,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:44:05,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498705552] [2022-07-13 21:44:05,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:44:05,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:44:05,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:44:05,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:44:05,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:44:05,528 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120 [2022-07-13 21:44:05,529 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 101 transitions, 232 flow. Second operand has 7 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 0 states have call successors, (0), 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-13 21:44:05,530 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:44:05,530 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120 [2022-07-13 21:44:05,530 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:44:06,004 INFO L129 PetriNetUnfolder]: 558/1165 cut-off events. [2022-07-13 21:44:06,004 INFO L130 PetriNetUnfolder]: For 313/313 co-relation queries the response was YES. [2022-07-13 21:44:06,009 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2427 conditions, 1165 events. 558/1165 cut-off events. For 313/313 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6163 event pairs, 82 based on Foata normal form. 30/1158 useless extension candidates. Maximal degree in co-relation 2357. Up to 479 conditions per place. [2022-07-13 21:44:06,014 INFO L132 encePairwiseOnDemand]: 114/120 looper letters, 31 selfloop transitions, 2 changer transitions 43/153 dead transitions. [2022-07-13 21:44:06,014 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 153 transitions, 513 flow [2022-07-13 21:44:06,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:44:06,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 21:44:06,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 897 transitions. [2022-07-13 21:44:06,018 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8305555555555556 [2022-07-13 21:44:06,018 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 897 transitions. [2022-07-13 21:44:06,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 897 transitions. [2022-07-13 21:44:06,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:44:06,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 897 transitions. [2022-07-13 21:44:06,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.66666666666667) internal successors, (897), 9 states have internal predecessors, (897), 0 states have call successors, (0), 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-13 21:44:06,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 0 states have call successors, (0), 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-13 21:44:06,025 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 0 states have call successors, (0), 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-13 21:44:06,025 INFO L186 Difference]: Start difference. First operand has 136 places, 101 transitions, 232 flow. Second operand 9 states and 897 transitions. [2022-07-13 21:44:06,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 153 transitions, 513 flow [2022-07-13 21:44:06,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 153 transitions, 475 flow, removed 14 selfloop flow, removed 9 redundant places. [2022-07-13 21:44:06,053 INFO L242 Difference]: Finished difference. Result has 124 places, 101 transitions, 232 flow [2022-07-13 21:44:06,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=232, PETRI_PLACES=124, PETRI_TRANSITIONS=101} [2022-07-13 21:44:06,055 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, -1 predicate places. [2022-07-13 21:44:06,056 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 101 transitions, 232 flow [2022-07-13 21:44:06,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 0 states have call successors, (0), 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-13 21:44:06,057 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:44:06,057 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] [2022-07-13 21:44:06,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 21:44:06,058 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:44:06,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:44:06,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1328470151, now seen corresponding path program 1 times [2022-07-13 21:44:06,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:44:06,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120825232] [2022-07-13 21:44:06,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:44:06,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:44:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:44:06,227 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-13 21:44:06,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:44:06,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120825232] [2022-07-13 21:44:06,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120825232] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:44:06,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:44:06,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:44:06,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437613830] [2022-07-13 21:44:06,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:44:06,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:44:06,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:44:06,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:44:06,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:44:06,231 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120 [2022-07-13 21:44:06,231 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 101 transitions, 232 flow. Second operand has 7 states, 7 states have (on average 93.57142857142857) internal successors, (655), 7 states have internal predecessors, (655), 0 states have call successors, (0), 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-13 21:44:06,231 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:44:06,232 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120 [2022-07-13 21:44:06,232 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:44:06,572 INFO L129 PetriNetUnfolder]: 394/897 cut-off events. [2022-07-13 21:44:06,572 INFO L130 PetriNetUnfolder]: For 293/293 co-relation queries the response was YES. [2022-07-13 21:44:06,575 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1871 conditions, 897 events. 394/897 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4378 event pairs, 121 based on Foata normal form. 20/878 useless extension candidates. Maximal degree in co-relation 1802. Up to 316 conditions per place. [2022-07-13 21:44:06,578 INFO L132 encePairwiseOnDemand]: 110/120 looper letters, 23 selfloop transitions, 6 changer transitions 31/137 dead transitions. [2022-07-13 21:44:06,578 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 137 transitions, 448 flow [2022-07-13 21:44:06,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 21:44:06,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-13 21:44:06,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 972 transitions. [2022-07-13 21:44:06,582 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.81 [2022-07-13 21:44:06,582 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 972 transitions. [2022-07-13 21:44:06,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 972 transitions. [2022-07-13 21:44:06,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:44:06,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 972 transitions. [2022-07-13 21:44:06,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.2) internal successors, (972), 10 states have internal predecessors, (972), 0 states have call successors, (0), 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-13 21:44:06,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 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-13 21:44:06,588 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 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-13 21:44:06,588 INFO L186 Difference]: Start difference. First operand has 124 places, 101 transitions, 232 flow. Second operand 10 states and 972 transitions. [2022-07-13 21:44:06,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 137 transitions, 448 flow [2022-07-13 21:44:06,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 137 transitions, 414 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-07-13 21:44:06,592 INFO L242 Difference]: Finished difference. Result has 126 places, 101 transitions, 244 flow [2022-07-13 21:44:06,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=244, PETRI_PLACES=126, PETRI_TRANSITIONS=101} [2022-07-13 21:44:06,593 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, 1 predicate places. [2022-07-13 21:44:06,594 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 101 transitions, 244 flow [2022-07-13 21:44:06,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.57142857142857) internal successors, (655), 7 states have internal predecessors, (655), 0 states have call successors, (0), 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-13 21:44:06,594 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:44:06,594 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] [2022-07-13 21:44:06,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 21:44:06,595 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:44:06,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:44:06,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1119503767, now seen corresponding path program 1 times [2022-07-13 21:44:06,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:44:06,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935153729] [2022-07-13 21:44:06,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:44:06,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:44:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:44:06,742 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-13 21:44:06,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:44:06,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935153729] [2022-07-13 21:44:06,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935153729] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:44:06,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:44:06,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:44:06,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910693171] [2022-07-13 21:44:06,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:44:06,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:44:06,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:44:06,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:44:06,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:44:06,746 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 120 [2022-07-13 21:44:06,748 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 101 transitions, 244 flow. Second operand has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 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-13 21:44:06,748 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:44:06,748 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 120 [2022-07-13 21:44:06,749 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:44:07,099 INFO L129 PetriNetUnfolder]: 556/1214 cut-off events. [2022-07-13 21:44:07,100 INFO L130 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2022-07-13 21:44:07,103 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2406 conditions, 1214 events. 556/1214 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 7709 event pairs, 25 based on Foata normal form. 0/1186 useless extension candidates. Maximal degree in co-relation 2338. Up to 343 conditions per place. [2022-07-13 21:44:07,107 INFO L132 encePairwiseOnDemand]: 110/120 looper letters, 28 selfloop transitions, 6 changer transitions 45/161 dead transitions. [2022-07-13 21:44:07,107 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 161 transitions, 547 flow [2022-07-13 21:44:07,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 21:44:07,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-13 21:44:07,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1051 transitions. [2022-07-13 21:44:07,111 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8758333333333334 [2022-07-13 21:44:07,111 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1051 transitions. [2022-07-13 21:44:07,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1051 transitions. [2022-07-13 21:44:07,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:44:07,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1051 transitions. [2022-07-13 21:44:07,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 105.1) internal successors, (1051), 10 states have internal predecessors, (1051), 0 states have call successors, (0), 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-13 21:44:07,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 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-13 21:44:07,116 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 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-13 21:44:07,116 INFO L186 Difference]: Start difference. First operand has 126 places, 101 transitions, 244 flow. Second operand 10 states and 1051 transitions. [2022-07-13 21:44:07,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 161 transitions, 547 flow [2022-07-13 21:44:07,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 161 transitions, 509 flow, removed 6 selfloop flow, removed 9 redundant places. [2022-07-13 21:44:07,121 INFO L242 Difference]: Finished difference. Result has 126 places, 103 transitions, 274 flow [2022-07-13 21:44:07,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=274, PETRI_PLACES=126, PETRI_TRANSITIONS=103} [2022-07-13 21:44:07,123 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, 1 predicate places. [2022-07-13 21:44:07,124 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 103 transitions, 274 flow [2022-07-13 21:44:07,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 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-13 21:44:07,124 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:44:07,124 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, 1] [2022-07-13 21:44:07,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 21:44:07,125 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:44:07,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:44:07,126 INFO L85 PathProgramCache]: Analyzing trace with hash -964588782, now seen corresponding path program 1 times [2022-07-13 21:44:07,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:44:07,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078474656] [2022-07-13 21:44:07,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:44:07,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:44:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:44:07,272 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-13 21:44:07,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:44:07,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078474656] [2022-07-13 21:44:07,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078474656] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:44:07,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:44:07,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:44:07,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6226159] [2022-07-13 21:44:07,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:44:07,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:44:07,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:44:07,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:44:07,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:44:07,276 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 120 [2022-07-13 21:44:07,276 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 103 transitions, 274 flow. Second operand has 7 states, 7 states have (on average 99.0) internal successors, (693), 7 states have internal predecessors, (693), 0 states have call successors, (0), 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-13 21:44:07,276 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:44:07,277 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 120 [2022-07-13 21:44:07,277 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:44:07,574 INFO L129 PetriNetUnfolder]: 212/616 cut-off events. [2022-07-13 21:44:07,574 INFO L130 PetriNetUnfolder]: For 609/617 co-relation queries the response was YES. [2022-07-13 21:44:07,577 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1615 conditions, 616 events. 212/616 cut-off events. For 609/617 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3350 event pairs, 4 based on Foata normal form. 22/636 useless extension candidates. Maximal degree in co-relation 1549. Up to 154 conditions per place. [2022-07-13 21:44:07,579 INFO L132 encePairwiseOnDemand]: 111/120 looper letters, 33 selfloop transitions, 9 changer transitions 35/159 dead transitions. [2022-07-13 21:44:07,579 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 159 transitions, 680 flow [2022-07-13 21:44:07,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 21:44:07,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-13 21:44:07,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1049 transitions. [2022-07-13 21:44:07,582 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8741666666666666 [2022-07-13 21:44:07,583 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1049 transitions. [2022-07-13 21:44:07,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1049 transitions. [2022-07-13 21:44:07,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:44:07,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1049 transitions. [2022-07-13 21:44:07,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 104.9) internal successors, (1049), 10 states have internal predecessors, (1049), 0 states have call successors, (0), 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-13 21:44:07,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 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-13 21:44:07,588 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 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-13 21:44:07,589 INFO L186 Difference]: Start difference. First operand has 126 places, 103 transitions, 274 flow. Second operand 10 states and 1049 transitions. [2022-07-13 21:44:07,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 159 transitions, 680 flow [2022-07-13 21:44:07,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 159 transitions, 656 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-07-13 21:44:07,594 INFO L242 Difference]: Finished difference. Result has 130 places, 106 transitions, 342 flow [2022-07-13 21:44:07,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=342, PETRI_PLACES=130, PETRI_TRANSITIONS=106} [2022-07-13 21:44:07,595 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, 5 predicate places. [2022-07-13 21:44:07,595 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 106 transitions, 342 flow [2022-07-13 21:44:07,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.0) internal successors, (693), 7 states have internal predecessors, (693), 0 states have call successors, (0), 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-13 21:44:07,595 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:44:07,596 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, 1, 1, 1] [2022-07-13 21:44:07,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 21:44:07,596 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:44:07,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:44:07,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1065558623, now seen corresponding path program 1 times [2022-07-13 21:44:07,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:44:07,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009763009] [2022-07-13 21:44:07,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:44:07,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:44:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:44:07,764 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-13 21:44:07,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:44:07,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009763009] [2022-07-13 21:44:07,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009763009] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:44:07,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:44:07,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:44:07,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977362238] [2022-07-13 21:44:07,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:44:07,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:44:07,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:44:07,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:44:07,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:44:07,768 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 120 [2022-07-13 21:44:07,769 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 106 transitions, 342 flow. Second operand has 7 states, 7 states have (on average 92.42857142857143) internal successors, (647), 7 states have internal predecessors, (647), 0 states have call successors, (0), 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-13 21:44:07,769 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:44:07,769 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 120 [2022-07-13 21:44:07,769 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:44:08,129 INFO L129 PetriNetUnfolder]: 193/835 cut-off events. [2022-07-13 21:44:08,130 INFO L130 PetriNetUnfolder]: For 1064/1107 co-relation queries the response was YES. [2022-07-13 21:44:08,134 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2103 conditions, 835 events. 193/835 cut-off events. For 1064/1107 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5067 event pairs, 25 based on Foata normal form. 26/844 useless extension candidates. Maximal degree in co-relation 2027. Up to 214 conditions per place. [2022-07-13 21:44:08,137 INFO L132 encePairwiseOnDemand]: 104/120 looper letters, 34 selfloop transitions, 12 changer transitions 19/145 dead transitions. [2022-07-13 21:44:08,138 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 145 transitions, 564 flow [2022-07-13 21:44:08,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 21:44:08,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-13 21:44:08,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1046 transitions. [2022-07-13 21:44:08,141 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7924242424242425 [2022-07-13 21:44:08,141 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1046 transitions. [2022-07-13 21:44:08,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1046 transitions. [2022-07-13 21:44:08,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:44:08,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1046 transitions. [2022-07-13 21:44:08,144 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-13 21:44:08,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 120.0) internal successors, (1440), 12 states have internal predecessors, (1440), 0 states have call successors, (0), 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-13 21:44:08,146 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 120.0) internal successors, (1440), 12 states have internal predecessors, (1440), 0 states have call successors, (0), 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-13 21:44:08,146 INFO L186 Difference]: Start difference. First operand has 130 places, 106 transitions, 342 flow. Second operand 11 states and 1046 transitions. [2022-07-13 21:44:08,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 145 transitions, 564 flow [2022-07-13 21:44:08,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 145 transitions, 508 flow, removed 20 selfloop flow, removed 9 redundant places. [2022-07-13 21:44:08,155 INFO L242 Difference]: Finished difference. Result has 135 places, 111 transitions, 369 flow [2022-07-13 21:44:08,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=369, PETRI_PLACES=135, PETRI_TRANSITIONS=111} [2022-07-13 21:44:08,156 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, 10 predicate places. [2022-07-13 21:44:08,156 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 111 transitions, 369 flow [2022-07-13 21:44:08,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.42857142857143) internal successors, (647), 7 states have internal predecessors, (647), 0 states have call successors, (0), 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-13 21:44:08,157 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:44:08,157 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, 1, 1, 1] [2022-07-13 21:44:08,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 21:44:08,158 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:44:08,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:44:08,158 INFO L85 PathProgramCache]: Analyzing trace with hash 419989755, now seen corresponding path program 2 times [2022-07-13 21:44:08,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:44:08,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308194035] [2022-07-13 21:44:08,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:44:08,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:44:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:44:08,295 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-13 21:44:08,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:44:08,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308194035] [2022-07-13 21:44:08,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308194035] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:44:08,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:44:08,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 21:44:08,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591690246] [2022-07-13 21:44:08,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:44:08,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 21:44:08,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:44:08,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 21:44:08,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:44:08,299 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 120 [2022-07-13 21:44:08,300 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 111 transitions, 369 flow. Second operand has 8 states, 8 states have (on average 99.0) internal successors, (792), 8 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:08,300 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:44:08,300 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 120 [2022-07-13 21:44:08,300 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:44:08,575 INFO L129 PetriNetUnfolder]: 173/640 cut-off events. [2022-07-13 21:44:08,575 INFO L130 PetriNetUnfolder]: For 778/878 co-relation queries the response was YES. [2022-07-13 21:44:08,579 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1723 conditions, 640 events. 173/640 cut-off events. For 778/878 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3691 event pairs, 14 based on Foata normal form. 51/669 useless extension candidates. Maximal degree in co-relation 1701. Up to 102 conditions per place. [2022-07-13 21:44:08,581 INFO L132 encePairwiseOnDemand]: 111/120 looper letters, 31 selfloop transitions, 14 changer transitions 21/151 dead transitions. [2022-07-13 21:44:08,582 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 151 transitions, 728 flow [2022-07-13 21:44:08,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 21:44:08,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-13 21:44:08,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1125 transitions. [2022-07-13 21:44:08,585 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8522727272727273 [2022-07-13 21:44:08,585 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1125 transitions. [2022-07-13 21:44:08,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1125 transitions. [2022-07-13 21:44:08,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:44:08,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1125 transitions. [2022-07-13 21:44:08,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 102.27272727272727) internal successors, (1125), 11 states have internal predecessors, (1125), 0 states have call successors, (0), 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-13 21:44:08,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 120.0) internal successors, (1440), 12 states have internal predecessors, (1440), 0 states have call successors, (0), 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-13 21:44:08,591 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 120.0) internal successors, (1440), 12 states have internal predecessors, (1440), 0 states have call successors, (0), 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-13 21:44:08,591 INFO L186 Difference]: Start difference. First operand has 135 places, 111 transitions, 369 flow. Second operand 11 states and 1125 transitions. [2022-07-13 21:44:08,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 151 transitions, 728 flow [2022-07-13 21:44:08,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 151 transitions, 663 flow, removed 18 selfloop flow, removed 8 redundant places. [2022-07-13 21:44:08,597 INFO L242 Difference]: Finished difference. Result has 137 places, 114 transitions, 393 flow [2022-07-13 21:44:08,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=393, PETRI_PLACES=137, PETRI_TRANSITIONS=114} [2022-07-13 21:44:08,598 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, 12 predicate places. [2022-07-13 21:44:08,598 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 114 transitions, 393 flow [2022-07-13 21:44:08,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 99.0) internal successors, (792), 8 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:44:08,599 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:44:08,599 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, 1, 1, 1, 1, 1, 1] [2022-07-13 21:44:08,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 21:44:08,600 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:44:08,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:44:08,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1038597567, now seen corresponding path program 1 times [2022-07-13 21:44:08,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:44:08,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024378881] [2022-07-13 21:44:08,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:44:08,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:44:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:44:08,774 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-13 21:44:08,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:44:08,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024378881] [2022-07-13 21:44:08,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024378881] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:44:08,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:44:08,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:44:08,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733817179] [2022-07-13 21:44:08,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:44:08,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:44:08,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:44:08,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:44:08,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:44:08,777 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 120 [2022-07-13 21:44:08,778 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 114 transitions, 393 flow. Second operand has 7 states, 7 states have (on average 92.71428571428571) internal successors, (649), 7 states have internal predecessors, (649), 0 states have call successors, (0), 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-13 21:44:08,778 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:44:08,778 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 120 [2022-07-13 21:44:08,778 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:44:09,047 INFO L129 PetriNetUnfolder]: 166/778 cut-off events. [2022-07-13 21:44:09,048 INFO L130 PetriNetUnfolder]: For 918/929 co-relation queries the response was YES. [2022-07-13 21:44:09,051 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2060 conditions, 778 events. 166/778 cut-off events. For 918/929 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5115 event pairs, 54 based on Foata normal form. 1/759 useless extension candidates. Maximal degree in co-relation 1998. Up to 198 conditions per place. [2022-07-13 21:44:09,053 INFO L132 encePairwiseOnDemand]: 104/120 looper letters, 30 selfloop transitions, 14 changer transitions 6/133 dead transitions. [2022-07-13 21:44:09,053 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 133 transitions, 573 flow [2022-07-13 21:44:09,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 21:44:09,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-13 21:44:09,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 757 transitions. [2022-07-13 21:44:09,056 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7885416666666667 [2022-07-13 21:44:09,056 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 757 transitions. [2022-07-13 21:44:09,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 757 transitions. [2022-07-13 21:44:09,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:44:09,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 757 transitions. [2022-07-13 21:44:09,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.625) internal successors, (757), 8 states have internal predecessors, (757), 0 states have call successors, (0), 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-13 21:44:09,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 120.0) internal successors, (1080), 9 states have internal predecessors, (1080), 0 states have call successors, (0), 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-13 21:44:09,060 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 120.0) internal successors, (1080), 9 states have internal predecessors, (1080), 0 states have call successors, (0), 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-13 21:44:09,061 INFO L186 Difference]: Start difference. First operand has 137 places, 114 transitions, 393 flow. Second operand 8 states and 757 transitions. [2022-07-13 21:44:09,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 133 transitions, 573 flow [2022-07-13 21:44:09,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 133 transitions, 497 flow, removed 31 selfloop flow, removed 11 redundant places. [2022-07-13 21:44:09,068 INFO L242 Difference]: Finished difference. Result has 136 places, 120 transitions, 422 flow [2022-07-13 21:44:09,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=422, PETRI_PLACES=136, PETRI_TRANSITIONS=120} [2022-07-13 21:44:09,070 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, 11 predicate places. [2022-07-13 21:44:09,070 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 120 transitions, 422 flow [2022-07-13 21:44:09,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.71428571428571) internal successors, (649), 7 states have internal predecessors, (649), 0 states have call successors, (0), 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-13 21:44:09,071 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:44:09,071 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, 1, 1, 1, 1, 1, 1] [2022-07-13 21:44:09,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 21:44:09,072 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:44:09,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:44:09,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1249729043, now seen corresponding path program 2 times [2022-07-13 21:44:09,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:44:09,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843950200] [2022-07-13 21:44:09,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:44:09,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:44:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:44:09,208 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-13 21:44:09,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:44:09,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843950200] [2022-07-13 21:44:09,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843950200] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:44:09,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:44:09,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:44:09,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145990508] [2022-07-13 21:44:09,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:44:09,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:44:09,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:44:09,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:44:09,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:44:09,215 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 120 [2022-07-13 21:44:09,216 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 120 transitions, 422 flow. Second operand has 7 states, 7 states have (on average 98.71428571428571) internal successors, (691), 7 states have internal predecessors, (691), 0 states have call successors, (0), 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-13 21:44:09,216 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:44:09,216 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 120 [2022-07-13 21:44:09,217 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:44:09,453 INFO L129 PetriNetUnfolder]: 166/914 cut-off events. [2022-07-13 21:44:09,454 INFO L130 PetriNetUnfolder]: For 524/545 co-relation queries the response was YES. [2022-07-13 21:44:09,460 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2174 conditions, 914 events. 166/914 cut-off events. For 524/545 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6881 event pairs, 18 based on Foata normal form. 5/901 useless extension candidates. Maximal degree in co-relation 2154. Up to 132 conditions per place. [2022-07-13 21:44:09,462 INFO L132 encePairwiseOnDemand]: 114/120 looper letters, 20 selfloop transitions, 1 changer transitions 22/135 dead transitions. [2022-07-13 21:44:09,462 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 135 transitions, 560 flow [2022-07-13 21:44:09,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 21:44:09,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-13 21:44:09,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 707 transitions. [2022-07-13 21:44:09,464 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8416666666666667 [2022-07-13 21:44:09,465 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 707 transitions. [2022-07-13 21:44:09,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 707 transitions. [2022-07-13 21:44:09,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:44:09,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 707 transitions. [2022-07-13 21:44:09,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 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-13 21:44:09,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 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-13 21:44:09,469 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 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-13 21:44:09,469 INFO L186 Difference]: Start difference. First operand has 136 places, 120 transitions, 422 flow. Second operand 7 states and 707 transitions. [2022-07-13 21:44:09,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 135 transitions, 560 flow [2022-07-13 21:44:09,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 135 transitions, 519 flow, removed 9 selfloop flow, removed 7 redundant places. [2022-07-13 21:44:09,482 INFO L242 Difference]: Finished difference. Result has 136 places, 112 transitions, 335 flow [2022-07-13 21:44:09,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=335, PETRI_PLACES=136, PETRI_TRANSITIONS=112} [2022-07-13 21:44:09,484 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, 11 predicate places. [2022-07-13 21:44:09,484 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 112 transitions, 335 flow [2022-07-13 21:44:09,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.71428571428571) internal successors, (691), 7 states have internal predecessors, (691), 0 states have call successors, (0), 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-13 21:44:09,485 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:44:09,485 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, 1, 1, 1, 1, 1, 1] [2022-07-13 21:44:09,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 21:44:09,485 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:44:09,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:44:09,486 INFO L85 PathProgramCache]: Analyzing trace with hash 443456073, now seen corresponding path program 3 times [2022-07-13 21:44:09,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:44:09,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528245421] [2022-07-13 21:44:09,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:44:09,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:44:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:44:09,889 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-13 21:44:09,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:44:09,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528245421] [2022-07-13 21:44:09,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528245421] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:44:09,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:44:09,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-13 21:44:09,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148796137] [2022-07-13 21:44:09,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:44:09,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 21:44:09,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:44:09,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 21:44:09,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-07-13 21:44:09,892 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 120 [2022-07-13 21:44:09,893 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 112 transitions, 335 flow. Second operand has 12 states, 12 states have (on average 93.91666666666667) internal successors, (1127), 12 states have internal predecessors, (1127), 0 states have call successors, (0), 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-13 21:44:09,893 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:44:09,893 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 120 [2022-07-13 21:44:09,893 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:44:10,176 INFO L129 PetriNetUnfolder]: 66/499 cut-off events. [2022-07-13 21:44:10,177 INFO L130 PetriNetUnfolder]: For 232/308 co-relation queries the response was YES. [2022-07-13 21:44:10,179 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1026 conditions, 499 events. 66/499 cut-off events. For 232/308 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2984 event pairs, 9 based on Foata normal form. 1/487 useless extension candidates. Maximal degree in co-relation 1007. Up to 54 conditions per place. [2022-07-13 21:44:10,180 INFO L132 encePairwiseOnDemand]: 107/120 looper letters, 16 selfloop transitions, 8 changer transitions 14/126 dead transitions. [2022-07-13 21:44:10,180 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 126 transitions, 477 flow [2022-07-13 21:44:10,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 21:44:10,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-07-13 21:44:10,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1415 transitions. [2022-07-13 21:44:10,184 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7861111111111111 [2022-07-13 21:44:10,184 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1415 transitions. [2022-07-13 21:44:10,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1415 transitions. [2022-07-13 21:44:10,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:44:10,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1415 transitions. [2022-07-13 21:44:10,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 94.33333333333333) internal successors, (1415), 15 states have internal predecessors, (1415), 0 states have call successors, (0), 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-13 21:44:10,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 120.0) internal successors, (1920), 16 states have internal predecessors, (1920), 0 states have call successors, (0), 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-13 21:44:10,191 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 120.0) internal successors, (1920), 16 states have internal predecessors, (1920), 0 states have call successors, (0), 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-13 21:44:10,192 INFO L186 Difference]: Start difference. First operand has 136 places, 112 transitions, 335 flow. Second operand 15 states and 1415 transitions. [2022-07-13 21:44:10,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 126 transitions, 477 flow [2022-07-13 21:44:10,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 126 transitions, 458 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-07-13 21:44:10,196 INFO L242 Difference]: Finished difference. Result has 147 places, 112 transitions, 368 flow [2022-07-13 21:44:10,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=368, PETRI_PLACES=147, PETRI_TRANSITIONS=112} [2022-07-13 21:44:10,197 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, 22 predicate places. [2022-07-13 21:44:10,198 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 112 transitions, 368 flow [2022-07-13 21:44:10,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 93.91666666666667) internal successors, (1127), 12 states have internal predecessors, (1127), 0 states have call successors, (0), 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-13 21:44:10,198 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:44:10,199 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, 1, 1, 1, 1, 1, 1] [2022-07-13 21:44:10,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 21:44:10,199 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:44:10,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:44:10,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1124967729, now seen corresponding path program 4 times [2022-07-13 21:44:10,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:44:10,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176900489] [2022-07-13 21:44:10,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:44:10,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:44:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:44:10,249 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 21:44:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:44:10,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 21:44:10,328 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 21:44:10,329 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-07-13 21:44:10,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-07-13 21:44:10,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-07-13 21:44:10,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-07-13 21:44:10,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-07-13 21:44:10,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-07-13 21:44:10,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 21:44:10,332 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1] [2022-07-13 21:44:10,338 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-13 21:44:10,338 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 21:44:10,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 09:44:10 BasicIcfg [2022-07-13 21:44:10,486 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 21:44:10,487 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 21:44:10,487 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 21:44:10,487 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 21:44:10,488 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:44:03" (3/4) ... [2022-07-13 21:44:10,489 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 21:44:10,630 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 21:44:10,631 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 21:44:10,632 INFO L158 Benchmark]: Toolchain (without parser) took 8847.15ms. Allocated memory was 90.2MB in the beginning and 325.1MB in the end (delta: 234.9MB). Free memory was 53.7MB in the beginning and 225.5MB in the end (delta: -171.8MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. [2022-07-13 21:44:10,632 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 90.2MB. Free memory was 59.4MB in the beginning and 59.3MB in the end (delta: 26.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 21:44:10,633 INFO L158 Benchmark]: CACSL2BoogieTranslator took 539.91ms. Allocated memory was 90.2MB in the beginning and 113.2MB in the end (delta: 23.1MB). Free memory was 53.5MB in the beginning and 73.0MB in the end (delta: -19.5MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2022-07-13 21:44:10,633 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.65ms. Allocated memory is still 113.2MB. Free memory was 73.0MB in the beginning and 70.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 21:44:10,633 INFO L158 Benchmark]: Boogie Preprocessor took 31.56ms. Allocated memory is still 113.2MB. Free memory was 70.1MB in the beginning and 68.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 21:44:10,633 INFO L158 Benchmark]: RCFGBuilder took 984.05ms. Allocated memory is still 113.2MB. Free memory was 68.0MB in the beginning and 56.7MB in the end (delta: 11.3MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. [2022-07-13 21:44:10,634 INFO L158 Benchmark]: TraceAbstraction took 7067.55ms. Allocated memory was 113.2MB in the beginning and 325.1MB in the end (delta: 211.8MB). Free memory was 56.1MB in the beginning and 265.4MB in the end (delta: -209.3MB). Peak memory consumption was 155.2MB. Max. memory is 16.1GB. [2022-07-13 21:44:10,634 INFO L158 Benchmark]: Witness Printer took 144.01ms. Allocated memory is still 325.1MB. Free memory was 265.4MB in the beginning and 225.5MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-07-13 21:44:10,636 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.09ms. Allocated memory is still 90.2MB. Free memory was 59.4MB in the beginning and 59.3MB in the end (delta: 26.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 539.91ms. Allocated memory was 90.2MB in the beginning and 113.2MB in the end (delta: 23.1MB). Free memory was 53.5MB in the beginning and 73.0MB in the end (delta: -19.5MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.65ms. Allocated memory is still 113.2MB. Free memory was 73.0MB in the beginning and 70.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.56ms. Allocated memory is still 113.2MB. Free memory was 70.1MB in the beginning and 68.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 984.05ms. Allocated memory is still 113.2MB. Free memory was 68.0MB in the beginning and 56.7MB in the end (delta: 11.3MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7067.55ms. Allocated memory was 113.2MB in the beginning and 325.1MB in the end (delta: 211.8MB). Free memory was 56.1MB in the beginning and 265.4MB in the end (delta: -209.3MB). Peak memory consumption was 155.2MB. Max. memory is 16.1GB. * Witness Printer took 144.01ms. Allocated memory is still 325.1MB. Free memory was 265.4MB in the beginning and 225.5MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L715] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L717] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L719] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L721] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L722] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L723] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L725] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L727] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L728] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L729] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L730] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L731] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L732] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L733] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L734] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L735] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L736] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L737] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L738] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L739] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L740] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L741] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L742] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L743] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L745] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L746] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L747] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L853] 0 pthread_t t17; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t17={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L854] FCALL, FORK 0 pthread_create(&t17, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t17, ((void *)0), P0, ((void *)0))=-2, t17={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L855] 0 pthread_t t18; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t17={5:0}, t18={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L856] FCALL, FORK 0 pthread_create(&t18, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t18, ((void *)0), P1, ((void *)0))=-1, t17={5:0}, t18={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L857] 0 pthread_t t19; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t17={5:0}, t18={6:0}, t19={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L858] FCALL, FORK 0 pthread_create(&t19, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t19, ((void *)0), P2, ((void *)0))=0, t17={5:0}, t18={6:0}, t19={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] 3 y$w_buff1 = y$w_buff0 [L801] 3 y$w_buff0 = 1 [L802] 3 y$w_buff1_used = y$w_buff0_used [L803] 3 y$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L805] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L806] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L807] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L808] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L809] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 y$flush_delayed = weak$$choice2 [L815] 3 y$mem_tmp = y [L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1 [L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L817] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L817] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L818] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L818] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L819] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L819] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L820] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L821] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L822] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EAX = y [L824] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L824] 3 y = y$flush_delayed ? y$mem_tmp : y [L825] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L828] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L751] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 1 __unbuffered_p0_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 y$flush_delayed = weak$$choice2 [L778] 2 y$mem_tmp = y [L779] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L780] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L781] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L782] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L783] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L785] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = y [L787] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L787] 2 y = y$flush_delayed ? y$mem_tmp : y [L788] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L831] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L832] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L833] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L833] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L834] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L834] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L835] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L835] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t17={5:0}, t18={6:0}, t19={3:0}, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L866] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L868] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t17={5:0}, t18={6:0}, t19={3:0}, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 858]: 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: 856]: 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: 854]: 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, 148 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: 6.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 483 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 483 mSDsluCounter, 653 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1067 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1289 IncrementalHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 148 mSDtfsCounter, 1289 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=422occurred in iteration=9, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1040 NumberOfCodeBlocks, 1040 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 935 ConstructedInterpolants, 0 QuantifiedInterpolants, 4947 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-13 21:44:10,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE