/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/18_read_write_lock.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:16:21,181 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:16:21,182 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:16:21,204 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:16:21,204 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:16:21,205 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:16:21,206 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:16:21,207 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:16:21,208 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:16:21,212 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:16:21,212 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:16:21,214 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:16:21,215 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:16:21,216 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:16:21,217 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:16:21,218 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:16:21,219 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:16:21,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:16:21,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:16:21,221 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:16:21,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:16:21,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:16:21,224 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:16:21,225 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:16:21,227 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:16:21,227 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:16:21,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:16:21,228 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:16:21,228 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:16:21,229 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:16:21,229 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:16:21,229 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:16:21,230 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:16:21,230 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:16:21,231 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:16:21,231 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:16:21,232 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:16:21,232 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:16:21,232 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:16:21,232 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:16:21,233 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:16:21,233 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 09:16:21,253 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:16:21,253 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:16:21,255 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:16:21,255 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:16:21,255 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:16:21,256 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:16:21,256 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:16:21,256 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:16:21,256 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:16:21,256 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:16:21,257 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:16:21,257 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:16:21,257 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:16:21,257 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:16:21,257 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:16:21,257 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:16:21,258 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:16:21,258 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:16:21,258 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:16:21,258 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:16:21,258 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:16:21,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:16:21,258 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:16:21,258 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:16:21,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:16:21,258 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:16:21,259 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:16:21,259 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:16:21,259 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:16:21,259 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 09:16:21,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:16:21,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:16:21,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:16:21,567 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:16:21,568 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:16:21,569 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/18_read_write_lock.i [2022-12-13 09:16:22,482 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:16:22,679 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:16:22,679 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/18_read_write_lock.i [2022-12-13 09:16:22,743 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bcade93e/43c4b2f9d4724802bcff53d4cccf7eb7/FLAG7e6ccccf7 [2022-12-13 09:16:22,753 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bcade93e/43c4b2f9d4724802bcff53d4cccf7eb7 [2022-12-13 09:16:22,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:16:22,756 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:16:22,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:16:22,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:16:22,758 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:16:22,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:16:22" (1/1) ... [2022-12-13 09:16:22,759 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53d8781c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:22, skipping insertion in model container [2022-12-13 09:16:22,759 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:16:22" (1/1) ... [2022-12-13 09:16:22,764 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:16:22,799 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:16:22,907 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-13 09:16:22,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:16:22,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:16:22,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:16:22,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:16:22,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:16:22,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:16:22,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:16:22,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:16:22,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:16:22,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:16:22,997 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-ext/18_read_write_lock.i[31161,31174] [2022-12-13 09:16:23,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:16:23,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:16:23,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:16:23,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:16:23,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:16:23,009 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:16:23,018 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-13 09:16:23,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:16:23,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:16:23,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:16:23,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:16:23,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:16:23,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:16:23,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:16:23,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:16:23,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:16:23,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:16:23,033 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-ext/18_read_write_lock.i[31161,31174] [2022-12-13 09:16:23,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:16:23,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:16:23,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:16:23,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:16:23,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:16:23,060 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:16:23,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:23 WrapperNode [2022-12-13 09:16:23,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:16:23,062 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:16:23,062 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:16:23,062 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:16:23,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:23" (1/1) ... [2022-12-13 09:16:23,095 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:23" (1/1) ... [2022-12-13 09:16:23,115 INFO L138 Inliner]: procedures = 174, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 78 [2022-12-13 09:16:23,115 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:16:23,116 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:16:23,116 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:16:23,116 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:16:23,121 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:23" (1/1) ... [2022-12-13 09:16:23,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:23" (1/1) ... [2022-12-13 09:16:23,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:23" (1/1) ... [2022-12-13 09:16:23,128 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:23" (1/1) ... [2022-12-13 09:16:23,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:23" (1/1) ... [2022-12-13 09:16:23,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:23" (1/1) ... [2022-12-13 09:16:23,142 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:23" (1/1) ... [2022-12-13 09:16:23,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:23" (1/1) ... [2022-12-13 09:16:23,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:16:23,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:16:23,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:16:23,145 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:16:23,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:23" (1/1) ... [2022-12-13 09:16:23,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:16:23,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:16:23,170 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 09:16:23,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 09:16:23,197 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-12-13 09:16:23,198 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-12-13 09:16:23,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:16:23,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:16:23,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:16:23,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:16:23,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:16:23,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:16:23,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:16:23,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:16:23,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:16:23,200 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 09:16:23,324 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:16:23,325 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:16:23,477 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:16:23,547 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:16:23,547 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:16:23,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:16:23 BoogieIcfgContainer [2022-12-13 09:16:23,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:16:23,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:16:23,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:16:23,552 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:16:23,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:16:22" (1/3) ... [2022-12-13 09:16:23,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dad6fc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:16:23, skipping insertion in model container [2022-12-13 09:16:23,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:23" (2/3) ... [2022-12-13 09:16:23,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dad6fc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:16:23, skipping insertion in model container [2022-12-13 09:16:23,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:16:23" (3/3) ... [2022-12-13 09:16:23,554 INFO L112 eAbstractionObserver]: Analyzing ICFG 18_read_write_lock.i [2022-12-13 09:16:23,567 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:16:23,567 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 09:16:23,567 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:16:23,609 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:16:23,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 51 transitions, 107 flow [2022-12-13 09:16:23,669 INFO L130 PetriNetUnfolder]: 1/50 cut-off events. [2022-12-13 09:16:23,669 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:16:23,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 50 events. 1/50 cut-off events. For 0/0 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/48 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2022-12-13 09:16:23,673 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 51 transitions, 107 flow [2022-12-13 09:16:23,678 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 37 transitions, 77 flow [2022-12-13 09:16:23,679 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:16:23,701 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 37 transitions, 77 flow [2022-12-13 09:16:23,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 37 transitions, 77 flow [2022-12-13 09:16:23,724 INFO L130 PetriNetUnfolder]: 0/37 cut-off events. [2022-12-13 09:16:23,724 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:16:23,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 37 events. 0/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 11 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-13 09:16:23,726 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 37 transitions, 77 flow [2022-12-13 09:16:23,726 INFO L226 LiptonReduction]: Number of co-enabled transitions 156 [2022-12-13 09:16:25,227 INFO L241 LiptonReduction]: Total number of compositions: 31 [2022-12-13 09:16:25,238 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:16:25,242 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;@ae8c0b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:16:25,242 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-13 09:16:25,245 INFO L130 PetriNetUnfolder]: 0/10 cut-off events. [2022-12-13 09:16:25,245 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:16:25,245 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:16:25,245 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 09:16:25,245 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:16:25,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:16:25,249 INFO L85 PathProgramCache]: Analyzing trace with hash 225038601, now seen corresponding path program 1 times [2022-12-13 09:16:25,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:16:25,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050307145] [2022-12-13 09:16:25,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:16:25,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:16:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:16:25,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:16:25,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:16:25,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050307145] [2022-12-13 09:16:25,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050307145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:16:25,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:16:25,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:16:25,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495344465] [2022-12-13 09:16:25,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:16:25,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:16:25,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:16:25,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:16:25,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:16:25,420 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 11 [2022-12-13 09:16:25,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 15 places, 11 transitions, 25 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:16:25,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:16:25,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 11 [2022-12-13 09:16:25,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:16:25,471 INFO L130 PetriNetUnfolder]: 6/34 cut-off events. [2022-12-13 09:16:25,471 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:16:25,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 34 events. 6/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 108 event pairs, 5 based on Foata normal form. 6/28 useless extension candidates. Maximal degree in co-relation 63. Up to 27 conditions per place. [2022-12-13 09:16:25,473 INFO L137 encePairwiseOnDemand]: 5/11 looper letters, 4 selfloop transitions, 5 changer transitions 7/16 dead transitions. [2022-12-13 09:16:25,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 16 transitions, 65 flow [2022-12-13 09:16:25,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:16:25,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:16:25,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2022-12-13 09:16:25,481 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2022-12-13 09:16:25,482 INFO L175 Difference]: Start difference. First operand has 15 places, 11 transitions, 25 flow. Second operand 3 states and 19 transitions. [2022-12-13 09:16:25,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 16 transitions, 65 flow [2022-12-13 09:16:25,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 16 transitions, 64 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:16:25,486 INFO L231 Difference]: Finished difference. Result has 17 places, 9 transitions, 37 flow [2022-12-13 09:16:25,487 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=11, PETRI_DIFFERENCE_MINUEND_FLOW=24, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=11, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=37, PETRI_PLACES=17, PETRI_TRANSITIONS=9} [2022-12-13 09:16:25,491 INFO L295 CegarLoopForPetriNet]: 15 programPoint places, 2 predicate places. [2022-12-13 09:16:25,492 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:16:25,492 INFO L89 Accepts]: Start accepts. Operand has 17 places, 9 transitions, 37 flow [2022-12-13 09:16:25,494 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:16:25,495 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:16:25,497 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 17 places, 9 transitions, 37 flow [2022-12-13 09:16:25,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 15 places, 9 transitions, 37 flow [2022-12-13 09:16:25,500 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-13 09:16:25,500 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 09:16:25,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 12 events. 0/12 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 18 event pairs, 0 based on Foata normal form. 0/9 useless extension candidates. Maximal degree in co-relation 0. Up to 9 conditions per place. [2022-12-13 09:16:25,502 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 15 places, 9 transitions, 37 flow [2022-12-13 09:16:25,502 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 09:16:25,600 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [209] L750-3-->L734: Formula: (and (= |v_ULTIMATE.start_thr2_#in~arg#1.base_23| |v_ULTIMATE.start_thr2_~arg#1.base_23|) (= v_~x~0_73 |v_ULTIMATE.start_thr2_~l~0#1_30|) (= v_~y~0_28 |v_ULTIMATE.start_thr2_~ly~0#1_31|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_33| 0)) (= |v_ULTIMATE.start_thr2_#in~arg#1.base_23| 0) (= |v_ULTIMATE.start_thr2_~arg#1.offset_23| |v_ULTIMATE.start_thr2_#in~arg#1.offset_23|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_33| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|) (= v_~y~0_28 |v_ULTIMATE.start_thr2_~l~0#1_30|) (= v_~r~0_93 (+ v_~r~0_94 1)) (= |v_ULTIMATE.start_thr2_#in~arg#1.offset_23| 0) (= (ite (= v_~w~0_117 0) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|)) InVars {~w~0=v_~w~0_117, ~x~0=v_~x~0_73, ~r~0=v_~r~0_94} OutVars{ULTIMATE.start_thr2_~l~0#1=|v_ULTIMATE.start_thr2_~l~0#1_30|, ULTIMATE.start_thr2_~lr~0#1=|v_ULTIMATE.start_thr2_~lr~0#1_12|, ULTIMATE.start_thr2_~arg#1.offset=|v_ULTIMATE.start_thr2_~arg#1.offset_23|, ULTIMATE.start_thr2_#res#1.base=|v_ULTIMATE.start_thr2_#res#1.base_14|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_33|, ULTIMATE.start_thr2_#in~arg#1.base=|v_ULTIMATE.start_thr2_#in~arg#1.base_23|, ~w~0=v_~w~0_117, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_33|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_21|, ULTIMATE.start_thr2_~ly~0#1=|v_ULTIMATE.start_thr2_~ly~0#1_31|, ULTIMATE.start_thr2_#res#1.offset=|v_ULTIMATE.start_thr2_#res#1.offset_14|, ~y~0=v_~y~0_28, ~x~0=v_~x~0_73, ~r~0=v_~r~0_93, ULTIMATE.start_thr2_~arg#1.base=|v_ULTIMATE.start_thr2_~arg#1.base_23|, ULTIMATE.start_thr2_#in~arg#1.offset=|v_ULTIMATE.start_thr2_#in~arg#1.offset_23|, ULTIMATE.start_thr2_~lx~0#1=|v_ULTIMATE.start_thr2_~lx~0#1_23|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_thr2_~l~0#1, ULTIMATE.start_thr2_~lr~0#1, ULTIMATE.start_thr2_~arg#1.offset, ULTIMATE.start_thr2_#res#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_thr2_#in~arg#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_thr2_~ly~0#1, ULTIMATE.start_thr2_#res#1.offset, ~y~0, ~r~0, ULTIMATE.start_thr2_~arg#1.base, ULTIMATE.start_thr2_#in~arg#1.offset, ULTIMATE.start_thr2_~lx~0#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [202] $Ultimate##0-->thr1FINAL: Formula: (and (not (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_19| 0)) (= |v_thr1Thread1of1ForFork0_~arg#1.base_7| |v_thr1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_thr1Thread1of1ForFork0_~arg#1.offset_7| |v_thr1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~w~0_79 0) (= |v_thr1Thread1of1ForFork0_#res#1.base_15| 0) (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_19| |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|) (= (ite (= v_~r~0_67 0) 1 0) |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|) (= |v_thr1Thread1of1ForFork0_#res#1.offset_15| 0) (= v_~x~0_52 3) (not (= (ite (= v_~w~0_80 0) 1 0) 0))) InVars {~w~0=v_~w~0_80, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_7|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_7|, ~r~0=v_~r~0_67} OutVars{~w~0=v_~w~0_79, thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_7|, thr1Thread1of1ForFork0_#res#1.offset=|v_thr1Thread1of1ForFork0_#res#1.offset_15|, thr1Thread1of1ForFork0_~arg#1.offset=|v_thr1Thread1of1ForFork0_~arg#1.offset_7|, thr1Thread1of1ForFork0_~arg#1.base=|v_thr1Thread1of1ForFork0_~arg#1.base_7|, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_7|, thr1Thread1of1ForFork0_#res#1.base=|v_thr1Thread1of1ForFork0_#res#1.base_15|, ~x~0=v_~x~0_52, ~r~0=v_~r~0_67} AuxVars[] AssignedVars[~w~0, thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thr1Thread1of1ForFork0_#res#1.offset, thr1Thread1of1ForFork0_~arg#1.offset, thr1Thread1of1ForFork0_~arg#1.base, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread1of1ForFork0_#res#1.base, ~x~0] [2022-12-13 09:16:25,784 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [209] L750-3-->L734: Formula: (and (= |v_ULTIMATE.start_thr2_#in~arg#1.base_23| |v_ULTIMATE.start_thr2_~arg#1.base_23|) (= v_~x~0_73 |v_ULTIMATE.start_thr2_~l~0#1_30|) (= v_~y~0_28 |v_ULTIMATE.start_thr2_~ly~0#1_31|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_33| 0)) (= |v_ULTIMATE.start_thr2_#in~arg#1.base_23| 0) (= |v_ULTIMATE.start_thr2_~arg#1.offset_23| |v_ULTIMATE.start_thr2_#in~arg#1.offset_23|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_33| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|) (= v_~y~0_28 |v_ULTIMATE.start_thr2_~l~0#1_30|) (= v_~r~0_93 (+ v_~r~0_94 1)) (= |v_ULTIMATE.start_thr2_#in~arg#1.offset_23| 0) (= (ite (= v_~w~0_117 0) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|)) InVars {~w~0=v_~w~0_117, ~x~0=v_~x~0_73, ~r~0=v_~r~0_94} OutVars{ULTIMATE.start_thr2_~l~0#1=|v_ULTIMATE.start_thr2_~l~0#1_30|, ULTIMATE.start_thr2_~lr~0#1=|v_ULTIMATE.start_thr2_~lr~0#1_12|, ULTIMATE.start_thr2_~arg#1.offset=|v_ULTIMATE.start_thr2_~arg#1.offset_23|, ULTIMATE.start_thr2_#res#1.base=|v_ULTIMATE.start_thr2_#res#1.base_14|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_33|, ULTIMATE.start_thr2_#in~arg#1.base=|v_ULTIMATE.start_thr2_#in~arg#1.base_23|, ~w~0=v_~w~0_117, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_33|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_21|, ULTIMATE.start_thr2_~ly~0#1=|v_ULTIMATE.start_thr2_~ly~0#1_31|, ULTIMATE.start_thr2_#res#1.offset=|v_ULTIMATE.start_thr2_#res#1.offset_14|, ~y~0=v_~y~0_28, ~x~0=v_~x~0_73, ~r~0=v_~r~0_93, ULTIMATE.start_thr2_~arg#1.base=|v_ULTIMATE.start_thr2_~arg#1.base_23|, ULTIMATE.start_thr2_#in~arg#1.offset=|v_ULTIMATE.start_thr2_#in~arg#1.offset_23|, ULTIMATE.start_thr2_~lx~0#1=|v_ULTIMATE.start_thr2_~lx~0#1_23|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_thr2_~l~0#1, ULTIMATE.start_thr2_~lr~0#1, ULTIMATE.start_thr2_~arg#1.offset, ULTIMATE.start_thr2_#res#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_thr2_#in~arg#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_thr2_~ly~0#1, ULTIMATE.start_thr2_#res#1.offset, ~y~0, ~r~0, ULTIMATE.start_thr2_~arg#1.base, ULTIMATE.start_thr2_#in~arg#1.offset, ULTIMATE.start_thr2_~lx~0#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [203] $Ultimate##0-->thr1EXIT: Formula: (and (= |v_thr1Thread1of1ForFork0_~arg#1.base_9| |v_thr1Thread1of1ForFork0_#in~arg#1.base_9|) (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thr1Thread1of1ForFork0_#res#1.offset_17| 0) (= |v_thr1Thread1of1ForFork0_#res#1.base_17| 0) (= v_~x~0_54 3) (not (= (ite (= v_~w~0_84 0) 1 0) 0)) (= v_~w~0_83 0) (= |v_thr1Thread1of1ForFork0_~arg#1.offset_9| |v_thr1Thread1of1ForFork0_#in~arg#1.offset_9|) (not (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= (ite (= v_~r~0_69 0) 1 0) |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|)) InVars {~w~0=v_~w~0_84, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_9|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_9|, ~r~0=v_~r~0_69} OutVars{~w~0=v_~w~0_83, thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_9|, thr1Thread1of1ForFork0_#res#1.offset=|v_thr1Thread1of1ForFork0_#res#1.offset_17|, thr1Thread1of1ForFork0_~arg#1.offset=|v_thr1Thread1of1ForFork0_~arg#1.offset_9|, thr1Thread1of1ForFork0_~arg#1.base=|v_thr1Thread1of1ForFork0_~arg#1.base_9|, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_9|, thr1Thread1of1ForFork0_#res#1.base=|v_thr1Thread1of1ForFork0_#res#1.base_17|, ~x~0=v_~x~0_54, ~r~0=v_~r~0_69} AuxVars[] AssignedVars[~w~0, thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thr1Thread1of1ForFork0_#res#1.offset, thr1Thread1of1ForFork0_~arg#1.offset, thr1Thread1of1ForFork0_~arg#1.base, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread1of1ForFork0_#res#1.base, ~x~0] [2022-12-13 09:16:25,994 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [209] L750-3-->L734: Formula: (and (= |v_ULTIMATE.start_thr2_#in~arg#1.base_23| |v_ULTIMATE.start_thr2_~arg#1.base_23|) (= v_~x~0_73 |v_ULTIMATE.start_thr2_~l~0#1_30|) (= v_~y~0_28 |v_ULTIMATE.start_thr2_~ly~0#1_31|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_33| 0)) (= |v_ULTIMATE.start_thr2_#in~arg#1.base_23| 0) (= |v_ULTIMATE.start_thr2_~arg#1.offset_23| |v_ULTIMATE.start_thr2_#in~arg#1.offset_23|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_33| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|) (= v_~y~0_28 |v_ULTIMATE.start_thr2_~l~0#1_30|) (= v_~r~0_93 (+ v_~r~0_94 1)) (= |v_ULTIMATE.start_thr2_#in~arg#1.offset_23| 0) (= (ite (= v_~w~0_117 0) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|)) InVars {~w~0=v_~w~0_117, ~x~0=v_~x~0_73, ~r~0=v_~r~0_94} OutVars{ULTIMATE.start_thr2_~l~0#1=|v_ULTIMATE.start_thr2_~l~0#1_30|, ULTIMATE.start_thr2_~lr~0#1=|v_ULTIMATE.start_thr2_~lr~0#1_12|, ULTIMATE.start_thr2_~arg#1.offset=|v_ULTIMATE.start_thr2_~arg#1.offset_23|, ULTIMATE.start_thr2_#res#1.base=|v_ULTIMATE.start_thr2_#res#1.base_14|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_33|, ULTIMATE.start_thr2_#in~arg#1.base=|v_ULTIMATE.start_thr2_#in~arg#1.base_23|, ~w~0=v_~w~0_117, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_33|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_21|, ULTIMATE.start_thr2_~ly~0#1=|v_ULTIMATE.start_thr2_~ly~0#1_31|, ULTIMATE.start_thr2_#res#1.offset=|v_ULTIMATE.start_thr2_#res#1.offset_14|, ~y~0=v_~y~0_28, ~x~0=v_~x~0_73, ~r~0=v_~r~0_93, ULTIMATE.start_thr2_~arg#1.base=|v_ULTIMATE.start_thr2_~arg#1.base_23|, ULTIMATE.start_thr2_#in~arg#1.offset=|v_ULTIMATE.start_thr2_#in~arg#1.offset_23|, ULTIMATE.start_thr2_~lx~0#1=|v_ULTIMATE.start_thr2_~lx~0#1_23|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_thr2_~l~0#1, ULTIMATE.start_thr2_~lr~0#1, ULTIMATE.start_thr2_~arg#1.offset, ULTIMATE.start_thr2_#res#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_thr2_#in~arg#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_thr2_~ly~0#1, ULTIMATE.start_thr2_#res#1.offset, ~y~0, ~r~0, ULTIMATE.start_thr2_~arg#1.base, ULTIMATE.start_thr2_#in~arg#1.offset, ULTIMATE.start_thr2_~lx~0#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [204] $Ultimate##0-->L714: Formula: (and (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_23| |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23|) (= |v_thr1Thread1of1ForFork0_~arg#1.base_11| |v_thr1Thread1of1ForFork0_#in~arg#1.base_11|) (= v_~x~0_56 3) (not (= (ite (= v_~w~0_88 0) 1 0) 0)) (= (ite (= v_~r~0_71 0) 1 0) |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23|) (= v_~w~0_87 1) (= |v_thr1Thread1of1ForFork0_~arg#1.offset_11| |v_thr1Thread1of1ForFork0_#in~arg#1.offset_11|) (not (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_23| 0))) InVars {~w~0=v_~w~0_88, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_11|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_11|, ~r~0=v_~r~0_71} OutVars{~w~0=v_~w~0_87, thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_23|, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_11|, thr1Thread1of1ForFork0_~arg#1.offset=|v_thr1Thread1of1ForFork0_~arg#1.offset_11|, thr1Thread1of1ForFork0_~arg#1.base=|v_thr1Thread1of1ForFork0_~arg#1.base_11|, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_11|, ~x~0=v_~x~0_56, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[~w~0, thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thr1Thread1of1ForFork0_~arg#1.offset, thr1Thread1of1ForFork0_~arg#1.base, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~x~0] [2022-12-13 09:16:26,164 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [209] L750-3-->L734: Formula: (and (= |v_ULTIMATE.start_thr2_#in~arg#1.base_23| |v_ULTIMATE.start_thr2_~arg#1.base_23|) (= v_~x~0_73 |v_ULTIMATE.start_thr2_~l~0#1_30|) (= v_~y~0_28 |v_ULTIMATE.start_thr2_~ly~0#1_31|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_33| 0)) (= |v_ULTIMATE.start_thr2_#in~arg#1.base_23| 0) (= |v_ULTIMATE.start_thr2_~arg#1.offset_23| |v_ULTIMATE.start_thr2_#in~arg#1.offset_23|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_33| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|) (= v_~y~0_28 |v_ULTIMATE.start_thr2_~l~0#1_30|) (= v_~r~0_93 (+ v_~r~0_94 1)) (= |v_ULTIMATE.start_thr2_#in~arg#1.offset_23| 0) (= (ite (= v_~w~0_117 0) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|)) InVars {~w~0=v_~w~0_117, ~x~0=v_~x~0_73, ~r~0=v_~r~0_94} OutVars{ULTIMATE.start_thr2_~l~0#1=|v_ULTIMATE.start_thr2_~l~0#1_30|, ULTIMATE.start_thr2_~lr~0#1=|v_ULTIMATE.start_thr2_~lr~0#1_12|, ULTIMATE.start_thr2_~arg#1.offset=|v_ULTIMATE.start_thr2_~arg#1.offset_23|, ULTIMATE.start_thr2_#res#1.base=|v_ULTIMATE.start_thr2_#res#1.base_14|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_33|, ULTIMATE.start_thr2_#in~arg#1.base=|v_ULTIMATE.start_thr2_#in~arg#1.base_23|, ~w~0=v_~w~0_117, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_33|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_21|, ULTIMATE.start_thr2_~ly~0#1=|v_ULTIMATE.start_thr2_~ly~0#1_31|, ULTIMATE.start_thr2_#res#1.offset=|v_ULTIMATE.start_thr2_#res#1.offset_14|, ~y~0=v_~y~0_28, ~x~0=v_~x~0_73, ~r~0=v_~r~0_93, ULTIMATE.start_thr2_~arg#1.base=|v_ULTIMATE.start_thr2_~arg#1.base_23|, ULTIMATE.start_thr2_#in~arg#1.offset=|v_ULTIMATE.start_thr2_#in~arg#1.offset_23|, ULTIMATE.start_thr2_~lx~0#1=|v_ULTIMATE.start_thr2_~lx~0#1_23|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_thr2_~l~0#1, ULTIMATE.start_thr2_~lr~0#1, ULTIMATE.start_thr2_~arg#1.offset, ULTIMATE.start_thr2_#res#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_thr2_#in~arg#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_thr2_~ly~0#1, ULTIMATE.start_thr2_#res#1.offset, ~y~0, ~r~0, ULTIMATE.start_thr2_~arg#1.base, ULTIMATE.start_thr2_#in~arg#1.offset, ULTIMATE.start_thr2_~lx~0#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [205] $Ultimate##0-->L716: Formula: (and (= |v_thr1Thread1of1ForFork0_~arg#1.offset_13| |v_thr1Thread1of1ForFork0_#in~arg#1.offset_13|) (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (not (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0)) (= v_~w~0_91 0) (= |v_thr1Thread1of1ForFork0_~arg#1.base_13| |v_thr1Thread1of1ForFork0_#in~arg#1.base_13|) (not (= (ite (= v_~w~0_92 0) 1 0) 0)) (= v_~x~0_58 3) (= (ite (= v_~r~0_73 0) 1 0) |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|)) InVars {~w~0=v_~w~0_92, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_13|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_13|, ~r~0=v_~r~0_73} OutVars{~w~0=v_~w~0_91, thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_13|, thr1Thread1of1ForFork0_~arg#1.offset=|v_thr1Thread1of1ForFork0_~arg#1.offset_13|, thr1Thread1of1ForFork0_~arg#1.base=|v_thr1Thread1of1ForFork0_~arg#1.base_13|, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_13|, ~x~0=v_~x~0_58, ~r~0=v_~r~0_73} AuxVars[] AssignedVars[~w~0, thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thr1Thread1of1ForFork0_~arg#1.offset, thr1Thread1of1ForFork0_~arg#1.base, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~x~0] [2022-12-13 09:16:26,348 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [210] L750-3-->thr1FINAL: Formula: (and (= |v_thr1Thread1of1ForFork0_~arg#1.base_23| |v_thr1Thread1of1ForFork0_#in~arg#1.base_23|) (not (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_35| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_35| 0)) (= v_~r~0_97 (+ v_~r~0_98 1)) (= v_~y~0_30 |v_ULTIMATE.start_thr2_~l~0#1_34|) (= |v_ULTIMATE.start_thr2_#in~arg#1.offset_25| 0) (= v_~x~0_75 3) (= (ite (= v_~w~0_120 0) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27|) (= |v_ULTIMATE.start_thr2_#in~arg#1.base_25| 0) (= v_~y~0_30 |v_ULTIMATE.start_thr2_~ly~0#1_35|) (= v_~x~0_76 |v_ULTIMATE.start_thr2_~l~0#1_34|) (= |v_thr1Thread1of1ForFork0_#res#1.offset_25| 0) (= v_~w~0_119 0) (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|) (= |v_ULTIMATE.start_thr2_#in~arg#1.base_25| |v_ULTIMATE.start_thr2_~arg#1.base_25|) (= |v_thr1Thread1of1ForFork0_#res#1.base_25| 0) (= |v_ULTIMATE.start_thr2_~arg#1.offset_25| |v_ULTIMATE.start_thr2_#in~arg#1.offset_25|) (= |v_thr1Thread1of1ForFork0_~arg#1.offset_23| |v_thr1Thread1of1ForFork0_#in~arg#1.offset_23|) (= (ite (= v_~r~0_97 0) 1 0) |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|)) InVars {~w~0=v_~w~0_120, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_23|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_23|, ~x~0=v_~x~0_76, ~r~0=v_~r~0_98} OutVars{thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35|, thr1Thread1of1ForFork0_~arg#1.offset=|v_thr1Thread1of1ForFork0_~arg#1.offset_23|, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_35|, ~w~0=v_~w~0_119, thr1Thread1of1ForFork0_#res#1.offset=|v_thr1Thread1of1ForFork0_#res#1.offset_25|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_35|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_23|, ULTIMATE.start_thr2_#res#1.offset=|v_ULTIMATE.start_thr2_#res#1.offset_16|, ~y~0=v_~y~0_30, ULTIMATE.start_thr2_~arg#1.base=|v_ULTIMATE.start_thr2_~arg#1.base_25|, ULTIMATE.start_thr2_~lx~0#1=|v_ULTIMATE.start_thr2_~lx~0#1_25|, ULTIMATE.start_thr2_~l~0#1=|v_ULTIMATE.start_thr2_~l~0#1_34|, ULTIMATE.start_thr2_~lr~0#1=|v_ULTIMATE.start_thr2_~lr~0#1_14|, ULTIMATE.start_thr2_~arg#1.offset=|v_ULTIMATE.start_thr2_~arg#1.offset_25|, ULTIMATE.start_thr2_#res#1.base=|v_ULTIMATE.start_thr2_#res#1.base_16|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_23|, thr1Thread1of1ForFork0_#res#1.base=|v_thr1Thread1of1ForFork0_#res#1.base_25|, ULTIMATE.start_thr2_#in~arg#1.base=|v_ULTIMATE.start_thr2_#in~arg#1.base_25|, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_23|, thr1Thread1of1ForFork0_~arg#1.base=|v_thr1Thread1of1ForFork0_~arg#1.base_23|, ULTIMATE.start_thr2_~ly~0#1=|v_ULTIMATE.start_thr2_~ly~0#1_35|, ~x~0=v_~x~0_75, ~r~0=v_~r~0_97, ULTIMATE.start_thr2_#in~arg#1.offset=|v_ULTIMATE.start_thr2_#in~arg#1.offset_25|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_thr2_~l~0#1, ULTIMATE.start_thr2_~lr~0#1, thr1Thread1of1ForFork0_~arg#1.offset, ULTIMATE.start_thr2_~arg#1.offset, ULTIMATE.start_thr2_#res#1.base, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread1of1ForFork0_#res#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_thr2_#in~arg#1.base, ~w~0, thr1Thread1of1ForFork0_#res#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, thr1Thread1of1ForFork0_~arg#1.base, ULTIMATE.start_thr2_~ly~0#1, ULTIMATE.start_thr2_#res#1.offset, ~y~0, ~x~0, ULTIMATE.start_thr2_~arg#1.base, ULTIMATE.start_thr2_~lx~0#1, ~r~0, ULTIMATE.start_thr2_#in~arg#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [177] L734-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_ULTIMATE.start_thr2_~lx~0#1_9| |v_ULTIMATE.start_thr2_~ly~0#1_7|)) (= v_~x~0_13 |v_ULTIMATE.start_thr2_~lx~0#1_9|)) InVars {ULTIMATE.start_thr2_~ly~0#1=|v_ULTIMATE.start_thr2_~ly~0#1_7|, ~x~0=v_~x~0_13} OutVars{ULTIMATE.start_thr2_~ly~0#1=|v_ULTIMATE.start_thr2_~ly~0#1_7|, ~x~0=v_~x~0_13, ULTIMATE.start_thr2_~lx~0#1=|v_ULTIMATE.start_thr2_~lx~0#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_thr2_~lx~0#1] [2022-12-13 09:16:26,501 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [211] L750-3-->thr1EXIT: Formula: (and (= |v_thr1Thread1of1ForFork0_#res#1.offset_27| 0) (= (ite (= v_~r~0_101 0) 1 0) |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|) (not (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (= v_~y~0_32 |v_ULTIMATE.start_thr2_~ly~0#1_37|) (= v_~x~0_79 3) (= v_~x~0_80 |v_ULTIMATE.start_thr2_~l~0#1_36|) (= |v_thr1Thread1of1ForFork0_#res#1.base_27| 0) (= |v_ULTIMATE.start_thr2_#in~arg#1.offset_27| 0) (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|) (= v_~y~0_32 |v_ULTIMATE.start_thr2_~l~0#1_36|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29| (ite (= v_~w~0_124 0) 1 0)) (= |v_thr1Thread1of1ForFork0_~arg#1.offset_25| |v_thr1Thread1of1ForFork0_#in~arg#1.offset_25|) (= |v_thr1Thread1of1ForFork0_~arg#1.base_25| |v_thr1Thread1of1ForFork0_#in~arg#1.base_25|) (= |v_ULTIMATE.start_thr2_~arg#1.offset_27| |v_ULTIMATE.start_thr2_#in~arg#1.offset_27|) (= |v_ULTIMATE.start_thr2_#in~arg#1.base_27| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_37| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_37| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|) (= v_~r~0_101 (+ v_~r~0_102 1)) (= v_~w~0_123 0) (= |v_ULTIMATE.start_thr2_#in~arg#1.base_27| |v_ULTIMATE.start_thr2_~arg#1.base_27|)) InVars {~w~0=v_~w~0_124, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_25|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_25|, ~x~0=v_~x~0_80, ~r~0=v_~r~0_102} OutVars{thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, thr1Thread1of1ForFork0_~arg#1.offset=|v_thr1Thread1of1ForFork0_~arg#1.offset_25|, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_37|, ~w~0=v_~w~0_123, thr1Thread1of1ForFork0_#res#1.offset=|v_thr1Thread1of1ForFork0_#res#1.offset_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_37|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_25|, ULTIMATE.start_thr2_#res#1.offset=|v_ULTIMATE.start_thr2_#res#1.offset_18|, ~y~0=v_~y~0_32, ULTIMATE.start_thr2_~arg#1.base=|v_ULTIMATE.start_thr2_~arg#1.base_27|, ULTIMATE.start_thr2_~lx~0#1=|v_ULTIMATE.start_thr2_~lx~0#1_27|, ULTIMATE.start_thr2_~l~0#1=|v_ULTIMATE.start_thr2_~l~0#1_36|, ULTIMATE.start_thr2_~lr~0#1=|v_ULTIMATE.start_thr2_~lr~0#1_16|, ULTIMATE.start_thr2_~arg#1.offset=|v_ULTIMATE.start_thr2_~arg#1.offset_27|, ULTIMATE.start_thr2_#res#1.base=|v_ULTIMATE.start_thr2_#res#1.base_18|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_25|, thr1Thread1of1ForFork0_#res#1.base=|v_thr1Thread1of1ForFork0_#res#1.base_27|, ULTIMATE.start_thr2_#in~arg#1.base=|v_ULTIMATE.start_thr2_#in~arg#1.base_27|, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_25|, thr1Thread1of1ForFork0_~arg#1.base=|v_thr1Thread1of1ForFork0_~arg#1.base_25|, ULTIMATE.start_thr2_~ly~0#1=|v_ULTIMATE.start_thr2_~ly~0#1_37|, ~x~0=v_~x~0_79, ~r~0=v_~r~0_101, ULTIMATE.start_thr2_#in~arg#1.offset=|v_ULTIMATE.start_thr2_#in~arg#1.offset_27|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_thr2_~l~0#1, ULTIMATE.start_thr2_~lr~0#1, thr1Thread1of1ForFork0_~arg#1.offset, ULTIMATE.start_thr2_~arg#1.offset, ULTIMATE.start_thr2_#res#1.base, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread1of1ForFork0_#res#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_thr2_#in~arg#1.base, ~w~0, thr1Thread1of1ForFork0_#res#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, thr1Thread1of1ForFork0_~arg#1.base, ULTIMATE.start_thr2_~ly~0#1, ULTIMATE.start_thr2_#res#1.offset, ~y~0, ~x~0, ULTIMATE.start_thr2_~arg#1.base, ULTIMATE.start_thr2_~lx~0#1, ~r~0, ULTIMATE.start_thr2_#in~arg#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [177] L734-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_ULTIMATE.start_thr2_~lx~0#1_9| |v_ULTIMATE.start_thr2_~ly~0#1_7|)) (= v_~x~0_13 |v_ULTIMATE.start_thr2_~lx~0#1_9|)) InVars {ULTIMATE.start_thr2_~ly~0#1=|v_ULTIMATE.start_thr2_~ly~0#1_7|, ~x~0=v_~x~0_13} OutVars{ULTIMATE.start_thr2_~ly~0#1=|v_ULTIMATE.start_thr2_~ly~0#1_7|, ~x~0=v_~x~0_13, ULTIMATE.start_thr2_~lx~0#1=|v_ULTIMATE.start_thr2_~lx~0#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_thr2_~lx~0#1] [2022-12-13 09:16:26,662 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [212] L750-3-->L714: Formula: (and (= |v_ULTIMATE.start_thr2_#in~arg#1.base_29| 0) (= v_~x~0_83 3) (= v_~y~0_34 |v_ULTIMATE.start_thr2_~ly~0#1_39|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_39| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|) (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_39| (ite (= v_~r~0_105 0) 1 0)) (= v_~x~0_84 |v_ULTIMATE.start_thr2_~l~0#1_38|) (= |v_thr1Thread1of1ForFork0_~arg#1.base_27| |v_thr1Thread1of1ForFork0_#in~arg#1.base_27|) (not (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_39| 0)) (= |v_thr1Thread1of1ForFork0_~arg#1.offset_27| |v_thr1Thread1of1ForFork0_#in~arg#1.offset_27|) (= (+ v_~r~0_106 1) v_~r~0_105) (= v_~w~0_127 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_39| 0)) (= |v_ULTIMATE.start_thr2_~arg#1.offset_29| |v_ULTIMATE.start_thr2_#in~arg#1.offset_29|) (= |v_ULTIMATE.start_thr2_#in~arg#1.offset_29| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31| (ite (= v_~w~0_128 0) 1 0)) (= v_~y~0_34 |v_ULTIMATE.start_thr2_~l~0#1_38|) (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_39| |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_39|) (= |v_ULTIMATE.start_thr2_#in~arg#1.base_29| |v_ULTIMATE.start_thr2_~arg#1.base_29|)) InVars {~w~0=v_~w~0_128, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_27|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_27|, ~x~0=v_~x~0_84, ~r~0=v_~r~0_106} OutVars{thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_39|, ULTIMATE.start_thr2_~l~0#1=|v_ULTIMATE.start_thr2_~l~0#1_38|, ULTIMATE.start_thr2_~lr~0#1=|v_ULTIMATE.start_thr2_~lr~0#1_18|, thr1Thread1of1ForFork0_~arg#1.offset=|v_thr1Thread1of1ForFork0_~arg#1.offset_27|, ULTIMATE.start_thr2_~arg#1.offset=|v_ULTIMATE.start_thr2_~arg#1.offset_29|, ULTIMATE.start_thr2_#res#1.base=|v_ULTIMATE.start_thr2_#res#1.base_20|, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_39|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_27|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_39|, ULTIMATE.start_thr2_#in~arg#1.base=|v_ULTIMATE.start_thr2_#in~arg#1.base_29|, ~w~0=v_~w~0_127, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_39|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_27|, thr1Thread1of1ForFork0_~arg#1.base=|v_thr1Thread1of1ForFork0_~arg#1.base_27|, ULTIMATE.start_thr2_~ly~0#1=|v_ULTIMATE.start_thr2_~ly~0#1_39|, ULTIMATE.start_thr2_#res#1.offset=|v_ULTIMATE.start_thr2_#res#1.offset_20|, ~y~0=v_~y~0_34, ~x~0=v_~x~0_83, ~r~0=v_~r~0_105, ULTIMATE.start_thr2_~arg#1.base=|v_ULTIMATE.start_thr2_~arg#1.base_29|, ULTIMATE.start_thr2_#in~arg#1.offset=|v_ULTIMATE.start_thr2_#in~arg#1.offset_29|, ULTIMATE.start_thr2_~lx~0#1=|v_ULTIMATE.start_thr2_~lx~0#1_29|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_thr2_~l~0#1, ULTIMATE.start_thr2_~lr~0#1, thr1Thread1of1ForFork0_~arg#1.offset, ULTIMATE.start_thr2_~arg#1.offset, ULTIMATE.start_thr2_#res#1.base, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_thr2_#in~arg#1.base, ~w~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, thr1Thread1of1ForFork0_~arg#1.base, ULTIMATE.start_thr2_~ly~0#1, ULTIMATE.start_thr2_#res#1.offset, ~y~0, ~x~0, ~r~0, ULTIMATE.start_thr2_~arg#1.base, ULTIMATE.start_thr2_#in~arg#1.offset, ULTIMATE.start_thr2_~lx~0#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [177] L734-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_ULTIMATE.start_thr2_~lx~0#1_9| |v_ULTIMATE.start_thr2_~ly~0#1_7|)) (= v_~x~0_13 |v_ULTIMATE.start_thr2_~lx~0#1_9|)) InVars {ULTIMATE.start_thr2_~ly~0#1=|v_ULTIMATE.start_thr2_~ly~0#1_7|, ~x~0=v_~x~0_13} OutVars{ULTIMATE.start_thr2_~ly~0#1=|v_ULTIMATE.start_thr2_~ly~0#1_7|, ~x~0=v_~x~0_13, ULTIMATE.start_thr2_~lx~0#1=|v_ULTIMATE.start_thr2_~lx~0#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_thr2_~lx~0#1] [2022-12-13 09:16:26,805 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [213] L750-3-->L716: Formula: (let ((.cse0 (ite (= v_~w~0_132 0) 1 0))) (and (= (+ v_~r~0_110 1) v_~r~0_109) (= |v_thr1Thread1of1ForFork0_~arg#1.base_29| |v_thr1Thread1of1ForFork0_#in~arg#1.base_29|) (= v_~x~0_88 |v_ULTIMATE.start_thr2_~l~0#1_40|) (= .cse0 |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_33|) (not (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_41| 0)) (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41| (ite (= v_~r~0_109 0) 1 0)) (= |v_ULTIMATE.start_thr2_~arg#1.offset_31| |v_ULTIMATE.start_thr2_#in~arg#1.offset_31|) (= |v_thr1Thread1of1ForFork0_~arg#1.offset_29| |v_thr1Thread1of1ForFork0_#in~arg#1.offset_29|) (= v_~y~0_36 |v_ULTIMATE.start_thr2_~ly~0#1_41|) (= v_~w~0_131 0) (= |v_ULTIMATE.start_thr2_#in~arg#1.base_31| |v_ULTIMATE.start_thr2_~arg#1.base_31|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_41| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_33|) (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_41| |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (not (= .cse0 0)) (= |v_ULTIMATE.start_thr2_#in~arg#1.offset_31| 0) (= v_~x~0_87 3) (= |v_ULTIMATE.start_thr2_#in~arg#1.base_31| 0) (= v_~y~0_36 |v_ULTIMATE.start_thr2_~l~0#1_40|))) InVars {~w~0=v_~w~0_132, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_29|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_29|, ~x~0=v_~x~0_88, ~r~0=v_~r~0_110} OutVars{thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_41|, ULTIMATE.start_thr2_~l~0#1=|v_ULTIMATE.start_thr2_~l~0#1_40|, ULTIMATE.start_thr2_~lr~0#1=|v_ULTIMATE.start_thr2_~lr~0#1_20|, thr1Thread1of1ForFork0_~arg#1.offset=|v_thr1Thread1of1ForFork0_~arg#1.offset_29|, ULTIMATE.start_thr2_~arg#1.offset=|v_ULTIMATE.start_thr2_~arg#1.offset_31|, ULTIMATE.start_thr2_#res#1.base=|v_ULTIMATE.start_thr2_#res#1.base_22|, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_29|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_41|, ULTIMATE.start_thr2_#in~arg#1.base=|v_ULTIMATE.start_thr2_#in~arg#1.base_31|, ~w~0=v_~w~0_131, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_29|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_41|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_29|, thr1Thread1of1ForFork0_~arg#1.base=|v_thr1Thread1of1ForFork0_~arg#1.base_29|, ULTIMATE.start_thr2_~ly~0#1=|v_ULTIMATE.start_thr2_~ly~0#1_41|, ULTIMATE.start_thr2_#res#1.offset=|v_ULTIMATE.start_thr2_#res#1.offset_22|, ~y~0=v_~y~0_36, ~x~0=v_~x~0_87, ~r~0=v_~r~0_109, ULTIMATE.start_thr2_~arg#1.base=|v_ULTIMATE.start_thr2_~arg#1.base_31|, ULTIMATE.start_thr2_#in~arg#1.offset=|v_ULTIMATE.start_thr2_#in~arg#1.offset_31|, ULTIMATE.start_thr2_~lx~0#1=|v_ULTIMATE.start_thr2_~lx~0#1_31|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_33|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_thr2_~l~0#1, ULTIMATE.start_thr2_~lr~0#1, thr1Thread1of1ForFork0_~arg#1.offset, ULTIMATE.start_thr2_~arg#1.offset, ULTIMATE.start_thr2_#res#1.base, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_thr2_#in~arg#1.base, ~w~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, thr1Thread1of1ForFork0_~arg#1.base, ULTIMATE.start_thr2_~ly~0#1, ULTIMATE.start_thr2_#res#1.offset, ~y~0, ~x~0, ~r~0, ULTIMATE.start_thr2_~arg#1.base, ULTIMATE.start_thr2_#in~arg#1.offset, ULTIMATE.start_thr2_~lx~0#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [177] L734-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_ULTIMATE.start_thr2_~lx~0#1_9| |v_ULTIMATE.start_thr2_~ly~0#1_7|)) (= v_~x~0_13 |v_ULTIMATE.start_thr2_~lx~0#1_9|)) InVars {ULTIMATE.start_thr2_~ly~0#1=|v_ULTIMATE.start_thr2_~ly~0#1_7|, ~x~0=v_~x~0_13} OutVars{ULTIMATE.start_thr2_~ly~0#1=|v_ULTIMATE.start_thr2_~ly~0#1_7|, ~x~0=v_~x~0_13, ULTIMATE.start_thr2_~lx~0#1=|v_ULTIMATE.start_thr2_~lx~0#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_thr2_~lx~0#1] [2022-12-13 09:16:26,942 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:16:26,944 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1452 [2022-12-13 09:16:26,944 INFO L495 AbstractCegarLoop]: Abstraction has has 14 places, 8 transitions, 47 flow [2022-12-13 09:16:26,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:16:26,944 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:16:26,944 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 09:16:26,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:16:26,944 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:16:26,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:16:26,945 INFO L85 PathProgramCache]: Analyzing trace with hash 234171, now seen corresponding path program 1 times [2022-12-13 09:16:26,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:16:26,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676914767] [2022-12-13 09:16:26,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:16:26,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:16:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:16:27,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:16:27,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:16:27,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676914767] [2022-12-13 09:16:27,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676914767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:16:27,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:16:27,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:16:27,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695403859] [2022-12-13 09:16:27,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:16:27,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:16:27,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:16:27,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:16:27,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:16:27,060 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 8 [2022-12-13 09:16:27,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 14 places, 8 transitions, 47 flow. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:16:27,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:16:27,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 8 [2022-12-13 09:16:27,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:16:27,072 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 09:16:27,072 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 09:16:27,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13 conditions, 3 events. 0/3 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 1/4 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 09:16:27,072 INFO L137 encePairwiseOnDemand]: 2/8 looper letters, 0 selfloop transitions, 0 changer transitions 3/3 dead transitions. [2022-12-13 09:16:27,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 11 places, 3 transitions, 17 flow [2022-12-13 09:16:27,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:16:27,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:16:27,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2022-12-13 09:16:27,073 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2916666666666667 [2022-12-13 09:16:27,073 INFO L175 Difference]: Start difference. First operand has 14 places, 8 transitions, 47 flow. Second operand 3 states and 7 transitions. [2022-12-13 09:16:27,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 11 places, 3 transitions, 17 flow [2022-12-13 09:16:27,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 9 places, 3 transitions, 15 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:16:27,073 INFO L231 Difference]: Finished difference. Result has 9 places, 0 transitions, 0 flow [2022-12-13 09:16:27,074 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=8, PETRI_DIFFERENCE_MINUEND_FLOW=9, PETRI_DIFFERENCE_MINUEND_PLACES=7, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=9, PETRI_TRANSITIONS=0} [2022-12-13 09:16:27,074 INFO L295 CegarLoopForPetriNet]: 15 programPoint places, -6 predicate places. [2022-12-13 09:16:27,074 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:16:27,074 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 9 places, 0 transitions, 0 flow [2022-12-13 09:16:27,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 09:16:27,075 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 09:16:27,075 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:16:27,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-13 09:16:27,075 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 09:16:27,075 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 09:16:27,075 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:16:27,076 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 09:16:27,076 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 09:16:27,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:16:27,078 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-12-13 09:16:27,079 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2022-12-13 09:16:27,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:16:27,079 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2022-12-13 09:16:27,081 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:16:27,081 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:16:27,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:16:27 BasicIcfg [2022-12-13 09:16:27,084 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:16:27,084 INFO L158 Benchmark]: Toolchain (without parser) took 4328.46ms. Allocated memory was 181.4MB in the beginning and 220.2MB in the end (delta: 38.8MB). Free memory was 160.4MB in the beginning and 144.2MB in the end (delta: 16.3MB). Peak memory consumption was 56.1MB. Max. memory is 8.0GB. [2022-12-13 09:16:27,084 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 127.9MB. Free memory was 110.0MB in the beginning and 109.9MB in the end (delta: 89.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:16:27,085 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.67ms. Allocated memory is still 181.4MB. Free memory was 160.4MB in the beginning and 139.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-13 09:16:27,085 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.68ms. Allocated memory is still 181.4MB. Free memory was 139.0MB in the beginning and 137.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:16:27,085 INFO L158 Benchmark]: Boogie Preprocessor took 28.00ms. Allocated memory is still 181.4MB. Free memory was 137.4MB in the beginning and 135.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 09:16:27,086 INFO L158 Benchmark]: RCFGBuilder took 404.34ms. Allocated memory is still 181.4MB. Free memory was 135.8MB in the beginning and 157.5MB in the end (delta: -21.6MB). Peak memory consumption was 17.1MB. Max. memory is 8.0GB. [2022-12-13 09:16:27,086 INFO L158 Benchmark]: TraceAbstraction took 3533.31ms. Allocated memory was 181.4MB in the beginning and 220.2MB in the end (delta: 38.8MB). Free memory was 156.4MB in the beginning and 144.2MB in the end (delta: 12.2MB). Peak memory consumption was 51.6MB. Max. memory is 8.0GB. [2022-12-13 09:16:27,088 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 was 110.0MB in the beginning and 109.9MB in the end (delta: 89.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 304.67ms. Allocated memory is still 181.4MB. Free memory was 160.4MB in the beginning and 139.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.68ms. Allocated memory is still 181.4MB. Free memory was 139.0MB in the beginning and 137.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.00ms. Allocated memory is still 181.4MB. Free memory was 137.4MB in the beginning and 135.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 404.34ms. Allocated memory is still 181.4MB. Free memory was 135.8MB in the beginning and 157.5MB in the end (delta: -21.6MB). Peak memory consumption was 17.1MB. Max. memory is 8.0GB. * TraceAbstraction took 3533.31ms. Allocated memory was 181.4MB in the beginning and 220.2MB in the end (delta: 38.8MB). Free memory was 156.4MB in the beginning and 144.2MB in the end (delta: 12.2MB). Peak memory consumption was 51.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 41 PlacesBefore, 15 PlacesAfterwards, 37 TransitionsBefore, 11 TransitionsAfterwards, 156 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 16 TrivialYvCompositions, 15 ConcurrentYvCompositions, 0 ChoiceCompositions, 31 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 160, independent: 146, independent conditional: 146, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 123, independent: 110, independent conditional: 0, independent unconditional: 110, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 123, independent: 110, independent conditional: 0, independent unconditional: 110, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 123, independent: 107, independent conditional: 0, independent unconditional: 107, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 160, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 123, unknown conditional: 123, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 123, Positive cache size: 110, Positive conditional cache size: 110, Positive unconditional cache size: 0, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 15 PlacesBefore, 14 PlacesAfterwards, 9 TransitionsBefore, 8 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - PositiveResult [Line: 738]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 59 locations, 2 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: 3.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 0 mSDtfsCounter, 32 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=1, InterpolantAutomatonStates: 6, 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.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 8 NumberOfCodeBlocks, 8 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 12 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 09:16:27,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...