/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/rfi003_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:08:30,174 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:08:30,175 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:08:30,205 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:08:30,206 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:08:30,208 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:08:30,210 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:08:30,212 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:08:30,217 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:08:30,220 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:08:30,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:08:30,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:08:30,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:08:30,224 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:08:30,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:08:30,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:08:30,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:08:30,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:08:30,228 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:08:30,232 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:08:30,235 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:08:30,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:08:30,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:08:30,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:08:30,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:08:30,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:08:30,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:08:30,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:08:30,243 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:08:30,244 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:08:30,244 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:08:30,248 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:08:30,249 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:08:30,249 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:08:30,250 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:08:30,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:08:30,250 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:08:30,250 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:08:30,251 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:08:30,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:08:30,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:08:30,253 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-05 23:08:30,277 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:08:30,277 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:08:30,278 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:08:30,279 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:08:30,279 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:08:30,279 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:08:30,279 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:08:30,279 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:08:30,280 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:08:30,280 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:08:30,280 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:08:30,280 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:08:30,281 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:08:30,281 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:08:30,281 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:08:30,281 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:08:30,281 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:08:30,281 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:08:30,281 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:08:30,281 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:08:30,281 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:08:30,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:08:30,282 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:08:30,282 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:08:30,282 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:08:30,282 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:08:30,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:08:30,282 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:08:30,282 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-05 23:08:30,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:08:30,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:08:30,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:08:30,528 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:08:30,529 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:08:30,530 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_tso.i [2022-12-05 23:08:31,431 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:08:31,692 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:08:31,693 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_tso.i [2022-12-05 23:08:31,705 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/046103368/7b951dbdc05d4b6e9fc1b9879416f5b4/FLAG079f9b528 [2022-12-05 23:08:31,717 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/046103368/7b951dbdc05d4b6e9fc1b9879416f5b4 [2022-12-05 23:08:31,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:08:31,720 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:08:31,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:08:31,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:08:31,723 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:08:31,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:08:31" (1/1) ... [2022-12-05 23:08:31,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cea30f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:31, skipping insertion in model container [2022-12-05 23:08:31,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:08:31" (1/1) ... [2022-12-05 23:08:31,729 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:08:31,789 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:08:31,937 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/rfi003_tso.i[944,957] [2022-12-05 23:08:32,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:32,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:32,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:32,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:32,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:32,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:32,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:32,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:32,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:32,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:32,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:32,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:32,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:32,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:32,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:32,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:32,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:32,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:32,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:32,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:32,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:32,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:32,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:32,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:32,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:32,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:32,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:32,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:32,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:08:32,154 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:08:32,163 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/rfi003_tso.i[944,957] [2022-12-05 23:08:32,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:32,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:32,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:32,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:32,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:32,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:32,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:32,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:32,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:32,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:32,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:32,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:32,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:32,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:32,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:32,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:32,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:32,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:32,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:32,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:32,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:32,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:32,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:32,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:32,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:32,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:32,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:32,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:32,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:08:32,247 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:08:32,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:32 WrapperNode [2022-12-05 23:08:32,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:08:32,249 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:08:32,249 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:08:32,249 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:08:32,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:32" (1/1) ... [2022-12-05 23:08:32,280 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:32" (1/1) ... [2022-12-05 23:08:32,309 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2022-12-05 23:08:32,310 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:08:32,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:08:32,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:08:32,311 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:08:32,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:32" (1/1) ... [2022-12-05 23:08:32,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:32" (1/1) ... [2022-12-05 23:08:32,332 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:32" (1/1) ... [2022-12-05 23:08:32,333 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:32" (1/1) ... [2022-12-05 23:08:32,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:32" (1/1) ... [2022-12-05 23:08:32,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:32" (1/1) ... [2022-12-05 23:08:32,341 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:32" (1/1) ... [2022-12-05 23:08:32,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:32" (1/1) ... [2022-12-05 23:08:32,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:08:32,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:08:32,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:08:32,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:08:32,346 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:32" (1/1) ... [2022-12-05 23:08:32,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:08:32,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:08:32,370 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-05 23:08:32,396 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-05 23:08:32,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:08:32,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:08:32,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:08:32,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:08:32,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:08:32,421 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:08:32,421 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:08:32,421 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:08:32,421 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:08:32,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:08:32,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:08:32,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:08:32,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:08:32,422 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:08:32,561 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:08:32,562 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:08:32,866 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:08:32,993 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:08:32,993 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:08:32,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:08:32 BoogieIcfgContainer [2022-12-05 23:08:32,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:08:32,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:08:32,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:08:33,000 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:08:33,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:08:31" (1/3) ... [2022-12-05 23:08:33,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e9f17d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:08:33, skipping insertion in model container [2022-12-05 23:08:33,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:32" (2/3) ... [2022-12-05 23:08:33,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e9f17d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:08:33, skipping insertion in model container [2022-12-05 23:08:33,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:08:32" (3/3) ... [2022-12-05 23:08:33,002 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi003_tso.i [2022-12-05 23:08:33,015 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:08:33,015 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:08:33,015 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:08:33,052 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:08:33,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 92 transitions, 194 flow [2022-12-05 23:08:33,129 INFO L130 PetriNetUnfolder]: 2/90 cut-off events. [2022-12-05 23:08:33,130 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:08:33,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2022-12-05 23:08:33,134 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 92 transitions, 194 flow [2022-12-05 23:08:33,137 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 90 transitions, 186 flow [2022-12-05 23:08:33,138 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:33,154 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 90 transitions, 186 flow [2022-12-05 23:08:33,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 186 flow [2022-12-05 23:08:33,188 INFO L130 PetriNetUnfolder]: 2/90 cut-off events. [2022-12-05 23:08:33,189 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:08:33,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2022-12-05 23:08:33,193 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 90 transitions, 186 flow [2022-12-05 23:08:33,193 INFO L188 LiptonReduction]: Number of co-enabled transitions 1244 [2022-12-05 23:08:37,223 INFO L203 LiptonReduction]: Total number of compositions: 70 [2022-12-05 23:08:37,234 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:08:37,238 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;@37283281, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:08:37,238 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-05 23:08:37,240 INFO L130 PetriNetUnfolder]: 1/13 cut-off events. [2022-12-05 23:08:37,241 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:08:37,241 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:37,241 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-05 23:08:37,241 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:37,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:37,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1327116270, now seen corresponding path program 1 times [2022-12-05 23:08:37,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:37,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549332653] [2022-12-05 23:08:37,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:37,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:37,521 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-05 23:08:37,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:37,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549332653] [2022-12-05 23:08:37,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549332653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:37,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:37,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:08:37,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124986884] [2022-12-05 23:08:37,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:37,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:08:37,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:37,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:08:37,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:08:37,542 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-05 23:08:37,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-05 23:08:37,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:37,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-05 23:08:37,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:37,691 INFO L130 PetriNetUnfolder]: 322/545 cut-off events. [2022-12-05 23:08:37,691 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 23:08:37,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1104 conditions, 545 events. 322/545 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2159 event pairs, 77 based on Foata normal form. 0/474 useless extension candidates. Maximal degree in co-relation 1094. Up to 396 conditions per place. [2022-12-05 23:08:37,695 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 22 selfloop transitions, 2 changer transitions 4/29 dead transitions. [2022-12-05 23:08:37,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 29 transitions, 120 flow [2022-12-05 23:08:37,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:08:37,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:08:37,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-05 23:08:37,702 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2022-12-05 23:08:37,703 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 52 flow. Second operand 3 states and 36 transitions. [2022-12-05 23:08:37,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 29 transitions, 120 flow [2022-12-05 23:08:37,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:08:37,706 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 44 flow [2022-12-05 23:08:37,707 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2022-12-05 23:08:37,709 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -2 predicate places. [2022-12-05 23:08:37,710 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:37,710 INFO L89 Accepts]: Start accepts. Operand has 27 places, 18 transitions, 44 flow [2022-12-05 23:08:37,712 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:37,712 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:37,712 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 18 transitions, 44 flow [2022-12-05 23:08:37,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 18 transitions, 44 flow [2022-12-05 23:08:37,716 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-05 23:08:37,716 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:08:37,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 18 events. 0/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 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-05 23:08:37,717 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 18 transitions, 44 flow [2022-12-05 23:08:37,717 INFO L188 LiptonReduction]: Number of co-enabled transitions 146 [2022-12-05 23:08:37,832 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:08:37,834 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-05 23:08:37,834 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 44 flow [2022-12-05 23:08:37,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-05 23:08:37,834 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:37,834 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:37,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:08:37,834 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:37,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:37,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1809060892, now seen corresponding path program 1 times [2022-12-05 23:08:37,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:37,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597584870] [2022-12-05 23:08:37,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:37,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:38,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:08:38,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:38,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597584870] [2022-12-05 23:08:38,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597584870] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:38,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:38,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:08:38,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406986853] [2022-12-05 23:08:38,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:38,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:08:38,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:38,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:08:38,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:08:38,354 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-05 23:08:38,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 44 flow. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-05 23:08:38,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:38,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-05 23:08:38,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:38,458 INFO L130 PetriNetUnfolder]: 220/383 cut-off events. [2022-12-05 23:08:38,458 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-05 23:08:38,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 802 conditions, 383 events. 220/383 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1271 event pairs, 92 based on Foata normal form. 18/401 useless extension candidates. Maximal degree in co-relation 792. Up to 243 conditions per place. [2022-12-05 23:08:38,461 INFO L137 encePairwiseOnDemand]: 15/18 looper letters, 23 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2022-12-05 23:08:38,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 25 transitions, 108 flow [2022-12-05 23:08:38,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:08:38,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:08:38,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-05 23:08:38,462 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2022-12-05 23:08:38,462 INFO L175 Difference]: Start difference. First operand has 25 places, 18 transitions, 44 flow. Second operand 3 states and 26 transitions. [2022-12-05 23:08:38,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 25 transitions, 108 flow [2022-12-05 23:08:38,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 25 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:08:38,463 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 48 flow [2022-12-05 23:08:38,463 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2022-12-05 23:08:38,464 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -3 predicate places. [2022-12-05 23:08:38,464 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:38,464 INFO L89 Accepts]: Start accepts. Operand has 26 places, 18 transitions, 48 flow [2022-12-05 23:08:38,464 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:38,464 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:38,464 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 18 transitions, 48 flow [2022-12-05 23:08:38,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 18 transitions, 48 flow [2022-12-05 23:08:38,468 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-05 23:08:38,468 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:08:38,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 18 events. 0/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:08:38,468 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 18 transitions, 48 flow [2022-12-05 23:08:38,468 INFO L188 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-05 23:08:38,569 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:08:38,570 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-05 23:08:38,570 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 48 flow [2022-12-05 23:08:38,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-05 23:08:38,570 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:38,570 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:38,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:08:38,570 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:38,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:38,571 INFO L85 PathProgramCache]: Analyzing trace with hash -483162949, now seen corresponding path program 1 times [2022-12-05 23:08:38,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:38,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069978163] [2022-12-05 23:08:38,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:38,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:38,709 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-05 23:08:38,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:38,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069978163] [2022-12-05 23:08:38,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069978163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:38,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:38,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:08:38,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098234539] [2022-12-05 23:08:38,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:38,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:08:38,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:38,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:08:38,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:08:38,711 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-05 23:08:38,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-05 23:08:38,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:38,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-05 23:08:38,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:38,800 INFO L130 PetriNetUnfolder]: 170/303 cut-off events. [2022-12-05 23:08:38,801 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-05 23:08:38,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 666 conditions, 303 events. 170/303 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1019 event pairs, 92 based on Foata normal form. 5/307 useless extension candidates. Maximal degree in co-relation 655. Up to 153 conditions per place. [2022-12-05 23:08:38,803 INFO L137 encePairwiseOnDemand]: 15/18 looper letters, 21 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2022-12-05 23:08:38,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 24 transitions, 106 flow [2022-12-05 23:08:38,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:08:38,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:08:38,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-12-05 23:08:38,806 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-05 23:08:38,806 INFO L175 Difference]: Start difference. First operand has 26 places, 18 transitions, 48 flow. Second operand 3 states and 27 transitions. [2022-12-05 23:08:38,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 24 transitions, 106 flow [2022-12-05 23:08:38,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 24 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:08:38,807 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 52 flow [2022-12-05 23:08:38,807 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2022-12-05 23:08:38,808 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -2 predicate places. [2022-12-05 23:08:38,808 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:38,808 INFO L89 Accepts]: Start accepts. Operand has 27 places, 18 transitions, 52 flow [2022-12-05 23:08:38,808 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:38,809 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:38,809 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 18 transitions, 52 flow [2022-12-05 23:08:38,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 18 transitions, 52 flow [2022-12-05 23:08:38,813 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-05 23:08:38,813 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 23:08:38,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 18 events. 0/18 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:08:38,814 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 18 transitions, 52 flow [2022-12-05 23:08:38,814 INFO L188 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-05 23:08:38,815 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:08:38,815 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-05 23:08:38,816 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 52 flow [2022-12-05 23:08:38,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-05 23:08:38,816 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:38,816 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:38,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:08:38,816 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:38,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:38,817 INFO L85 PathProgramCache]: Analyzing trace with hash -2093151567, now seen corresponding path program 1 times [2022-12-05 23:08:38,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:38,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250478071] [2022-12-05 23:08:38,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:38,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:39,346 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-05 23:08:39,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:39,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250478071] [2022-12-05 23:08:39,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250478071] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:39,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:39,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:08:39,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283399029] [2022-12-05 23:08:39,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:39,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 23:08:39,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:39,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 23:08:39,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-05 23:08:39,348 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-05 23:08:39,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 52 flow. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-05 23:08:39,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:39,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-05 23:08:39,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:39,447 INFO L130 PetriNetUnfolder]: 173/315 cut-off events. [2022-12-05 23:08:39,448 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-12-05 23:08:39,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718 conditions, 315 events. 173/315 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1104 event pairs, 65 based on Foata normal form. 1/316 useless extension candidates. Maximal degree in co-relation 706. Up to 285 conditions per place. [2022-12-05 23:08:39,449 INFO L137 encePairwiseOnDemand]: 10/18 looper letters, 24 selfloop transitions, 12 changer transitions 0/37 dead transitions. [2022-12-05 23:08:39,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 37 transitions, 168 flow [2022-12-05 23:08:39,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:08:39,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:08:39,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-12-05 23:08:39,451 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39814814814814814 [2022-12-05 23:08:39,451 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 52 flow. Second operand 6 states and 43 transitions. [2022-12-05 23:08:39,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 37 transitions, 168 flow [2022-12-05 23:08:39,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 37 transitions, 157 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-05 23:08:39,453 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 124 flow [2022-12-05 23:08:39,453 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=124, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2022-12-05 23:08:39,453 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2022-12-05 23:08:39,453 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:39,453 INFO L89 Accepts]: Start accepts. Operand has 33 places, 30 transitions, 124 flow [2022-12-05 23:08:39,454 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:39,454 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:39,454 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 30 transitions, 124 flow [2022-12-05 23:08:39,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 30 transitions, 124 flow [2022-12-05 23:08:39,462 INFO L130 PetriNetUnfolder]: 17/69 cut-off events. [2022-12-05 23:08:39,462 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-05 23:08:39,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 69 events. 17/69 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 222 event pairs, 2 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 140. Up to 20 conditions per place. [2022-12-05 23:08:39,463 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 30 transitions, 124 flow [2022-12-05 23:08:39,463 INFO L188 LiptonReduction]: Number of co-enabled transitions 150 [2022-12-05 23:08:39,587 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [362] L768-->L779: Formula: (and (= v_~y$r_buff0_thd0~0_In_1 v_~y$r_buff1_thd0~0_Out_2) (= v_~y$w_buff0_used~0_Out_2 1) (= v_~y$r_buff0_thd2~0_In_1 v_~y$r_buff1_thd2~0_Out_2) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_Out_2 256) 0)) (not (= (mod v_~y$w_buff1_used~0_Out_2 256) 0)))) 1 0)) (= v_~y$w_buff0_used~0_In_1 v_~y$w_buff1_used~0_Out_2) (= 1 v_~y$r_buff0_thd2~0_Out_2) (= v_~y$w_buff1~0_Out_2 v_~y$w_buff0~0_In_1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_3| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_3| 0)) (= v_~y$w_buff0~0_Out_2 1) (= v_~y$r_buff1_thd1~0_Out_2 v_~y$r_buff0_thd1~0_In_1)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_1, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_In_1, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_In_1, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_2, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_Out_2, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_Out_2, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3|, ~y$w_buff1~0=v_~y$w_buff1~0_Out_2, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_Out_2, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_Out_2, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_Out_2, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_Out_2} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$w_buff1_used~0] and [380] $Ultimate##0-->L741: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= v_~y~0_181 2)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~y~0=v_~y~0_181, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-05 23:08:39,908 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [362] L768-->L779: Formula: (and (= v_~y$r_buff0_thd0~0_In_1 v_~y$r_buff1_thd0~0_Out_2) (= v_~y$w_buff0_used~0_Out_2 1) (= v_~y$r_buff0_thd2~0_In_1 v_~y$r_buff1_thd2~0_Out_2) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_Out_2 256) 0)) (not (= (mod v_~y$w_buff1_used~0_Out_2 256) 0)))) 1 0)) (= v_~y$w_buff0_used~0_In_1 v_~y$w_buff1_used~0_Out_2) (= 1 v_~y$r_buff0_thd2~0_Out_2) (= v_~y$w_buff1~0_Out_2 v_~y$w_buff0~0_In_1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_3| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_3| 0)) (= v_~y$w_buff0~0_Out_2 1) (= v_~y$r_buff1_thd1~0_Out_2 v_~y$r_buff0_thd1~0_In_1)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_1, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_In_1, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_In_1, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_2, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_Out_2, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_Out_2, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3|, ~y$w_buff1~0=v_~y$w_buff1~0_Out_2, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_Out_2, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_Out_2, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_Out_2, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_Out_2} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$w_buff1_used~0] and [409] L842-->L849: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_119 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_277 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_114 256) 0)))) (let ((.cse0 (and .cse2 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_254 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_278 256) 0)) .cse5))) (and (= v_~y$w_buff1_used~0_253 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_254)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| 0)) (= v_~y$r_buff0_thd0~0_113 (ite .cse0 0 v_~y$r_buff0_thd0~0_114)) (= v_~y$r_buff1_thd0~0_118 (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_113 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$w_buff1_used~0_253 256) 0)))) 0 v_~y$r_buff1_thd0~0_119)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (= v_~y~0_214 (ite .cse4 v_~y$w_buff0~0_137 (ite .cse1 v_~y$w_buff1~0_135 v_~y~0_215))) (= (ite .cse4 0 v_~y$w_buff0_used~0_278) v_~y$w_buff0_used~0_277)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_278, ~y$w_buff1~0=v_~y$w_buff1~0_135, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_114, ~y$w_buff0~0=v_~y$w_buff0~0_137, ~y~0=v_~y~0_215, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_119, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_254, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_277, ~y$w_buff1~0=v_~y$w_buff1~0_135, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_113, ~y$w_buff0~0=v_~y$w_buff0~0_137, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ~y~0=v_~y~0_214, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_118, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_253, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-05 23:08:40,254 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [456] L768-->L795: Formula: (let ((.cse0 (not (= (mod v_~weak$$choice2~0_248 256) 0))) (.cse1 (= (mod v_~y$w_buff0_used~0_725 256) 0))) (and (= v_~weak$$choice0~0_167 |v_P1Thread1of1ForFork1_#t~nondet3#1_38|) (= v_~y~0_652 (ite .cse0 v_~y$mem_tmp~0_200 v_~__unbuffered_p1_EAX~0_112)) (= (ite .cse0 1 0) v_~y$w_buff0_used~0_725) (= v_~weak$$choice2~0_248 |v_P1Thread1of1ForFork1_#t~nondet4#1_38|) (= v_~y$r_buff0_thd1~0_219 v_~y$r_buff1_thd1~0_212) (= v_~y$w_buff1_used~0_687 (ite .cse0 v_~y$w_buff0_used~0_727 (ite .cse1 v_~y$w_buff0_used~0_727 0))) (= v_~y$w_buff1~0_435 v_~y$w_buff0~0_453) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_39| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_39|) (= v_~y~0_653 v_~y$mem_tmp~0_200) (= (ite .cse0 v_~y$r_buff0_thd2~0_338 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd2~0_336 256) 0))) (or .cse1 (and .cse2 (= (mod v_~y$r_buff0_thd2~0_338 256) 0)) (and (= (mod v_~y$w_buff1_used~0_687 256) 0) .cse2))) v_~y$r_buff0_thd2~0_338 0)) v_~y$r_buff1_thd2~0_281) (= v_~__unbuffered_p1_EAX~0_112 v_~y$w_buff0~0_451) (= v_~y$w_buff0~0_451 1) (= v_~y$r_buff0_thd2~0_336 (ite .cse0 1 (ite .cse1 1 (ite (not .cse1) 0 1)))) (= v_~y$flush_delayed~0_219 0) (= v_~y$r_buff0_thd0~0_344 v_~y$r_buff1_thd0~0_352) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_39| 0)) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_39| (ite (= (mod v_~y$w_buff0_used~0_727 256) 0) 1 0)))) InVars {P1Thread1of1ForFork1_#t~nondet4#1=|v_P1Thread1of1ForFork1_#t~nondet4#1_38|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_727, ~y$w_buff0~0=v_~y$w_buff0~0_453, P1Thread1of1ForFork1_#t~nondet3#1=|v_P1Thread1of1ForFork1_#t~nondet3#1_38|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_344, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_338, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y~0=v_~y~0_653} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_725, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_39|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_281, ~weak$$choice0~0=v_~weak$$choice0~0_167, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_212, ~y$mem_tmp~0=v_~y$mem_tmp~0_200, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_112, ~y$w_buff1~0=v_~y$w_buff1~0_435, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_39|, ~y$w_buff0~0=v_~y$w_buff0~0_451, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_344, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_336, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_219, ~y~0=v_~y~0_652, ~weak$$choice2~0=v_~weak$$choice2~0_248, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_352, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_687} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet3#1, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, P1Thread1of1ForFork1_#t~nondet4#1, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [409] L842-->L849: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_119 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_277 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_114 256) 0)))) (let ((.cse0 (and .cse2 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_254 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_278 256) 0)) .cse5))) (and (= v_~y$w_buff1_used~0_253 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_254)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| 0)) (= v_~y$r_buff0_thd0~0_113 (ite .cse0 0 v_~y$r_buff0_thd0~0_114)) (= v_~y$r_buff1_thd0~0_118 (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_113 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$w_buff1_used~0_253 256) 0)))) 0 v_~y$r_buff1_thd0~0_119)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (= v_~y~0_214 (ite .cse4 v_~y$w_buff0~0_137 (ite .cse1 v_~y$w_buff1~0_135 v_~y~0_215))) (= (ite .cse4 0 v_~y$w_buff0_used~0_278) v_~y$w_buff0_used~0_277)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_278, ~y$w_buff1~0=v_~y$w_buff1~0_135, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_114, ~y$w_buff0~0=v_~y$w_buff0~0_137, ~y~0=v_~y~0_215, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_119, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_254, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_277, ~y$w_buff1~0=v_~y$w_buff1~0_135, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_113, ~y$w_buff0~0=v_~y$w_buff0~0_137, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ~y~0=v_~y~0_214, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_118, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_253, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-05 23:08:40,518 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [456] L768-->L795: Formula: (let ((.cse0 (not (= (mod v_~weak$$choice2~0_248 256) 0))) (.cse1 (= (mod v_~y$w_buff0_used~0_725 256) 0))) (and (= v_~weak$$choice0~0_167 |v_P1Thread1of1ForFork1_#t~nondet3#1_38|) (= v_~y~0_652 (ite .cse0 v_~y$mem_tmp~0_200 v_~__unbuffered_p1_EAX~0_112)) (= (ite .cse0 1 0) v_~y$w_buff0_used~0_725) (= v_~weak$$choice2~0_248 |v_P1Thread1of1ForFork1_#t~nondet4#1_38|) (= v_~y$r_buff0_thd1~0_219 v_~y$r_buff1_thd1~0_212) (= v_~y$w_buff1_used~0_687 (ite .cse0 v_~y$w_buff0_used~0_727 (ite .cse1 v_~y$w_buff0_used~0_727 0))) (= v_~y$w_buff1~0_435 v_~y$w_buff0~0_453) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_39| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_39|) (= v_~y~0_653 v_~y$mem_tmp~0_200) (= (ite .cse0 v_~y$r_buff0_thd2~0_338 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd2~0_336 256) 0))) (or .cse1 (and .cse2 (= (mod v_~y$r_buff0_thd2~0_338 256) 0)) (and (= (mod v_~y$w_buff1_used~0_687 256) 0) .cse2))) v_~y$r_buff0_thd2~0_338 0)) v_~y$r_buff1_thd2~0_281) (= v_~__unbuffered_p1_EAX~0_112 v_~y$w_buff0~0_451) (= v_~y$w_buff0~0_451 1) (= v_~y$r_buff0_thd2~0_336 (ite .cse0 1 (ite .cse1 1 (ite (not .cse1) 0 1)))) (= v_~y$flush_delayed~0_219 0) (= v_~y$r_buff0_thd0~0_344 v_~y$r_buff1_thd0~0_352) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_39| 0)) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_39| (ite (= (mod v_~y$w_buff0_used~0_727 256) 0) 1 0)))) InVars {P1Thread1of1ForFork1_#t~nondet4#1=|v_P1Thread1of1ForFork1_#t~nondet4#1_38|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_727, ~y$w_buff0~0=v_~y$w_buff0~0_453, P1Thread1of1ForFork1_#t~nondet3#1=|v_P1Thread1of1ForFork1_#t~nondet3#1_38|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_344, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_338, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y~0=v_~y~0_653} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_725, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_39|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_281, ~weak$$choice0~0=v_~weak$$choice0~0_167, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_212, ~y$mem_tmp~0=v_~y$mem_tmp~0_200, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_112, ~y$w_buff1~0=v_~y$w_buff1~0_435, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_39|, ~y$w_buff0~0=v_~y$w_buff0~0_451, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_344, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_336, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_219, ~y~0=v_~y~0_652, ~weak$$choice2~0=v_~weak$$choice2~0_248, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_352, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_687} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet3#1, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, P1Thread1of1ForFork1_#t~nondet4#1, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [380] $Ultimate##0-->L741: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= v_~y~0_181 2)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~y~0=v_~y~0_181, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-05 23:08:41,054 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [460] L768-->L811: Formula: (let ((.cse18 (not (= (mod |v_P1Thread1of1ForFork1_#t~nondet4#1_50| 256) 0)))) (let ((.cse13 (ite .cse18 1 0))) (let ((.cse19 (= (mod .cse13 256) 0))) (let ((.cse17 (not .cse19))) (let ((.cse1 (ite .cse18 1 (ite .cse19 1 (ite .cse17 0 1))))) (let ((.cse2 (= (mod .cse1 256) 0)) (.cse8 (ite .cse18 v_~y$w_buff0_used~0_749 (ite .cse19 v_~y$w_buff0_used~0_749 0)))) (let ((.cse9 (and .cse2 (= (mod .cse8 256) 0)))) (let ((.cse10 (ite .cse18 v_~y$r_buff0_thd2~0_356 (ite (or (and .cse2 (= 0 (mod v_~y$r_buff0_thd2~0_356 256))) .cse9 .cse19) v_~y$r_buff0_thd2~0_356 0)))) (let ((.cse12 (= (mod .cse10 256) 0))) (let ((.cse6 (not .cse2)) (.cse5 (and .cse2 .cse12))) (let ((.cse14 (or .cse9 .cse5 .cse19)) (.cse16 (ite .cse18 v_~y~0_674 v_~__unbuffered_p1_EAX~0_118)) (.cse15 (and .cse17 .cse6))) (let ((.cse3 (= (mod v_~y$w_buff1_used~0_701 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_747 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_254 256) 0))) (.cse7 (ite .cse14 .cse16 (ite .cse15 v_~__unbuffered_p1_EAX~0_118 v_~y$w_buff0~0_471)))) (and (= v_~y$r_buff0_thd2~0_354 (ite .cse0 .cse1 (ite (or (and .cse2 .cse3) .cse4 .cse5) .cse1 (ite (and .cse6 (not .cse4)) 0 .cse1)))) (= v_~y~0_672 (ite .cse0 v_~y$mem_tmp~0_206 .cse7)) (= (ite (= (mod v_~y$w_buff0_used~0_749 256) 0) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_47|) (= v_~y$w_buff1_used~0_701 (ite .cse0 .cse8 (ite (or .cse4 .cse9 .cse5) .cse8 0))) (= v_~y$r_buff1_thd2~0_291 (ite .cse0 .cse10 (ite (let ((.cse11 (= (mod v_~y$r_buff0_thd2~0_354 256) 0))) (or (and .cse3 .cse11) (and .cse11 .cse12) .cse4)) .cse10 0))) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_47| 0)) (= v_~weak$$choice2~0_254 |v_P1Thread1of1ForFork1_#t~nondet6#1_46|) (= (ite .cse0 .cse13 (ite .cse14 .cse13 (ite .cse15 0 .cse13))) v_~y$w_buff0_used~0_747) (= v_~weak$$choice0~0_173 |v_P1Thread1of1ForFork1_#t~nondet5#1_46|) (= v_~__unbuffered_p1_EAX~0_118 v_~y$w_buff0~0_469) (= v_~y$flush_delayed~0_225 0) (= v_~y$w_buff1~0_445 v_~y$w_buff0~0_471) (= v_~__unbuffered_p1_EBX~0_107 .cse7) (= v_~__unbuffered_p1_EAX~0_118 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_47| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_47|) (= v_~y$r_buff0_thd0~0_356 v_~y$r_buff1_thd0~0_364) (= v_~y$mem_tmp~0_206 .cse16) (= v_~y$r_buff0_thd1~0_227 v_~y$r_buff1_thd1~0_220)))))))))))))) InVars {P1Thread1of1ForFork1_#t~nondet4#1=|v_P1Thread1of1ForFork1_#t~nondet4#1_50|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_749, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_46|, ~y$w_buff0~0=v_~y$w_buff0~0_471, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_356, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_356, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_227, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_46|, ~y~0=v_~y~0_674} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_107, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_747, P1Thread1of1ForFork1_#t~nondet3#1=|v_P1Thread1of1ForFork1_#t~nondet3#1_49|, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_47|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_291, ~weak$$choice0~0=v_~weak$$choice0~0_173, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_220, ~y$mem_tmp~0=v_~y$mem_tmp~0_206, ~y$w_buff1~0=v_~y$w_buff1~0_445, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_118, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_47|, ~y$w_buff0~0=v_~y$w_buff0~0_469, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_356, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_354, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_227, ~y$flush_delayed~0=v_~y$flush_delayed~0_225, ~y~0=v_~y~0_672, ~weak$$choice2~0=v_~weak$$choice2~0_254, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_364, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_701} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet5#1, P1Thread1of1ForFork1_#t~nondet3#1, P1Thread1of1ForFork1_#t~nondet6#1, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, P1Thread1of1ForFork1_#t~nondet4#1, ~y$mem_tmp~0, ~y$w_buff1~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [380] $Ultimate##0-->L741: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= v_~y~0_181 2)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~y~0=v_~y~0_181, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-05 23:08:41,749 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [460] L768-->L811: Formula: (let ((.cse18 (not (= (mod |v_P1Thread1of1ForFork1_#t~nondet4#1_50| 256) 0)))) (let ((.cse13 (ite .cse18 1 0))) (let ((.cse19 (= (mod .cse13 256) 0))) (let ((.cse17 (not .cse19))) (let ((.cse1 (ite .cse18 1 (ite .cse19 1 (ite .cse17 0 1))))) (let ((.cse2 (= (mod .cse1 256) 0)) (.cse8 (ite .cse18 v_~y$w_buff0_used~0_749 (ite .cse19 v_~y$w_buff0_used~0_749 0)))) (let ((.cse9 (and .cse2 (= (mod .cse8 256) 0)))) (let ((.cse10 (ite .cse18 v_~y$r_buff0_thd2~0_356 (ite (or (and .cse2 (= 0 (mod v_~y$r_buff0_thd2~0_356 256))) .cse9 .cse19) v_~y$r_buff0_thd2~0_356 0)))) (let ((.cse12 (= (mod .cse10 256) 0))) (let ((.cse6 (not .cse2)) (.cse5 (and .cse2 .cse12))) (let ((.cse14 (or .cse9 .cse5 .cse19)) (.cse16 (ite .cse18 v_~y~0_674 v_~__unbuffered_p1_EAX~0_118)) (.cse15 (and .cse17 .cse6))) (let ((.cse3 (= (mod v_~y$w_buff1_used~0_701 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_747 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_254 256) 0))) (.cse7 (ite .cse14 .cse16 (ite .cse15 v_~__unbuffered_p1_EAX~0_118 v_~y$w_buff0~0_471)))) (and (= v_~y$r_buff0_thd2~0_354 (ite .cse0 .cse1 (ite (or (and .cse2 .cse3) .cse4 .cse5) .cse1 (ite (and .cse6 (not .cse4)) 0 .cse1)))) (= v_~y~0_672 (ite .cse0 v_~y$mem_tmp~0_206 .cse7)) (= (ite (= (mod v_~y$w_buff0_used~0_749 256) 0) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_47|) (= v_~y$w_buff1_used~0_701 (ite .cse0 .cse8 (ite (or .cse4 .cse9 .cse5) .cse8 0))) (= v_~y$r_buff1_thd2~0_291 (ite .cse0 .cse10 (ite (let ((.cse11 (= (mod v_~y$r_buff0_thd2~0_354 256) 0))) (or (and .cse3 .cse11) (and .cse11 .cse12) .cse4)) .cse10 0))) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_47| 0)) (= v_~weak$$choice2~0_254 |v_P1Thread1of1ForFork1_#t~nondet6#1_46|) (= (ite .cse0 .cse13 (ite .cse14 .cse13 (ite .cse15 0 .cse13))) v_~y$w_buff0_used~0_747) (= v_~weak$$choice0~0_173 |v_P1Thread1of1ForFork1_#t~nondet5#1_46|) (= v_~__unbuffered_p1_EAX~0_118 v_~y$w_buff0~0_469) (= v_~y$flush_delayed~0_225 0) (= v_~y$w_buff1~0_445 v_~y$w_buff0~0_471) (= v_~__unbuffered_p1_EBX~0_107 .cse7) (= v_~__unbuffered_p1_EAX~0_118 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_47| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_47|) (= v_~y$r_buff0_thd0~0_356 v_~y$r_buff1_thd0~0_364) (= v_~y$mem_tmp~0_206 .cse16) (= v_~y$r_buff0_thd1~0_227 v_~y$r_buff1_thd1~0_220)))))))))))))) InVars {P1Thread1of1ForFork1_#t~nondet4#1=|v_P1Thread1of1ForFork1_#t~nondet4#1_50|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_749, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_46|, ~y$w_buff0~0=v_~y$w_buff0~0_471, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_356, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_356, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_227, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_46|, ~y~0=v_~y~0_674} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_107, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_747, P1Thread1of1ForFork1_#t~nondet3#1=|v_P1Thread1of1ForFork1_#t~nondet3#1_49|, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_47|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_291, ~weak$$choice0~0=v_~weak$$choice0~0_173, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_220, ~y$mem_tmp~0=v_~y$mem_tmp~0_206, ~y$w_buff1~0=v_~y$w_buff1~0_445, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_118, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_47|, ~y$w_buff0~0=v_~y$w_buff0~0_469, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_356, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_354, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_227, ~y$flush_delayed~0=v_~y$flush_delayed~0_225, ~y~0=v_~y~0_672, ~weak$$choice2~0=v_~weak$$choice2~0_254, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_364, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_701} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet5#1, P1Thread1of1ForFork1_#t~nondet3#1, P1Thread1of1ForFork1_#t~nondet6#1, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, P1Thread1of1ForFork1_#t~nondet4#1, ~y$mem_tmp~0, ~y$w_buff1~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [409] L842-->L849: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_119 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_277 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_114 256) 0)))) (let ((.cse0 (and .cse2 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_254 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_278 256) 0)) .cse5))) (and (= v_~y$w_buff1_used~0_253 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_254)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| 0)) (= v_~y$r_buff0_thd0~0_113 (ite .cse0 0 v_~y$r_buff0_thd0~0_114)) (= v_~y$r_buff1_thd0~0_118 (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_113 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$w_buff1_used~0_253 256) 0)))) 0 v_~y$r_buff1_thd0~0_119)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (= v_~y~0_214 (ite .cse4 v_~y$w_buff0~0_137 (ite .cse1 v_~y$w_buff1~0_135 v_~y~0_215))) (= (ite .cse4 0 v_~y$w_buff0_used~0_278) v_~y$w_buff0_used~0_277)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_278, ~y$w_buff1~0=v_~y$w_buff1~0_135, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_114, ~y$w_buff0~0=v_~y$w_buff0~0_137, ~y~0=v_~y~0_215, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_119, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_254, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_277, ~y$w_buff1~0=v_~y$w_buff1~0_135, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_113, ~y$w_buff0~0=v_~y$w_buff0~0_137, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ~y~0=v_~y~0_214, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_118, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_253, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-05 23:08:42,245 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:08:42,246 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2793 [2022-12-05 23:08:42,246 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 27 transitions, 150 flow [2022-12-05 23:08:42,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-05 23:08:42,247 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:42,247 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:42,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:08:42,247 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:42,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:42,247 INFO L85 PathProgramCache]: Analyzing trace with hash -246310810, now seen corresponding path program 1 times [2022-12-05 23:08:42,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:42,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273047439] [2022-12-05 23:08:42,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:42,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:42,626 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-05 23:08:42,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:42,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273047439] [2022-12-05 23:08:42,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273047439] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:42,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:42,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:08:42,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976509084] [2022-12-05 23:08:42,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:42,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:08:42,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:42,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:08:42,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:08:42,627 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-05 23:08:42,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-05 23:08:42,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:42,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-05 23:08:42,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:42,753 INFO L130 PetriNetUnfolder]: 172/315 cut-off events. [2022-12-05 23:08:42,753 INFO L131 PetriNetUnfolder]: For 199/199 co-relation queries the response was YES. [2022-12-05 23:08:42,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 881 conditions, 315 events. 172/315 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1231 event pairs, 44 based on Foata normal form. 3/318 useless extension candidates. Maximal degree in co-relation 866. Up to 279 conditions per place. [2022-12-05 23:08:42,755 INFO L137 encePairwiseOnDemand]: 13/25 looper letters, 30 selfloop transitions, 12 changer transitions 0/43 dead transitions. [2022-12-05 23:08:42,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 43 transitions, 320 flow [2022-12-05 23:08:42,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:08:42,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:08:42,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-05 23:08:42,757 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46 [2022-12-05 23:08:42,757 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 150 flow. Second operand 4 states and 46 transitions. [2022-12-05 23:08:42,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 43 transitions, 320 flow [2022-12-05 23:08:42,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 43 transitions, 264 flow, removed 28 selfloop flow, removed 2 redundant places. [2022-12-05 23:08:42,758 INFO L231 Difference]: Finished difference. Result has 33 places, 34 transitions, 212 flow [2022-12-05 23:08:42,759 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=33, PETRI_TRANSITIONS=34} [2022-12-05 23:08:42,759 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2022-12-05 23:08:42,759 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:42,759 INFO L89 Accepts]: Start accepts. Operand has 33 places, 34 transitions, 212 flow [2022-12-05 23:08:42,760 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:42,760 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:42,760 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 34 transitions, 212 flow [2022-12-05 23:08:42,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 34 transitions, 212 flow [2022-12-05 23:08:42,769 INFO L130 PetriNetUnfolder]: 23/83 cut-off events. [2022-12-05 23:08:42,769 INFO L131 PetriNetUnfolder]: For 30/32 co-relation queries the response was YES. [2022-12-05 23:08:42,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 83 events. 23/83 cut-off events. For 30/32 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 311 event pairs, 1 based on Foata normal form. 2/79 useless extension candidates. Maximal degree in co-relation 201. Up to 28 conditions per place. [2022-12-05 23:08:42,770 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 34 transitions, 212 flow [2022-12-05 23:08:42,770 INFO L188 LiptonReduction]: Number of co-enabled transitions 146 [2022-12-05 23:08:42,772 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:08:42,773 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-05 23:08:42,773 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 34 transitions, 212 flow [2022-12-05 23:08:42,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-05 23:08:42,773 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:42,773 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:42,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:08:42,773 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:42,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:42,774 INFO L85 PathProgramCache]: Analyzing trace with hash 954248559, now seen corresponding path program 1 times [2022-12-05 23:08:42,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:42,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809414795] [2022-12-05 23:08:42,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:42,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:42,902 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-05 23:08:42,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:42,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809414795] [2022-12-05 23:08:42,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809414795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:42,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:42,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:08:42,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111113905] [2022-12-05 23:08:42,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:42,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:08:42,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:42,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:08:42,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:08:42,905 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-05 23:08:42,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 34 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-05 23:08:42,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:42,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-05 23:08:42,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:43,033 INFO L130 PetriNetUnfolder]: 101/210 cut-off events. [2022-12-05 23:08:43,033 INFO L131 PetriNetUnfolder]: For 113/113 co-relation queries the response was YES. [2022-12-05 23:08:43,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 210 events. 101/210 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 790 event pairs, 14 based on Foata normal form. 33/238 useless extension candidates. Maximal degree in co-relation 574. Up to 78 conditions per place. [2022-12-05 23:08:43,034 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 31 selfloop transitions, 3 changer transitions 26/61 dead transitions. [2022-12-05 23:08:43,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 61 transitions, 389 flow [2022-12-05 23:08:43,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:08:43,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:08:43,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-05 23:08:43,038 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.544 [2022-12-05 23:08:43,038 INFO L175 Difference]: Start difference. First operand has 33 places, 34 transitions, 212 flow. Second operand 5 states and 68 transitions. [2022-12-05 23:08:43,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 61 transitions, 389 flow [2022-12-05 23:08:43,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 61 transitions, 346 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-05 23:08:43,040 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 123 flow [2022-12-05 23:08:43,040 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2022-12-05 23:08:43,040 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 8 predicate places. [2022-12-05 23:08:43,040 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:43,041 INFO L89 Accepts]: Start accepts. Operand has 37 places, 25 transitions, 123 flow [2022-12-05 23:08:43,041 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:43,041 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:43,041 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 25 transitions, 123 flow [2022-12-05 23:08:43,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 25 transitions, 123 flow [2022-12-05 23:08:43,049 INFO L130 PetriNetUnfolder]: 12/60 cut-off events. [2022-12-05 23:08:43,049 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-12-05 23:08:43,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 60 events. 12/60 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 187 event pairs, 3 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 150. Up to 21 conditions per place. [2022-12-05 23:08:43,050 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 25 transitions, 123 flow [2022-12-05 23:08:43,050 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-05 23:08:43,118 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:08:43,119 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-05 23:08:43,119 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 123 flow [2022-12-05 23:08:43,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-05 23:08:43,119 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:43,119 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:43,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:08:43,119 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:43,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:43,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1702868104, now seen corresponding path program 1 times [2022-12-05 23:08:43,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:43,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899008168] [2022-12-05 23:08:43,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:43,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:43,268 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-05 23:08:43,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:43,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899008168] [2022-12-05 23:08:43,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899008168] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:43,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:43,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:08:43,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526045098] [2022-12-05 23:08:43,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:43,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:08:43,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:43,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:08:43,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:08:43,270 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-05 23:08:43,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-05 23:08:43,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:43,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-05 23:08:43,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:43,371 INFO L130 PetriNetUnfolder]: 41/103 cut-off events. [2022-12-05 23:08:43,371 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-12-05 23:08:43,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 103 events. 41/103 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 302 event pairs, 11 based on Foata normal form. 11/111 useless extension candidates. Maximal degree in co-relation 299. Up to 51 conditions per place. [2022-12-05 23:08:43,372 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 29 selfloop transitions, 5 changer transitions 11/46 dead transitions. [2022-12-05 23:08:43,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 46 transitions, 285 flow [2022-12-05 23:08:43,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:08:43,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:08:43,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2022-12-05 23:08:43,373 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2022-12-05 23:08:43,373 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 123 flow. Second operand 6 states and 52 transitions. [2022-12-05 23:08:43,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 46 transitions, 285 flow [2022-12-05 23:08:43,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 244 flow, removed 14 selfloop flow, removed 5 redundant places. [2022-12-05 23:08:43,374 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 118 flow [2022-12-05 23:08:43,375 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=118, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2022-12-05 23:08:43,375 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2022-12-05 23:08:43,375 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:43,375 INFO L89 Accepts]: Start accepts. Operand has 38 places, 25 transitions, 118 flow [2022-12-05 23:08:43,376 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:43,376 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:43,376 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 25 transitions, 118 flow [2022-12-05 23:08:43,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 25 transitions, 118 flow [2022-12-05 23:08:43,381 INFO L130 PetriNetUnfolder]: 5/38 cut-off events. [2022-12-05 23:08:43,381 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-05 23:08:43,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 38 events. 5/38 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 84 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 78. Up to 10 conditions per place. [2022-12-05 23:08:43,381 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 25 transitions, 118 flow [2022-12-05 23:08:43,381 INFO L188 LiptonReduction]: Number of co-enabled transitions 70 [2022-12-05 23:08:43,386 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [462] L768-->L818: Formula: (let ((.cse17 (not (= (mod |v_P1Thread1of1ForFork1_#t~nondet4#1_58| 256) 0)))) (let ((.cse28 (ite .cse17 1 0))) (let ((.cse30 (= (mod .cse28 256) 0))) (let ((.cse29 (not .cse30))) (let ((.cse22 (ite .cse17 1 (ite .cse30 1 (ite .cse29 0 1))))) (let ((.cse23 (= (mod .cse22 256) 0)) (.cse26 (ite .cse17 v_~y$w_buff0_used~0_759 (ite .cse30 v_~y$w_buff0_used~0_759 0)))) (let ((.cse27 (and .cse23 (= (mod .cse26 256) 0)))) (let ((.cse19 (ite .cse17 v_~y$r_buff0_thd2~0_366 (ite (or .cse27 .cse30 (and .cse23 (= (mod v_~y$r_buff0_thd2~0_366 256) 0))) v_~y$r_buff0_thd2~0_366 0)))) (let ((.cse20 (= (mod .cse19 256) 0))) (let ((.cse25 (not .cse23)) (.cse24 (and .cse23 .cse20))) (let ((.cse3 (not (= (mod v_~weak$$choice2~0_260 256) 0))) (.cse15 (or .cse27 .cse30 .cse24)) (.cse16 (and .cse29 .cse25))) (let ((.cse6 (ite .cse3 .cse28 (ite .cse15 .cse28 (ite .cse16 0 .cse28))))) (let ((.cse21 (= (mod .cse6 256) 0))) (let ((.cse5 (ite .cse3 .cse26 (ite (or .cse27 .cse24 .cse21) .cse26 0)))) (let ((.cse14 (= 0 (mod .cse5 256))) (.cse13 (not .cse21))) (let ((.cse7 (ite .cse3 .cse22 (ite (or (and .cse23 .cse14) .cse24 .cse21) .cse22 (ite (and .cse13 .cse25) 0 .cse22))))) (let ((.cse18 (= (mod .cse7 256) 0))) (let ((.cse11 (ite .cse3 .cse19 (ite (or (and .cse14 .cse18) (and .cse18 .cse20) .cse21) .cse19 0)))) (let ((.cse10 (not (= (mod v_~y$w_buff0_used~0_757 256) 0))) (.cse12 (not .cse18)) (.cse9 (not (= (mod .cse11 256) 0))) (.cse8 (ite .cse17 v_~y~0_686 v_~__unbuffered_p1_EAX~0_122))) (let ((.cse0 (ite .cse15 .cse8 (ite .cse16 v_~__unbuffered_p1_EAX~0_122 v_~y$w_buff0~0_480))) (.cse2 (and .cse9 (not .cse14))) (.cse1 (and .cse12 .cse13)) (.cse4 (and .cse10 .cse12))) (and (= v_~__unbuffered_p1_EBX~0_111 .cse0) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_51| 0)) (= v_~y~0_684 (ite .cse1 v_~y$w_buff0~0_479 (ite .cse2 v_~y$w_buff1~0_451 (ite .cse3 v_~y$mem_tmp~0_212 .cse0)))) (= v_~__unbuffered_p1_EAX~0_122 1) (= v_~y$flush_delayed~0_231 0) (= v_~__unbuffered_p1_EAX~0_122 v_~y$w_buff0~0_479) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_51| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_51|) (= (ite (or .cse2 .cse4) 0 .cse5) v_~y$w_buff1_used~0_707) (= (ite .cse1 0 .cse6) v_~y$w_buff0_used~0_757) (= v_~y$w_buff1~0_451 v_~y$w_buff0~0_480) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_51| (ite (= (mod v_~y$w_buff0_used~0_759 256) 0) 1 0)) (= v_~weak$$choice2~0_260 |v_P1Thread1of1ForFork1_#t~nondet6#1_54|) (= v_~weak$$choice0~0_179 |v_P1Thread1of1ForFork1_#t~nondet5#1_54|) (= (ite .cse4 0 .cse7) v_~y$r_buff0_thd2~0_364) (= .cse8 v_~y$mem_tmp~0_212) (= v_~y$r_buff0_thd0~0_360 v_~y$r_buff1_thd0~0_368) (= v_~y$r_buff0_thd1~0_231 v_~y$r_buff1_thd1~0_224) (= v_~y$r_buff1_thd2~0_297 (ite (or (and .cse9 (not (= (mod v_~y$w_buff1_used~0_707 256) 0))) (and .cse10 (not (= (mod v_~y$r_buff0_thd2~0_364 256) 0)))) 0 .cse11))))))))))))))))))))))) InVars {P1Thread1of1ForFork1_#t~nondet4#1=|v_P1Thread1of1ForFork1_#t~nondet4#1_58|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_759, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_54|, ~y$w_buff0~0=v_~y$w_buff0~0_480, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_360, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_366, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_231, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_54|, ~y~0=v_~y~0_686} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_111, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_757, P1Thread1of1ForFork1_#t~nondet3#1=|v_P1Thread1of1ForFork1_#t~nondet3#1_55|, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_51|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_297, ~weak$$choice0~0=v_~weak$$choice0~0_179, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_224, ~y$mem_tmp~0=v_~y$mem_tmp~0_212, ~y$w_buff1~0=v_~y$w_buff1~0_451, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_122, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_51|, ~y$w_buff0~0=v_~y$w_buff0~0_479, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_360, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_364, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_231, ~y$flush_delayed~0=v_~y$flush_delayed~0_231, ~y~0=v_~y~0_684, ~weak$$choice2~0=v_~weak$$choice2~0_260, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_368, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_707} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet5#1, P1Thread1of1ForFork1_#t~nondet3#1, P1Thread1of1ForFork1_#t~nondet6#1, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, P1Thread1of1ForFork1_#t~nondet4#1, ~y$mem_tmp~0, ~y$w_buff1~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [380] $Ultimate##0-->L741: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= v_~y~0_181 2)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~y~0=v_~y~0_181, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] Received shutdown request... [2022-12-05 23:23:13,683 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-05 23:23:13,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:23:13,683 WARN L619 AbstractCegarLoop]: Verification canceled: while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2022-12-05 23:23:13,684 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-05 23:23:13,684 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-05 23:23:13,685 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-05 23:23:13,685 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-05 23:23:13,685 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:13,688 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:23:13,688 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:23:13,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:23:13 BasicIcfg [2022-12-05 23:23:13,690 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:23:13,691 INFO L158 Benchmark]: Toolchain (without parser) took 881970.11ms. Allocated memory was 180.4MB in the beginning and 832.6MB in the end (delta: 652.2MB). Free memory was 154.7MB in the beginning and 743.5MB in the end (delta: -588.8MB). Peak memory consumption was 515.3MB. Max. memory is 8.0GB. [2022-12-05 23:23:13,691 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 127.9MB. Free memory is still 105.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:23:13,691 INFO L158 Benchmark]: CACSL2BoogieTranslator took 527.47ms. Allocated memory is still 180.4MB. Free memory was 154.2MB in the beginning and 126.5MB in the end (delta: 27.7MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-05 23:23:13,692 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.70ms. Allocated memory is still 180.4MB. Free memory was 126.5MB in the beginning and 122.9MB in the end (delta: 3.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 23:23:13,692 INFO L158 Benchmark]: Boogie Preprocessor took 34.53ms. Allocated memory is still 180.4MB. Free memory was 122.9MB in the beginning and 120.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:23:13,692 INFO L158 Benchmark]: RCFGBuilder took 649.98ms. Allocated memory is still 180.4MB. Free memory was 120.8MB in the beginning and 115.1MB in the end (delta: 5.6MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2022-12-05 23:23:13,693 INFO L158 Benchmark]: TraceAbstraction took 880692.71ms. Allocated memory was 180.4MB in the beginning and 832.6MB in the end (delta: 652.2MB). Free memory was 114.1MB in the beginning and 743.5MB in the end (delta: -629.5MB). Peak memory consumption was 473.6MB. Max. memory is 8.0GB. [2022-12-05 23:23:13,694 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.10ms. Allocated memory is still 127.9MB. Free memory is still 105.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 527.47ms. Allocated memory is still 180.4MB. Free memory was 154.2MB in the beginning and 126.5MB in the end (delta: 27.7MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.70ms. Allocated memory is still 180.4MB. Free memory was 126.5MB in the beginning and 122.9MB in the end (delta: 3.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.53ms. Allocated memory is still 180.4MB. Free memory was 122.9MB in the beginning and 120.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 649.98ms. Allocated memory is still 180.4MB. Free memory was 120.8MB in the beginning and 115.1MB in the end (delta: 5.6MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. * TraceAbstraction took 880692.71ms. Allocated memory was 180.4MB in the beginning and 832.6MB in the end (delta: 652.2MB). Free memory was 114.1MB in the beginning and 743.5MB in the end (delta: -629.5MB). Peak memory consumption was 473.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 95 PlacesBefore, 29 PlacesAfterwards, 90 TransitionsBefore, 23 TransitionsAfterwards, 1244 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 36 TrivialYvCompositions, 32 ConcurrentYvCompositions, 1 ChoiceCompositions, 70 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 938, independent: 878, independent conditional: 878, independent unconditional: 0, dependent: 60, dependent conditional: 60, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 938, independent: 878, independent conditional: 0, independent unconditional: 878, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 938, independent: 878, independent conditional: 0, independent unconditional: 878, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 938, independent: 878, independent conditional: 0, independent unconditional: 878, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 776, independent: 739, independent conditional: 0, independent unconditional: 739, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 776, independent: 715, independent conditional: 0, independent unconditional: 715, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 61, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 288, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 264, dependent conditional: 0, dependent unconditional: 264, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 938, independent: 139, independent conditional: 0, independent unconditional: 139, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 776, unknown conditional: 0, unknown unconditional: 776] , Statistics on independence cache: Total cache size (in pairs): 1097, Positive cache size: 1060, Positive conditional cache size: 0, Positive unconditional cache size: 1060, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, 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, 25 PlacesBefore, 25 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, independent: 22, independent conditional: 22, 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: 44, independent: 22, independent conditional: 2, independent unconditional: 20, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 44, independent: 22, independent conditional: 2, independent unconditional: 20, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 44, independent: 22, independent conditional: 2, independent unconditional: 20, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 40, independent: 21, independent conditional: 2, independent unconditional: 19, dependent: 19, dependent conditional: 2, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 40, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 19, dependent conditional: 2, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 113, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 112, dependent conditional: 9, dependent unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 44, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 40, unknown conditional: 4, unknown unconditional: 36] , Statistics on independence cache: Total cache size (in pairs): 40, Positive cache size: 21, Positive conditional cache size: 2, Positive unconditional cache size: 19, Negative cache size: 19, Negative conditional cache size: 2, Negative unconditional cache size: 17, 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.1s, 26 PlacesBefore, 26 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 34, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 98, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 20, unknown conditional: 0, unknown unconditional: 20] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 27, Positive conditional cache size: 2, Positive unconditional cache size: 25, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 27 PlacesBefore, 27 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 41, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 41, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 41, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 41, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 30, Positive conditional cache size: 2, Positive unconditional cache size: 28, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 33 PlacesBefore, 30 PlacesAfterwards, 30 TransitionsBefore, 27 TransitionsAfterwards, 150 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 307, independent: 245, independent conditional: 245, independent unconditional: 0, dependent: 62, dependent conditional: 62, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 307, independent: 245, independent conditional: 81, independent unconditional: 164, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 307, independent: 245, independent conditional: 55, independent unconditional: 190, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 307, independent: 245, independent conditional: 55, independent unconditional: 190, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 36, independent: 28, independent conditional: 7, independent unconditional: 21, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 36, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 74, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 307, independent: 217, independent conditional: 48, independent unconditional: 169, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 36, unknown conditional: 7, unknown unconditional: 29] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 70, Positive conditional cache size: 9, Positive unconditional cache size: 61, Negative cache size: 41, Negative conditional cache size: 2, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 152, independent: 121, independent conditional: 121, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 152, independent: 121, independent conditional: 49, independent unconditional: 72, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 152, independent: 121, independent conditional: 20, independent unconditional: 101, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 152, independent: 121, independent conditional: 20, independent unconditional: 101, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 152, independent: 120, independent conditional: 19, independent unconditional: 101, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 71, Positive conditional cache size: 10, Positive unconditional cache size: 61, Negative cache size: 41, Negative conditional cache size: 2, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 29, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 35 PlacesBefore, 35 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59, independent: 38, independent conditional: 38, 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: 59, independent: 38, independent conditional: 13, independent unconditional: 25, 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: 59, independent: 38, independent conditional: 8, independent unconditional: 30, 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: 59, independent: 38, independent conditional: 8, independent unconditional: 30, 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: 8, independent: 2, independent conditional: 1, independent unconditional: 1, 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: 8, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 66, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 59, independent: 36, independent conditional: 7, independent unconditional: 29, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 8, unknown conditional: 1, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 73, Positive conditional cache size: 11, Positive unconditional cache size: 62, Negative cache size: 47, Negative conditional cache size: 2, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 838]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 836]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 113 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: 880.6s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 112 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 112 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 422 IncrementalHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 1 mSDtfsCounter, 422 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=5, InterpolantAutomatonStates: 30, 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.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 422 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 could not prove your program: Timeout Completed graceful shutdown