/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:46:23,508 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:46:23,509 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:46:23,549 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:46:23,549 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:46:23,552 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:46:23,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:46:23,558 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:46:23,562 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:46:23,566 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:46:23,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:46:23,568 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:46:23,568 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:46:23,570 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:46:23,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:46:23,574 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:46:23,574 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:46:23,575 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:46:23,579 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:46:23,583 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:46:23,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:46:23,587 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:46:23,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:46:23,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:46:23,594 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:46:23,595 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:46:23,595 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:46:23,596 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:46:23,597 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:46:23,597 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:46:23,598 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:46:23,599 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:46:23,601 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:46:23,601 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:46:23,602 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:46:23,602 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:46:23,603 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:46:23,603 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:46:23,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:46:23,604 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:46:23,604 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:46:23,605 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 00:46:23,640 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:46:23,640 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:46:23,642 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:46:23,642 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:46:23,643 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:46:23,643 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:46:23,644 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:46:23,644 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:46:23,644 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:46:23,644 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:46:23,645 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:46:23,645 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:46:23,645 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:46:23,645 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:46:23,645 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:46:23,645 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:46:23,645 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:46:23,646 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:46:23,646 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:46:23,646 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:46:23,646 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:46:23,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:46:23,646 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:46:23,646 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:46:23,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:46:23,647 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:46:23,647 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:46:23,647 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:46:23,647 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 [2022-12-13 00:46:23,932 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:46:23,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:46:23,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:46:23,961 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:46:23,963 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:46:23,964 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 00:46:25,114 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:46:25,411 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:46:25,412 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 00:46:25,430 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8178254d5/8e4f605ddf8846b288d130d7f06e3197/FLAG616bbe55c [2022-12-13 00:46:25,443 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8178254d5/8e4f605ddf8846b288d130d7f06e3197 [2022-12-13 00:46:25,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:46:25,446 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:46:25,448 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:46:25,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:46:25,451 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:46:25,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:46:25" (1/1) ... [2022-12-13 00:46:25,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11334836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:25, skipping insertion in model container [2022-12-13 00:46:25,452 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:46:25" (1/1) ... [2022-12-13 00:46:25,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:46:25,503 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:46:25,668 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 00:46:25,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:25,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:25,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:25,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:25,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:25,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:25,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:25,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:25,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:25,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:25,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:25,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:25,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:25,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:25,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:25,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:25,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:25,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:25,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:25,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:25,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:25,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:25,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:25,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:25,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:25,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:25,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:46:25,883 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:46:25,892 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 00:46:25,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:25,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:25,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:25,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:25,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:25,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:25,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:25,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:25,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:25,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:25,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:25,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:25,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:25,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:25,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:25,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:25,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:25,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:25,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:25,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:25,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:25,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:25,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:25,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:25,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:25,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:25,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:46:25,991 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:46:25,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:25 WrapperNode [2022-12-13 00:46:25,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:46:25,993 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:46:25,993 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:46:25,993 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:46:25,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:25" (1/1) ... [2022-12-13 00:46:26,012 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:25" (1/1) ... [2022-12-13 00:46:26,038 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-12-13 00:46:26,039 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:46:26,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:46:26,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:46:26,040 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:46:26,046 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:25" (1/1) ... [2022-12-13 00:46:26,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:25" (1/1) ... [2022-12-13 00:46:26,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:25" (1/1) ... [2022-12-13 00:46:26,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:25" (1/1) ... [2022-12-13 00:46:26,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:25" (1/1) ... [2022-12-13 00:46:26,080 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:25" (1/1) ... [2022-12-13 00:46:26,082 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:25" (1/1) ... [2022-12-13 00:46:26,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:25" (1/1) ... [2022-12-13 00:46:26,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:46:26,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:46:26,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:46:26,097 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:46:26,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:25" (1/1) ... [2022-12-13 00:46:26,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:46:26,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:46:26,128 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-12-13 00:46:26,147 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-12-13 00:46:26,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:46:26,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:46:26,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:46:26,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:46:26,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:46:26,173 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:46:26,173 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:46:26,173 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:46:26,174 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:46:26,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:46:26,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:46:26,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:46:26,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:46:26,175 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:46:26,335 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:46:26,336 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:46:26,799 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:46:26,962 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:46:26,962 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:46:26,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:46:26 BoogieIcfgContainer [2022-12-13 00:46:26,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:46:26,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:46:26,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:46:26,969 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:46:26,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:46:25" (1/3) ... [2022-12-13 00:46:26,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515991af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:46:26, skipping insertion in model container [2022-12-13 00:46:26,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:25" (2/3) ... [2022-12-13 00:46:26,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515991af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:46:26, skipping insertion in model container [2022-12-13 00:46:26,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:46:26" (3/3) ... [2022-12-13 00:46:26,973 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 00:46:26,988 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:46:26,988 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:46:26,988 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:46:27,032 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:46:27,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 190 flow [2022-12-13 00:46:27,113 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2022-12-13 00:46:27,114 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:46:27,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-13 00:46:27,118 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 90 transitions, 190 flow [2022-12-13 00:46:27,122 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 88 transitions, 182 flow [2022-12-13 00:46:27,123 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:27,144 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 88 transitions, 182 flow [2022-12-13 00:46:27,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 88 transitions, 182 flow [2022-12-13 00:46:27,185 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2022-12-13 00:46:27,185 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:46:27,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-13 00:46:27,189 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 88 transitions, 182 flow [2022-12-13 00:46:27,189 INFO L226 LiptonReduction]: Number of co-enabled transitions 1174 [2022-12-13 00:46:34,185 INFO L241 LiptonReduction]: Total number of compositions: 71 [2022-12-13 00:46:34,198 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:46:34,204 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=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5bfa90a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:46:34,204 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 00:46:34,206 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 00:46:34,206 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:46:34,206 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:34,207 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 00:46:34,207 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:46:34,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:34,210 INFO L85 PathProgramCache]: Analyzing trace with hash 480460, now seen corresponding path program 1 times [2022-12-13 00:46:34,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:34,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110996571] [2022-12-13 00:46:34,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:34,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:34,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:46:34,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:34,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110996571] [2022-12-13 00:46:34,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110996571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:34,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:34,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:46:34,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096661392] [2022-12-13 00:46:34,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:34,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:46:34,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:34,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:46:34,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:46:34,576 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 51 [2022-12-13 00:46:34,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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-12-13 00:46:34,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:34,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 51 [2022-12-13 00:46:34,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:35,111 INFO L130 PetriNetUnfolder]: 1382/2486 cut-off events. [2022-12-13 00:46:35,112 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 00:46:35,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4755 conditions, 2486 events. 1382/2486 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 15826 event pairs, 498 based on Foata normal form. 0/1464 useless extension candidates. Maximal degree in co-relation 4745. Up to 1941 conditions per place. [2022-12-13 00:46:35,121 INFO L137 encePairwiseOnDemand]: 47/51 looper letters, 26 selfloop transitions, 2 changer transitions 49/84 dead transitions. [2022-12-13 00:46:35,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 84 transitions, 329 flow [2022-12-13 00:46:35,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:46:35,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:46:35,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2022-12-13 00:46:35,131 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.673202614379085 [2022-12-13 00:46:35,132 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 108 flow. Second operand 3 states and 103 transitions. [2022-12-13 00:46:35,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 84 transitions, 329 flow [2022-12-13 00:46:35,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 84 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:46:35,137 INFO L231 Difference]: Finished difference. Result has 56 places, 24 transitions, 56 flow [2022-12-13 00:46:35,138 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=56, PETRI_TRANSITIONS=24} [2022-12-13 00:46:35,142 INFO L295 CegarLoopForPetriNet]: 58 programPoint places, -2 predicate places. [2022-12-13 00:46:35,142 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:35,143 INFO L89 Accepts]: Start accepts. Operand has 56 places, 24 transitions, 56 flow [2022-12-13 00:46:35,145 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:35,145 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:35,145 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 24 transitions, 56 flow [2022-12-13 00:46:35,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 56 flow [2022-12-13 00:46:35,150 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-13 00:46:35,150 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:46:35,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 42 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 00:46:35,152 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 24 transitions, 56 flow [2022-12-13 00:46:35,152 INFO L226 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-13 00:46:35,271 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:46:35,273 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 00:46:35,273 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 56 flow [2022-12-13 00:46:35,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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-12-13 00:46:35,274 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:35,274 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:35,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:46:35,274 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:46:35,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:35,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1375819425, now seen corresponding path program 1 times [2022-12-13 00:46:35,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:35,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479694572] [2022-12-13 00:46:35,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:35,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:36,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:46:36,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:36,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479694572] [2022-12-13 00:46:36,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479694572] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:36,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:36,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:46:36,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263624415] [2022-12-13 00:46:36,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:36,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:46:36,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:36,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:46:36,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:46:36,098 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2022-12-13 00:46:36,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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-12-13 00:46:36,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:36,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2022-12-13 00:46:36,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:36,221 INFO L130 PetriNetUnfolder]: 267/492 cut-off events. [2022-12-13 00:46:36,221 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-12-13 00:46:36,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1004 conditions, 492 events. 267/492 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1961 event pairs, 119 based on Foata normal form. 28/462 useless extension candidates. Maximal degree in co-relation 994. Up to 251 conditions per place. [2022-12-13 00:46:36,224 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 26 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2022-12-13 00:46:36,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 37 transitions, 148 flow [2022-12-13 00:46:36,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:46:36,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:46:36,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-13 00:46:36,226 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-13 00:46:36,226 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 56 flow. Second operand 4 states and 54 transitions. [2022-12-13 00:46:36,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 37 transitions, 148 flow [2022-12-13 00:46:36,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 37 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:46:36,228 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 96 flow [2022-12-13 00:46:36,228 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2022-12-13 00:46:36,228 INFO L295 CegarLoopForPetriNet]: 58 programPoint places, -23 predicate places. [2022-12-13 00:46:36,229 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:36,229 INFO L89 Accepts]: Start accepts. Operand has 35 places, 28 transitions, 96 flow [2022-12-13 00:46:36,229 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:36,230 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:36,230 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 28 transitions, 96 flow [2022-12-13 00:46:36,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 28 transitions, 96 flow [2022-12-13 00:46:36,242 INFO L130 PetriNetUnfolder]: 26/89 cut-off events. [2022-12-13 00:46:36,243 INFO L131 PetriNetUnfolder]: For 13/16 co-relation queries the response was YES. [2022-12-13 00:46:36,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 89 events. 26/89 cut-off events. For 13/16 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 339 event pairs, 12 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 169. Up to 45 conditions per place. [2022-12-13 00:46:36,244 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 28 transitions, 96 flow [2022-12-13 00:46:36,244 INFO L226 LiptonReduction]: Number of co-enabled transitions 280 [2022-12-13 00:46:36,379 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [342] L747-->L750: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [423] L2-1-->L840: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_273 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd0~0_106 256)))) (.cse4 (not (= (mod v_~y$r_buff1_thd0~0_106 256) 0)))) (let ((.cse1 (and .cse4 (not (= 0 (mod v_~y$w_buff1_used~0_257 256))))) (.cse2 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_274 256) 0)) .cse5))) (and (= v_~y~0_239 (ite .cse0 v_~y$w_buff0~0_192 (ite .cse1 v_~y$w_buff1~0_167 v_~y~0_240))) (= (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_257) v_~y$w_buff1_used~0_256) (= v_~y$r_buff1_thd0~0_105 (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd0~0_105 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_256 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_106)) (= (ite .cse2 0 v_~y$r_buff0_thd0~0_106) v_~y$r_buff0_thd0~0_105) (= (ite .cse0 0 v_~y$w_buff0_used~0_274) v_~y$w_buff0_used~0_273)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_274, ~y$w_buff1~0=v_~y$w_buff1~0_167, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_106, ~y$w_buff0~0=v_~y$w_buff0~0_192, ~y~0=v_~y~0_240, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_106, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_257} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_273, ~y$w_buff1~0=v_~y$w_buff1~0_167, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_105, ~y$w_buff0~0=v_~y$w_buff0~0_192, ~y~0=v_~y~0_239, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_105, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_256} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 00:46:36,473 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [342] L747-->L750: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [352] L802-->L809: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_175 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd2~0_94 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_96 256) 0)))) (let ((.cse4 (and (not (= (mod v_~y$w_buff0_used~0_176 256) 0)) .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff1_used~0_177 256) 0)) .cse2)) (.cse1 (and .cse3 .cse5))) (and (= v_~y$w_buff1_used~0_176 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_177)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_176 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_95 256) 0)))) 0 v_~y$r_buff1_thd2~0_94) v_~y$r_buff1_thd2~0_93) (= (ite .cse4 0 v_~y$w_buff0_used~0_176) v_~y$w_buff0_used~0_175) (= v_~y~0_167 (ite .cse4 v_~y$w_buff0~0_108 (ite .cse0 v_~y$w_buff1~0_97 v_~y~0_168))) (= (ite .cse1 0 v_~y$r_buff0_thd2~0_96) v_~y$r_buff0_thd2~0_95)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_94, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_176, ~y$w_buff1~0=v_~y$w_buff1~0_97, ~y$w_buff0~0=v_~y$w_buff0~0_108, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_96, ~y~0=v_~y~0_168, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_177} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_93, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_175, ~y$w_buff1~0=v_~y$w_buff1~0_97, ~y$w_buff0~0=v_~y$w_buff0~0_108, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_95, ~y~0=v_~y~0_167, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_176} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 00:46:36,638 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:46:36,639 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 410 [2022-12-13 00:46:36,639 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 94 flow [2022-12-13 00:46:36,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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-12-13 00:46:36,640 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:36,640 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:36,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:46:36,640 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:46:36,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:36,641 INFO L85 PathProgramCache]: Analyzing trace with hash 545898278, now seen corresponding path program 1 times [2022-12-13 00:46:36,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:36,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70983835] [2022-12-13 00:46:36,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:36,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:37,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:46:37,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:37,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70983835] [2022-12-13 00:46:37,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70983835] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:37,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:37,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:46:37,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667778559] [2022-12-13 00:46:37,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:37,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:46:37,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:37,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:46:37,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:46:37,732 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 00:46:37,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 94 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 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-12-13 00:46:37,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:37,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 00:46:37,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:38,032 INFO L130 PetriNetUnfolder]: 234/434 cut-off events. [2022-12-13 00:46:38,032 INFO L131 PetriNetUnfolder]: For 188/188 co-relation queries the response was YES. [2022-12-13 00:46:38,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1096 conditions, 434 events. 234/434 cut-off events. For 188/188 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1774 event pairs, 64 based on Foata normal form. 1/378 useless extension candidates. Maximal degree in co-relation 1083. Up to 355 conditions per place. [2022-12-13 00:46:38,035 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 34 selfloop transitions, 8 changer transitions 0/48 dead transitions. [2022-12-13 00:46:38,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 48 transitions, 240 flow [2022-12-13 00:46:38,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:46:38,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:46:38,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-12-13 00:46:38,043 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4876543209876543 [2022-12-13 00:46:38,043 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 94 flow. Second operand 6 states and 79 transitions. [2022-12-13 00:46:38,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 48 transitions, 240 flow [2022-12-13 00:46:38,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 48 transitions, 237 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:46:38,048 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 139 flow [2022-12-13 00:46:38,048 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=139, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2022-12-13 00:46:38,049 INFO L295 CegarLoopForPetriNet]: 58 programPoint places, -17 predicate places. [2022-12-13 00:46:38,050 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:38,050 INFO L89 Accepts]: Start accepts. Operand has 41 places, 33 transitions, 139 flow [2022-12-13 00:46:38,051 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:38,051 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:38,051 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 33 transitions, 139 flow [2022-12-13 00:46:38,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 33 transitions, 139 flow [2022-12-13 00:46:38,068 INFO L130 PetriNetUnfolder]: 31/100 cut-off events. [2022-12-13 00:46:38,069 INFO L131 PetriNetUnfolder]: For 50/54 co-relation queries the response was YES. [2022-12-13 00:46:38,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 100 events. 31/100 cut-off events. For 50/54 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 421 event pairs, 11 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 222. Up to 52 conditions per place. [2022-12-13 00:46:38,070 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 33 transitions, 139 flow [2022-12-13 00:46:38,070 INFO L226 LiptonReduction]: Number of co-enabled transitions 298 [2022-12-13 00:46:38,286 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [349] L767-->L770: Formula: (= v_~y~0_8 1) InVars {} OutVars{~y~0=v_~y~0_8} AuxVars[] AssignedVars[~y~0] and [426] $Ultimate##0-->L747: Formula: (and (= |v_P0Thread1of1ForFork0_~arg#1.offset_7| |v_P0Thread1of1ForFork0_#in~arg#1.offset_7|) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_17| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_17|) (= v_~y$r_buff0_thd1~0_52 1) (= v_~y$r_buff0_thd2~0_137 v_~y$r_buff1_thd2~0_138) (= v_~y$r_buff0_thd0~0_109 v_~y$r_buff1_thd0~0_109) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_262 256) 0)) (not (= (mod v_~y$w_buff0_used~0_281 256) 0)))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_17|) (= |v_P0Thread1of1ForFork0_~arg#1.base_7| |v_P0Thread1of1ForFork0_#in~arg#1.base_7|) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_17| 0)) (= v_~y$w_buff0_used~0_281 1) (= v_~y$w_buff0_used~0_282 v_~y$w_buff1_used~0_262) (= v_~y$r_buff0_thd1~0_53 v_~y$r_buff1_thd1~0_37) (= 2 v_~y$w_buff0~0_198) (= v_~y$w_buff1~0_171 v_~y$w_buff0~0_199)) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_282, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_199, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_137, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_7|} OutVars{P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_281, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_7|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_7|, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_138, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_37, ~y$w_buff1~0=v_~y$w_buff1~0_171, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_198, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_17|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_52, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_137, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_17|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_109, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_262} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_~arg#1.base, P0Thread1of1ForFork0_~arg#1.offset, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 00:46:38,534 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:46:38,535 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 485 [2022-12-13 00:46:38,536 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 139 flow [2022-12-13 00:46:38,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 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-12-13 00:46:38,536 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:38,536 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:38,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:46:38,536 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:46:38,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:38,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1864272220, now seen corresponding path program 1 times [2022-12-13 00:46:38,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:38,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604442131] [2022-12-13 00:46:38,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:38,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:39,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:46:39,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:39,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604442131] [2022-12-13 00:46:39,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604442131] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:39,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:39,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:46:39,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924464858] [2022-12-13 00:46:39,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:39,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:46:39,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:39,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:46:39,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:46:39,439 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2022-12-13 00:46:39,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 139 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 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-12-13 00:46:39,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:39,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2022-12-13 00:46:39,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:39,720 INFO L130 PetriNetUnfolder]: 373/734 cut-off events. [2022-12-13 00:46:39,720 INFO L131 PetriNetUnfolder]: For 552/552 co-relation queries the response was YES. [2022-12-13 00:46:39,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1947 conditions, 734 events. 373/734 cut-off events. For 552/552 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3866 event pairs, 20 based on Foata normal form. 55/671 useless extension candidates. Maximal degree in co-relation 1930. Up to 246 conditions per place. [2022-12-13 00:46:39,725 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 38 selfloop transitions, 12 changer transitions 17/73 dead transitions. [2022-12-13 00:46:39,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 73 transitions, 412 flow [2022-12-13 00:46:39,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:46:39,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:46:39,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-12-13 00:46:39,727 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5467980295566502 [2022-12-13 00:46:39,727 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 139 flow. Second operand 7 states and 111 transitions. [2022-12-13 00:46:39,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 73 transitions, 412 flow [2022-12-13 00:46:39,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 73 transitions, 397 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-13 00:46:39,730 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 211 flow [2022-12-13 00:46:39,730 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=211, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2022-12-13 00:46:39,732 INFO L295 CegarLoopForPetriNet]: 58 programPoint places, -9 predicate places. [2022-12-13 00:46:39,732 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:39,732 INFO L89 Accepts]: Start accepts. Operand has 49 places, 36 transitions, 211 flow [2022-12-13 00:46:39,734 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:39,734 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:39,734 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 36 transitions, 211 flow [2022-12-13 00:46:39,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 36 transitions, 211 flow [2022-12-13 00:46:39,753 INFO L130 PetriNetUnfolder]: 43/136 cut-off events. [2022-12-13 00:46:39,753 INFO L131 PetriNetUnfolder]: For 212/224 co-relation queries the response was YES. [2022-12-13 00:46:39,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 396 conditions, 136 events. 43/136 cut-off events. For 212/224 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 663 event pairs, 7 based on Foata normal form. 4/98 useless extension candidates. Maximal degree in co-relation 377. Up to 66 conditions per place. [2022-12-13 00:46:39,755 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 36 transitions, 211 flow [2022-12-13 00:46:39,755 INFO L226 LiptonReduction]: Number of co-enabled transitions 306 [2022-12-13 00:46:40,088 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:46:40,095 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 363 [2022-12-13 00:46:40,095 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 221 flow [2022-12-13 00:46:40,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 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-12-13 00:46:40,095 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:40,096 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:40,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:46:40,096 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:46:40,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:40,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1011990244, now seen corresponding path program 1 times [2022-12-13 00:46:40,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:40,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272975069] [2022-12-13 00:46:40,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:40,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:40,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:46:40,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:40,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272975069] [2022-12-13 00:46:40,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272975069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:40,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:40,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:46:40,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104375137] [2022-12-13 00:46:40,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:40,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:46:40,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:40,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:46:40,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:46:40,713 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2022-12-13 00:46:40,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 221 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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-12-13 00:46:40,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:40,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2022-12-13 00:46:40,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:40,897 INFO L130 PetriNetUnfolder]: 356/704 cut-off events. [2022-12-13 00:46:40,898 INFO L131 PetriNetUnfolder]: For 1624/1624 co-relation queries the response was YES. [2022-12-13 00:46:40,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2254 conditions, 704 events. 356/704 cut-off events. For 1624/1624 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3568 event pairs, 112 based on Foata normal form. 12/625 useless extension candidates. Maximal degree in co-relation 2232. Up to 345 conditions per place. [2022-12-13 00:46:40,902 INFO L137 encePairwiseOnDemand]: 21/30 looper letters, 25 selfloop transitions, 5 changer transitions 23/57 dead transitions. [2022-12-13 00:46:40,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 57 transitions, 400 flow [2022-12-13 00:46:40,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:46:40,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:46:40,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2022-12-13 00:46:40,905 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-13 00:46:40,905 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 221 flow. Second operand 4 states and 65 transitions. [2022-12-13 00:46:40,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 57 transitions, 400 flow [2022-12-13 00:46:40,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 57 transitions, 382 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-13 00:46:40,911 INFO L231 Difference]: Finished difference. Result has 49 places, 27 transitions, 145 flow [2022-12-13 00:46:40,911 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=49, PETRI_TRANSITIONS=27} [2022-12-13 00:46:40,913 INFO L295 CegarLoopForPetriNet]: 58 programPoint places, -9 predicate places. [2022-12-13 00:46:40,913 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:40,915 INFO L89 Accepts]: Start accepts. Operand has 49 places, 27 transitions, 145 flow [2022-12-13 00:46:40,917 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:40,917 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:40,917 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 27 transitions, 145 flow [2022-12-13 00:46:40,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 27 transitions, 145 flow [2022-12-13 00:46:40,929 INFO L130 PetriNetUnfolder]: 12/74 cut-off events. [2022-12-13 00:46:40,929 INFO L131 PetriNetUnfolder]: For 97/100 co-relation queries the response was YES. [2022-12-13 00:46:40,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 74 events. 12/74 cut-off events. For 97/100 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 284 event pairs, 6 based on Foata normal form. 1/53 useless extension candidates. Maximal degree in co-relation 179. Up to 28 conditions per place. [2022-12-13 00:46:40,930 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 27 transitions, 145 flow [2022-12-13 00:46:40,930 INFO L226 LiptonReduction]: Number of co-enabled transitions 200 [2022-12-13 00:46:41,156 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [479] $Ultimate##0-->L750: Formula: (and (= v_~y$r_buff0_thd0~0_420 v_~y$r_buff1_thd0~0_422) (= v_~y$r_buff0_thd2~0_348 v_~y$r_buff1_thd2~0_355) (= v_~y$w_buff0_used~0_771 v_~y$w_buff1_used~0_715) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_54| |v_P0Thread1of1ForFork0_~arg#1.offset_54|) (= v_~y$r_buff0_thd1~0_188 1) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_64| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_64|) (= v_~y$r_buff0_thd1~0_189 v_~y$r_buff1_thd1~0_130) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_770 256) 0)) (not (= 0 (mod v_~y$w_buff1_used~0_715 256))))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_64|) (= v_~x~0_170 1) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_64| 0)) (= v_~y$w_buff0_used~0_770 1) (= v_~y$w_buff1~0_545 v_~y$w_buff0~0_600) (= |v_P0Thread1of1ForFork0_~arg#1.base_54| |v_P0Thread1of1ForFork0_#in~arg#1.base_54|) (= 2 v_~y$w_buff0~0_599)) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_54|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_771, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_420, ~y$w_buff0~0=v_~y$w_buff0~0_600, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_189, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_348, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_54|} OutVars{P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_54|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_770, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_54|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_54|, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_54|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_355, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_130, ~y$w_buff1~0=v_~y$w_buff1~0_545, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_420, ~y$w_buff0~0=v_~y$w_buff0~0_599, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_64|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_188, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_348, ~x~0=v_~x~0_170, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_64|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_422, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_715} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork0_~arg#1.base, P0Thread1of1ForFork0_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd1~0, ~x~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [478] $Ultimate##0-->L770: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_35| v_P1Thread1of1ForFork1_~arg.offset_35) (= 2 v_~x~0_168) (= v_P1Thread1of1ForFork1_~arg.base_35 |v_P1Thread1of1ForFork1_#in~arg.base_35|) (= v_~y~0_685 1)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_35|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_35|} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_35, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_35, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_35|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_35|, ~y~0=v_~y~0_685, ~x~0=v_~x~0_168} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_~arg.base, ~y~0, ~x~0] [2022-12-13 00:46:41,268 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:46:41,269 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 356 [2022-12-13 00:46:41,269 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 25 transitions, 149 flow [2022-12-13 00:46:41,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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-12-13 00:46:41,269 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:41,270 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:41,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:46:41,270 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:46:41,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:41,271 INFO L85 PathProgramCache]: Analyzing trace with hash 828484236, now seen corresponding path program 1 times [2022-12-13 00:46:41,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:41,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391123492] [2022-12-13 00:46:41,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:41,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:41,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:46:41,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:41,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391123492] [2022-12-13 00:46:41,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391123492] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:41,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:41,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:46:41,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165135029] [2022-12-13 00:46:41,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:41,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:46:41,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:41,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:46:41,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:46:41,455 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-13 00:46:41,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 25 transitions, 149 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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-12-13 00:46:41,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:41,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-13 00:46:41,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:41,515 INFO L130 PetriNetUnfolder]: 95/208 cut-off events. [2022-12-13 00:46:41,515 INFO L131 PetriNetUnfolder]: For 547/547 co-relation queries the response was YES. [2022-12-13 00:46:41,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 208 events. 95/208 cut-off events. For 547/547 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 818 event pairs, 29 based on Foata normal form. 9/157 useless extension candidates. Maximal degree in co-relation 697. Up to 193 conditions per place. [2022-12-13 00:46:41,517 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 21 selfloop transitions, 7 changer transitions 2/31 dead transitions. [2022-12-13 00:46:41,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 204 flow [2022-12-13 00:46:41,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:46:41,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:46:41,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-13 00:46:41,520 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2022-12-13 00:46:41,520 INFO L175 Difference]: Start difference. First operand has 44 places, 25 transitions, 149 flow. Second operand 3 states and 34 transitions. [2022-12-13 00:46:41,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 204 flow [2022-12-13 00:46:41,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 31 transitions, 162 flow, removed 11 selfloop flow, removed 11 redundant places. [2022-12-13 00:46:41,523 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 124 flow [2022-12-13 00:46:41,523 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2022-12-13 00:46:41,525 INFO L295 CegarLoopForPetriNet]: 58 programPoint places, -23 predicate places. [2022-12-13 00:46:41,525 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:41,525 INFO L89 Accepts]: Start accepts. Operand has 35 places, 27 transitions, 124 flow [2022-12-13 00:46:41,526 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:41,526 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:41,526 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 27 transitions, 124 flow [2022-12-13 00:46:41,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 27 transitions, 124 flow [2022-12-13 00:46:41,541 INFO L130 PetriNetUnfolder]: 37/124 cut-off events. [2022-12-13 00:46:41,541 INFO L131 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2022-12-13 00:46:41,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 124 events. 37/124 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 579 event pairs, 16 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 300. Up to 79 conditions per place. [2022-12-13 00:46:41,542 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 27 transitions, 124 flow [2022-12-13 00:46:41,542 INFO L226 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-13 00:46:41,569 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [423] L2-1-->L840: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_273 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd0~0_106 256)))) (.cse4 (not (= (mod v_~y$r_buff1_thd0~0_106 256) 0)))) (let ((.cse1 (and .cse4 (not (= 0 (mod v_~y$w_buff1_used~0_257 256))))) (.cse2 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_274 256) 0)) .cse5))) (and (= v_~y~0_239 (ite .cse0 v_~y$w_buff0~0_192 (ite .cse1 v_~y$w_buff1~0_167 v_~y~0_240))) (= (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_257) v_~y$w_buff1_used~0_256) (= v_~y$r_buff1_thd0~0_105 (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd0~0_105 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_256 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_106)) (= (ite .cse2 0 v_~y$r_buff0_thd0~0_106) v_~y$r_buff0_thd0~0_105) (= (ite .cse0 0 v_~y$w_buff0_used~0_274) v_~y$w_buff0_used~0_273)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_274, ~y$w_buff1~0=v_~y$w_buff1~0_167, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_106, ~y$w_buff0~0=v_~y$w_buff0~0_192, ~y~0=v_~y~0_240, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_106, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_257} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_273, ~y$w_buff1~0=v_~y$w_buff1~0_167, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_105, ~y$w_buff0~0=v_~y$w_buff0~0_192, ~y~0=v_~y~0_239, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_105, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_256} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [343] L750-->L757: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_155 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd1~0_16 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_25 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff0_used~0_156 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_157 256) 0)) .cse1)) (.cse3 (and .cse2 .cse5))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_156) v_~y$w_buff0_used~0_155) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_156 256) 0)) .cse1) (and .cse2 (not (= (mod v_~y$r_buff0_thd1~0_24 256) 0)))) 0 v_~y$r_buff1_thd1~0_16) v_~y$r_buff1_thd1~0_15) (= v_~y$r_buff0_thd1~0_24 (ite .cse3 0 v_~y$r_buff0_thd1~0_25)) (= v_~y~0_145 (ite .cse0 v_~y$w_buff0~0_94 (ite .cse4 v_~y$w_buff1~0_83 v_~y~0_146))) (= (ite (or .cse4 .cse3) 0 v_~y$w_buff1_used~0_157) v_~y$w_buff1_used~0_156)))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_156, ~y$w_buff1~0=v_~y$w_buff1~0_83, ~y$w_buff0~0=v_~y$w_buff0~0_94, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_25, ~y~0=v_~y~0_146, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_157} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_155, ~y$w_buff1~0=v_~y$w_buff1~0_83, ~y$w_buff0~0=v_~y$w_buff0~0_94, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_24, ~y~0=v_~y~0_145, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_156} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 00:46:42,475 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [483] L829-3-->L757: Formula: (let ((.cse14 (not (= (mod v_~y$r_buff0_thd0~0_431 256) 0)))) (let ((.cse7 (and (not (= (mod v_~y$w_buff0_used~0_789 256) 0)) .cse14))) (let ((.cse4 (ite .cse7 0 v_~y$w_buff0_used~0_789))) (let ((.cse12 (not (= (mod v_~y$r_buff1_thd0~0_433 256) 0))) (.cse10 (not (= (mod .cse4 256) 0)))) (let ((.cse9 (and .cse14 .cse10)) (.cse8 (and (not (= (mod v_~y$w_buff1_used~0_728 256) 0)) .cse12))) (let ((.cse2 (ite (or .cse9 .cse8) 0 v_~y$w_buff1_used~0_728))) (let ((.cse5 (not (= (mod v_~y$w_buff0_used~0_788 256) 0))) (.cse11 (not (= (mod .cse2 256) 0))) (.cse6 (not (= (mod v_~y$r_buff1_thd1~0_141 256) 0))) (.cse13 (not (= (mod v_~y$r_buff0_thd1~0_205 256) 0)))) (let ((.cse3 (and .cse13 .cse10)) (.cse1 (and .cse11 .cse6)) (.cse0 (and .cse13 .cse5))) (and (= (ite (or .cse0 .cse1) 0 .cse2) v_~y$w_buff1_used~0_727) (= v_~y$w_buff0_used~0_788 (ite .cse3 0 .cse4)) (= v_~y$r_buff1_thd1~0_140 (ite (or (and .cse5 (not (= (mod v_~y$r_buff0_thd1~0_204 256) 0))) (and .cse6 (not (= (mod v_~y$w_buff1_used~0_727 256) 0)))) 0 v_~y$r_buff1_thd1~0_141)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| 0)) (= (ite .cse3 v_~y$w_buff0~0_613 (ite .cse1 v_~y$w_buff1~0_553 (ite .cse7 v_~y$w_buff0~0_613 (ite .cse8 v_~y$w_buff1~0_553 v_~y~0_705)))) v_~y~0_704) (= v_~y$r_buff0_thd1~0_204 (ite .cse0 0 v_~y$r_buff0_thd1~0_205)) (= v_~y$r_buff0_thd0~0_430 (ite .cse9 0 v_~y$r_buff0_thd0~0_431)) (= (mod v_~main$tmp_guard0~0_76 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_257 2) 1 0) 0) 0 1) v_~main$tmp_guard0~0_76) (= v_~y$r_buff1_thd0~0_432 (ite (or (and .cse10 (not (= (mod v_~y$r_buff0_thd0~0_430 256) 0))) (and .cse11 .cse12)) 0 v_~y$r_buff1_thd0~0_433))))))))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_141, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_789, ~y$w_buff1~0=v_~y$w_buff1~0_553, ~y$w_buff0~0=v_~y$w_buff0~0_613, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_431, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_205, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_257, ~y~0=v_~y~0_705, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_433, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_728} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_61|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_788, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_75|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_76, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_140, ~y$w_buff1~0=v_~y$w_buff1~0_553, ~y$w_buff0~0=v_~y$w_buff0~0_613, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_430, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_59|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_204, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_257, ~y~0=v_~y~0_704, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_432, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_727, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet10#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y$r_buff0_thd1~0, ~main$tmp_guard0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [436] L840-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse11 (= (mod v_~y$r_buff1_thd0~0_136 256) 0)) (.cse8 (= (mod v_~y$r_buff0_thd0~0_134 256) 0))) (let ((.cse9 (not .cse8)) (.cse4 (and (= (mod v_~y$w_buff1_used~0_285 256) 0) .cse8)) (.cse5 (and .cse11 .cse8)) (.cse12 (= (mod v_~y$w_buff0_used~0_306 256) 0))) (let ((.cse2 (or .cse4 .cse5 .cse12)) (.cse3 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse2 v_~y~0_266 (ite .cse3 v_~y$w_buff0~0_223 v_~y$w_buff1~0_194))) (.cse1 (not (= (mod v_~weak$$choice2~0_120 256) 0))) (.cse7 (= (mod v_~y$w_buff1_used~0_284 256) 0)) (.cse6 (= (mod v_~y$w_buff0_used~0_305 256) 0))) (and (= v_~y~0_266 v_~y$mem_tmp~0_96) (= v_~main$tmp_guard1~0_38 (ite (= 0 (ite (not (and (= .cse0 2) (= v_~__unbuffered_p1_EBX~0_48 1) (= v_~__unbuffered_p1_EAX~0_58 1) (= v_~x~0_56 2))) 1 0)) 0 1)) (= (ite .cse1 v_~y$w_buff0_used~0_306 (ite .cse2 v_~y$w_buff0_used~0_306 (ite .cse3 0 v_~y$w_buff0_used~0_306))) v_~y$w_buff0_used~0_305) (= v_~y~0_265 (ite .cse1 v_~y$mem_tmp~0_96 .cse0)) (= v_~y$w_buff0~0_223 v_~y$w_buff0~0_222) (= v_~y$w_buff1~0_194 v_~y$w_buff1~0_193) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_35| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|) (= v_~y$flush_delayed~0_113 0) (= (ite .cse1 v_~y$w_buff1_used~0_285 (ite (or .cse4 .cse5 .cse6) v_~y$w_buff1_used~0_285 0)) v_~y$w_buff1_used~0_284) (= v_~weak$$choice0~0_53 |v_ULTIMATE.start_main_#t~nondet11#1_69|) (= (mod v_~main$tmp_guard1~0_38 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_35|) (= v_~y$r_buff0_thd0~0_133 (ite .cse1 v_~y$r_buff0_thd0~0_134 (ite (or .cse5 (and .cse7 .cse8) .cse6) v_~y$r_buff0_thd0~0_134 (ite (and (not .cse6) .cse9) 0 v_~y$r_buff0_thd0~0_134)))) (= v_~weak$$choice2~0_120 |v_ULTIMATE.start_main_#t~nondet12#1_75|) (= v_~y$r_buff1_thd0~0_135 (ite .cse1 v_~y$r_buff1_thd0~0_136 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd0~0_133 256) 0))) (or (and .cse7 .cse10) (and .cse11 .cse10) .cse6)) v_~y$r_buff1_thd0~0_136 0)))))))) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_69|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_306, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_58, ~y$w_buff1~0=v_~y$w_buff1~0_194, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, ~y$w_buff0~0=v_~y$w_buff0~0_223, ~y~0=v_~y~0_266, ~x~0=v_~x~0_56, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_136, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_75|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_285} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_305, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~weak$$choice0~0=v_~weak$$choice0~0_53, ~y$mem_tmp~0=v_~y$mem_tmp~0_96, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_35|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_58, ~y$w_buff1~0=v_~y$w_buff1~0_193, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_133, ~y$w_buff0~0=v_~y$w_buff0~0_222, ~y$flush_delayed~0=v_~y$flush_delayed~0_113, ~y~0=v_~y~0_265, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~x~0=v_~x~0_56, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_135, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_284} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~nondet12#1, ~weak$$choice0~0, ~y$mem_tmp~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$r_buff0_thd0~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 00:46:43,179 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:46:43,180 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1655 [2022-12-13 00:46:43,180 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 126 flow [2022-12-13 00:46:43,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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-12-13 00:46:43,180 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:43,180 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:43,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:46:43,181 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:46:43,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:43,181 INFO L85 PathProgramCache]: Analyzing trace with hash 615358210, now seen corresponding path program 1 times [2022-12-13 00:46:43,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:43,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466479043] [2022-12-13 00:46:43,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:43,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:43,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:46:43,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:43,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466479043] [2022-12-13 00:46:43,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466479043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:43,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:43,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:46:43,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107623945] [2022-12-13 00:46:43,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:43,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:46:43,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:43,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:46:43,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:46:43,360 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-13 00:46:43,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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-12-13 00:46:43,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:43,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-13 00:46:43,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:43,428 INFO L130 PetriNetUnfolder]: 20/87 cut-off events. [2022-12-13 00:46:43,428 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2022-12-13 00:46:43,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 87 events. 20/87 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 317 event pairs, 2 based on Foata normal form. 21/84 useless extension candidates. Maximal degree in co-relation 308. Up to 46 conditions per place. [2022-12-13 00:46:43,429 INFO L137 encePairwiseOnDemand]: 11/20 looper letters, 13 selfloop transitions, 13 changer transitions 1/28 dead transitions. [2022-12-13 00:46:43,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 28 transitions, 178 flow [2022-12-13 00:46:43,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:46:43,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:46:43,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-13 00:46:43,430 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4125 [2022-12-13 00:46:43,430 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 126 flow. Second operand 4 states and 33 transitions. [2022-12-13 00:46:43,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 28 transitions, 178 flow [2022-12-13 00:46:43,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 28 transitions, 156 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-13 00:46:43,431 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 130 flow [2022-12-13 00:46:43,432 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2022-12-13 00:46:43,432 INFO L295 CegarLoopForPetriNet]: 58 programPoint places, -25 predicate places. [2022-12-13 00:46:43,432 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:43,432 INFO L89 Accepts]: Start accepts. Operand has 33 places, 25 transitions, 130 flow [2022-12-13 00:46:43,433 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:43,433 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:43,433 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 25 transitions, 130 flow [2022-12-13 00:46:43,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 25 transitions, 130 flow [2022-12-13 00:46:43,443 INFO L130 PetriNetUnfolder]: 10/70 cut-off events. [2022-12-13 00:46:43,443 INFO L131 PetriNetUnfolder]: For 18/24 co-relation queries the response was YES. [2022-12-13 00:46:43,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 70 events. 10/70 cut-off events. For 18/24 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 256 event pairs, 1 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 176. Up to 40 conditions per place. [2022-12-13 00:46:43,444 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 25 transitions, 130 flow [2022-12-13 00:46:43,444 INFO L226 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-13 00:46:46,242 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:46:46,243 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2811 [2022-12-13 00:46:46,243 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 126 flow [2022-12-13 00:46:46,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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-12-13 00:46:46,243 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:46,243 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:46,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:46:46,243 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:46:46,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:46,244 INFO L85 PathProgramCache]: Analyzing trace with hash 613233241, now seen corresponding path program 1 times [2022-12-13 00:46:46,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:46,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587309034] [2022-12-13 00:46:46,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:46,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:46:46,290 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:46:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:46:46,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:46:46,347 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:46:46,348 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 00:46:46,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-13 00:46:46,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 00:46:46,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 00:46:46,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-13 00:46:46,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:46:46,350 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:46,355 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:46:46,355 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:46:46,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:46:46 BasicIcfg [2022-12-13 00:46:46,419 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:46:46,423 INFO L158 Benchmark]: Toolchain (without parser) took 20973.19ms. Allocated memory was 164.6MB in the beginning and 515.9MB in the end (delta: 351.3MB). Free memory was 138.3MB in the beginning and 397.9MB in the end (delta: -259.6MB). Peak memory consumption was 92.6MB. Max. memory is 8.0GB. [2022-12-13 00:46:46,423 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 164.6MB. Free memory is still 141.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:46:46,423 INFO L158 Benchmark]: CACSL2BoogieTranslator took 544.11ms. Allocated memory is still 164.6MB. Free memory was 137.9MB in the beginning and 110.5MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 00:46:46,424 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.90ms. Allocated memory is still 164.6MB. Free memory was 110.5MB in the beginning and 107.5MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 00:46:46,424 INFO L158 Benchmark]: Boogie Preprocessor took 47.50ms. Allocated memory is still 164.6MB. Free memory was 107.5MB in the beginning and 105.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:46:46,424 INFO L158 Benchmark]: RCFGBuilder took 876.38ms. Allocated memory is still 164.6MB. Free memory was 105.3MB in the beginning and 105.8MB in the end (delta: -546.6kB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-13 00:46:46,424 INFO L158 Benchmark]: TraceAbstraction took 19452.34ms. Allocated memory was 164.6MB in the beginning and 515.9MB in the end (delta: 351.3MB). Free memory was 104.8MB in the beginning and 397.9MB in the end (delta: -293.2MB). Peak memory consumption was 59.1MB. Max. memory is 8.0GB. [2022-12-13 00:46:46,427 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.12ms. Allocated memory is still 164.6MB. Free memory is still 141.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 544.11ms. Allocated memory is still 164.6MB. Free memory was 137.9MB in the beginning and 110.5MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.90ms. Allocated memory is still 164.6MB. Free memory was 110.5MB in the beginning and 107.5MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.50ms. Allocated memory is still 164.6MB. Free memory was 107.5MB in the beginning and 105.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 876.38ms. Allocated memory is still 164.6MB. Free memory was 105.3MB in the beginning and 105.8MB in the end (delta: -546.6kB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 19452.34ms. Allocated memory was 164.6MB in the beginning and 515.9MB in the end (delta: 351.3MB). Free memory was 104.8MB in the beginning and 397.9MB in the end (delta: -293.2MB). Peak memory consumption was 59.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.0s, 93 PlacesBefore, 58 PlacesAfterwards, 88 TransitionsBefore, 51 TransitionsAfterwards, 1174 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 35 TrivialYvCompositions, 32 ConcurrentYvCompositions, 2 ChoiceCompositions, 71 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2319, independent: 2173, independent conditional: 2173, independent unconditional: 0, dependent: 146, dependent conditional: 146, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2319, independent: 2173, independent conditional: 0, independent unconditional: 2173, dependent: 146, dependent conditional: 0, dependent unconditional: 146, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2319, independent: 2173, independent conditional: 0, independent unconditional: 2173, dependent: 146, dependent conditional: 0, dependent unconditional: 146, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2319, independent: 2173, independent conditional: 0, independent unconditional: 2173, dependent: 146, dependent conditional: 0, dependent unconditional: 146, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1104, independent: 1055, independent conditional: 0, independent unconditional: 1055, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1104, independent: 1024, independent conditional: 0, independent unconditional: 1024, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 80, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 433, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 397, dependent conditional: 0, dependent unconditional: 397, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2319, independent: 1118, independent conditional: 0, independent unconditional: 1118, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 1104, unknown conditional: 0, unknown unconditional: 1104] , Statistics on independence cache: Total cache size (in pairs): 2031, Positive cache size: 1982, Positive conditional cache size: 0, Positive unconditional cache size: 1982, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 31 PlacesBefore, 31 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 126, independent: 98, independent conditional: 98, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 126, independent: 98, independent conditional: 5, independent unconditional: 93, dependent: 28, dependent conditional: 12, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 126, independent: 98, independent conditional: 5, independent unconditional: 93, dependent: 28, dependent conditional: 12, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 126, independent: 98, independent conditional: 5, independent unconditional: 93, dependent: 28, dependent conditional: 12, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 105, independent: 83, independent conditional: 5, independent unconditional: 78, dependent: 22, dependent conditional: 9, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 105, independent: 73, independent conditional: 0, independent unconditional: 73, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 32, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 22, dependent conditional: 9, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 116, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 105, dependent conditional: 51, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 126, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 6, dependent conditional: 3, dependent unconditional: 3, unknown: 105, unknown conditional: 14, unknown unconditional: 91] , Statistics on independence cache: Total cache size (in pairs): 105, Positive cache size: 83, Positive conditional cache size: 5, Positive unconditional cache size: 78, Negative cache size: 22, Negative conditional cache size: 9, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 35 PlacesBefore, 34 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 142, independent: 121, independent conditional: 121, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 142, independent: 121, independent conditional: 2, independent unconditional: 119, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 142, independent: 121, independent conditional: 2, independent unconditional: 119, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 142, independent: 121, independent conditional: 2, independent unconditional: 119, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 142, independent: 103, independent conditional: 2, independent unconditional: 101, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 24, unknown conditional: 0, unknown unconditional: 24] , Statistics on independence cache: Total cache size (in pairs): 134, Positive cache size: 106, Positive conditional cache size: 5, Positive unconditional cache size: 101, Negative cache size: 28, Negative conditional cache size: 9, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 41 PlacesBefore, 40 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 93, independent: 79, independent conditional: 79, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 93, independent: 79, independent conditional: 27, independent unconditional: 52, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 93, independent: 79, independent conditional: 21, independent unconditional: 58, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 93, independent: 79, independent conditional: 21, independent unconditional: 58, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 93, independent: 76, independent conditional: 20, independent unconditional: 56, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 5, unknown conditional: 1, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 120, Positive conditional cache size: 6, Positive unconditional cache size: 114, Negative cache size: 30, Negative conditional cache size: 9, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 48 PlacesBefore, 48 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 306 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 136, independent: 114, independent conditional: 114, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 136, independent: 114, independent conditional: 46, independent unconditional: 68, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 136, independent: 114, independent conditional: 46, independent unconditional: 68, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 136, independent: 114, independent conditional: 46, independent unconditional: 68, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 136, independent: 108, independent conditional: 46, independent unconditional: 62, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 126, Positive conditional cache size: 6, Positive unconditional cache size: 120, Negative cache size: 30, Negative conditional cache size: 9, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 46 PlacesBefore, 44 PlacesAfterwards, 27 TransitionsBefore, 25 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, independent: 47, independent conditional: 47, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 58, independent: 47, independent conditional: 21, independent unconditional: 26, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 58, independent: 47, independent conditional: 15, independent unconditional: 32, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 58, independent: 47, independent conditional: 15, independent unconditional: 32, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 58, independent: 40, independent conditional: 14, independent unconditional: 26, dependent: 9, dependent conditional: 3, dependent unconditional: 6, unknown: 9, unknown conditional: 3, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 158, Positive conditional cache size: 8, Positive unconditional cache size: 150, Negative cache size: 32, Negative conditional cache size: 11, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 34 PlacesBefore, 33 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 86 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27, independent: 21, independent conditional: 1, independent unconditional: 20, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 21, independent conditional: 1, independent unconditional: 20, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 21, independent conditional: 1, independent unconditional: 20, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, independent: 19, independent conditional: 1, independent unconditional: 18, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 192, Positive cache size: 160, Positive conditional cache size: 8, Positive unconditional cache size: 152, Negative cache size: 32, Negative conditional cache size: 11, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 33 PlacesBefore, 31 PlacesAfterwards, 25 TransitionsBefore, 23 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 193, Positive cache size: 161, Positive conditional cache size: 8, Positive unconditional cache size: 153, Negative cache size: 32, Negative conditional cache size: 11, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L826] 0 pthread_t t1585; [L827] FCALL, FORK 0 pthread_create(&t1585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1585, ((void *)0), P0, ((void *)0))=-1, t1585={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L828] 0 pthread_t t1586; [L829] FCALL, FORK 0 pthread_create(&t1586, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1586, ((void *)0), P1, ((void *)0))=0, t1585={5:0}, t1586={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 2 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$r_buff0_thd1 = (_Bool)1 [L749] 1 x = 1 [L766] 1 x = 2 [L769] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 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) [L777] 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)) [L778] 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)) [L779] 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)) [L780] 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)) [L781] 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)) [L782] 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)) [L783] 2 __unbuffered_p1_EAX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 2 y$flush_delayed = weak$$choice2 [L791] 2 y$mem_tmp = y [L792] 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) [L793] 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)) [L794] 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)) [L795] 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)) [L796] 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)) [L797] 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)) [L798] 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)) [L799] 2 __unbuffered_p1_EBX = y [L800] 2 y = y$flush_delayed ? y$mem_tmp : y [L801] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L805] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L806] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L807] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 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) [L836] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 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 [L838] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 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 [L842] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L843] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L844] 0 y$flush_delayed = weak$$choice2 [L845] 0 y$mem_tmp = y [L846] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L847] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L848] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L849] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L850] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L852] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L854] 0 y = y$flush_delayed ? y$mem_tmp : y [L855] 0 y$flush_delayed = (_Bool)0 [L857] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - 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: 827]: 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: 829]: 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 5 procedures, 110 locations, 5 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: 19.3s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 151 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 151 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 489 IncrementalHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 7 mSDtfsCounter, 489 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=4, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 729 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-12-13 00:46:46,462 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...