/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:23:40,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:23:40,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:23:40,232 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:23:40,233 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:23:40,235 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:23:40,240 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:23:40,244 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:23:40,248 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:23:40,253 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:23:40,254 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:23:40,254 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:23:40,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:23:40,255 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:23:40,256 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:23:40,257 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:23:40,257 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:23:40,258 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:23:40,259 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:23:40,260 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:23:40,261 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:23:40,267 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:23:40,268 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:23:40,270 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:23:40,279 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:23:40,279 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:23:40,279 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:23:40,281 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:23:40,281 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:23:40,282 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:23:40,283 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:23:40,284 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:23:40,285 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:23:40,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:23:40,287 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:23:40,287 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:23:40,287 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:23:40,287 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:23:40,288 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:23:40,288 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:23:40,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:23:40,290 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 23:23:40,328 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:23:40,328 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:23:40,330 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:23:40,330 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:23:40,330 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:23:40,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:23:40,343 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:23:40,343 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:23:40,343 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:23:40,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:23:40,344 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:23:40,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:23:40,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:23:40,344 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:23:40,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:23:40,345 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:23:40,345 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:23:40,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:23:40,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:23:40,345 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:23:40,345 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:23:40,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:23:40,346 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:23:40,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:23:40,346 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:23:40,346 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:23:40,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:23:40,346 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:23:40,346 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 23:23:40,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:23:40,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:23:40,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:23:40,666 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:23:40,667 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:23:40,669 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2022-12-05 23:23:41,819 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:23:42,122 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:23:42,124 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2022-12-05 23:23:42,145 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ac015147/d362904962bb48ddae1a28ff1ea51e8c/FLAG6d964ddc8 [2022-12-05 23:23:42,157 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ac015147/d362904962bb48ddae1a28ff1ea51e8c [2022-12-05 23:23:42,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:23:42,160 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:23:42,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:23:42,161 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:23:42,163 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:23:42,164 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:23:42" (1/1) ... [2022-12-05 23:23:42,165 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@675c0da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:23:42, skipping insertion in model container [2022-12-05 23:23:42,165 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:23:42" (1/1) ... [2022-12-05 23:23:42,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:23:42,226 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:23:42,385 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-05 23:23:42,937 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i[75009,75022] [2022-12-05 23:23:42,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:23:42,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:23:42,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:23:42,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:23:42,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:23:42,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:23:42,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:23:42,991 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:23:43,001 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-05 23:23:43,039 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i[75009,75022] [2022-12-05 23:23:43,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:23:43,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:23:43,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:23:43,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:23:43,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:23:43,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:23:43,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:23:43,209 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:23:43,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:23:43 WrapperNode [2022-12-05 23:23:43,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:23:43,213 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:23:43,213 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:23:43,213 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:23:43,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:23:43" (1/1) ... [2022-12-05 23:23:43,268 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:23:43" (1/1) ... [2022-12-05 23:23:43,291 INFO L138 Inliner]: procedures = 468, calls = 52, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 134 [2022-12-05 23:23:43,291 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:23:43,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:23:43,292 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:23:43,292 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:23:43,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:23:43" (1/1) ... [2022-12-05 23:23:43,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:23:43" (1/1) ... [2022-12-05 23:23:43,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:23:43" (1/1) ... [2022-12-05 23:23:43,303 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:23:43" (1/1) ... [2022-12-05 23:23:43,322 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:23:43" (1/1) ... [2022-12-05 23:23:43,326 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:23:43" (1/1) ... [2022-12-05 23:23:43,330 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:23:43" (1/1) ... [2022-12-05 23:23:43,331 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:23:43" (1/1) ... [2022-12-05 23:23:43,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:23:43,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:23:43,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:23:43,337 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:23:43,337 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:23:43" (1/1) ... [2022-12-05 23:23:43,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:23:43,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:23:43,364 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 23:23:43,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 23:23:43,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:23:43,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:23:43,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:23:43,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 23:23:43,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:23:43,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-05 23:23:43,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:23:43,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:23:43,406 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2022-12-05 23:23:43,406 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2022-12-05 23:23:43,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:23:43,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:23:43,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:23:43,408 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:23:43,730 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:23:43,732 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:23:43,988 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:23:44,014 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:23:44,015 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:23:44,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:23:44 BoogieIcfgContainer [2022-12-05 23:23:44,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:23:44,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:23:44,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:23:44,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:23:44,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:23:42" (1/3) ... [2022-12-05 23:23:44,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3169cc74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:23:44, skipping insertion in model container [2022-12-05 23:23:44,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:23:43" (2/3) ... [2022-12-05 23:23:44,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3169cc74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:23:44, skipping insertion in model container [2022-12-05 23:23:44,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:23:44" (3/3) ... [2022-12-05 23:23:44,027 INFO L112 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2022-12-05 23:23:44,043 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:23:44,043 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-12-05 23:23:44,043 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:23:44,114 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-05 23:23:44,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 165 transitions, 346 flow [2022-12-05 23:23:44,221 INFO L130 PetriNetUnfolder]: 10/203 cut-off events. [2022-12-05 23:23:44,221 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 23:23:44,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 203 events. 10/203 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 309 event pairs, 0 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 120. Up to 4 conditions per place. [2022-12-05 23:23:44,227 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 165 transitions, 346 flow [2022-12-05 23:23:44,233 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 153 transitions, 318 flow [2022-12-05 23:23:44,234 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:44,250 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 153 transitions, 318 flow [2022-12-05 23:23:44,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 153 transitions, 318 flow [2022-12-05 23:23:44,309 INFO L130 PetriNetUnfolder]: 7/184 cut-off events. [2022-12-05 23:23:44,309 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 23:23:44,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 184 events. 7/184 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 259 event pairs, 0 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 110. Up to 4 conditions per place. [2022-12-05 23:23:44,315 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 153 transitions, 318 flow [2022-12-05 23:23:44,316 INFO L188 LiptonReduction]: Number of co-enabled transitions 1584 [2022-12-05 23:23:44,634 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:44,636 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:44,638 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:44,638 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:44,854 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:44,855 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:44,857 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:44,858 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:45,073 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:45,074 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:45,076 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:45,079 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:45,133 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:45,134 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:45,141 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:45,142 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:52,460 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:52,463 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:52,465 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:52,466 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:59,666 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:59,667 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:59,670 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:59,670 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:01,963 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:01,965 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:01,967 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:01,968 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:02,011 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:02,012 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:02,014 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:02,014 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:04,688 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:04,689 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:04,690 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:04,690 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:04,895 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:04,895 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:04,897 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:04,898 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:04,900 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:04,900 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:04,902 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:04,902 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:05,171 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:05,172 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:05,173 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:05,174 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:05,237 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:05,238 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:05,240 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:05,241 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:05,243 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:05,244 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:05,245 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:05,246 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:12,905 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:12,906 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:12,908 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:12,908 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:13,553 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:13,555 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:13,558 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:13,559 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:13,623 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:13,624 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:13,627 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:13,629 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:13,745 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:13,745 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-05 23:24:13,750 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:13,751 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:13,753 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:13,754 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-05 23:24:13,764 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:13,764 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:20,808 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:20,809 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:20,811 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:20,811 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:26,606 INFO L203 LiptonReduction]: Total number of compositions: 127 [2022-12-05 23:24:26,619 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:24:26,624 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;@2b4735b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:24:26,624 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-05 23:24:26,625 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-05 23:24:26,625 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:24:26,625 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:24:26,626 INFO L213 CegarLoopForPetriNet]: trace histogram [1] [2022-12-05 23:24:26,626 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-05 23:24:26,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:24:26,630 INFO L85 PathProgramCache]: Analyzing trace with hash 573, now seen corresponding path program 1 times [2022-12-05 23:24:26,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:24:26,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111037475] [2022-12-05 23:24:26,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:24:26,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:24:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:24:26,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:24:26,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:24:26,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111037475] [2022-12-05 23:24:26,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111037475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:24:26,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:24:26,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-05 23:24:26,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738863026] [2022-12-05 23:24:26,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:24:26,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-05 23:24:26,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:24:26,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-05 23:24:26,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-05 23:24:26,849 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-05 23:24:26,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 70 flow. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:24:26,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:24:26,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-05 23:24:26,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:24:26,954 INFO L130 PetriNetUnfolder]: 142/276 cut-off events. [2022-12-05 23:24:26,954 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-05 23:24:26,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 559 conditions, 276 events. 142/276 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1092 event pairs, 141 based on Foata normal form. 17/269 useless extension candidates. Maximal degree in co-relation 490. Up to 265 conditions per place. [2022-12-05 23:24:26,959 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 23 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2022-12-05 23:24:26,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 26 transitions, 110 flow [2022-12-05 23:24:26,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-05 23:24:26,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-05 23:24:26,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2022-12-05 23:24:26,970 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2022-12-05 23:24:26,971 INFO L175 Difference]: Start difference. First operand has 33 places, 29 transitions, 70 flow. Second operand 2 states and 32 transitions. [2022-12-05 23:24:26,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 26 transitions, 110 flow [2022-12-05 23:24:26,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 26 transitions, 102 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 23:24:26,976 INFO L231 Difference]: Finished difference. Result has 28 places, 26 transitions, 56 flow [2022-12-05 23:24:26,977 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=28, PETRI_TRANSITIONS=26} [2022-12-05 23:24:26,980 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, -5 predicate places. [2022-12-05 23:24:26,980 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:24:26,981 INFO L89 Accepts]: Start accepts. Operand has 28 places, 26 transitions, 56 flow [2022-12-05 23:24:26,984 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:24:26,984 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:24:26,986 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 26 transitions, 56 flow [2022-12-05 23:24:26,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 26 transitions, 56 flow [2022-12-05 23:24:27,004 INFO L130 PetriNetUnfolder]: 1/32 cut-off events. [2022-12-05 23:24:27,004 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:24:27,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 32 events. 1/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:24:27,005 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 26 transitions, 56 flow [2022-12-05 23:24:27,005 INFO L188 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-05 23:24:27,043 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:27,043 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:27,046 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:27,046 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:27,227 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:24:27,229 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 249 [2022-12-05 23:24:27,229 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 25 transitions, 54 flow [2022-12-05 23:24:27,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:24:27,229 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:24:27,229 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-05 23:24:27,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:24:27,230 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-05 23:24:27,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:24:27,230 INFO L85 PathProgramCache]: Analyzing trace with hash 17847559, now seen corresponding path program 1 times [2022-12-05 23:24:27,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:24:27,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405050067] [2022-12-05 23:24:27,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:24:27,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:24:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:24:27,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:24:27,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:24:27,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405050067] [2022-12-05 23:24:27,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405050067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:24:27,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:24:27,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:24:27,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479578167] [2022-12-05 23:24:27,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:24:27,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:24:27,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:24:27,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:24:27,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:24:27,653 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 23:24:27,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 25 transitions, 54 flow. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:24:27,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:24:27,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 23:24:27,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:24:27,814 INFO L130 PetriNetUnfolder]: 264/481 cut-off events. [2022-12-05 23:24:27,814 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 23:24:27,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 969 conditions, 481 events. 264/481 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2022 event pairs, 121 based on Foata normal form. 0/446 useless extension candidates. Maximal degree in co-relation 139. Up to 381 conditions per place. [2022-12-05 23:24:27,820 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 28 selfloop transitions, 6 changer transitions 0/34 dead transitions. [2022-12-05 23:24:27,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 34 transitions, 140 flow [2022-12-05 23:24:27,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:24:27,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:24:27,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-05 23:24:27,822 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-05 23:24:27,823 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 54 flow. Second operand 3 states and 35 transitions. [2022-12-05 23:24:27,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 34 transitions, 140 flow [2022-12-05 23:24:27,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 34 transitions, 140 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:24:27,824 INFO L231 Difference]: Finished difference. Result has 29 places, 29 transitions, 90 flow [2022-12-05 23:24:27,825 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=29, PETRI_TRANSITIONS=29} [2022-12-05 23:24:27,825 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, -4 predicate places. [2022-12-05 23:24:27,825 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:24:27,825 INFO L89 Accepts]: Start accepts. Operand has 29 places, 29 transitions, 90 flow [2022-12-05 23:24:27,826 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:24:27,826 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:24:27,828 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 29 transitions, 90 flow [2022-12-05 23:24:27,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 29 transitions, 90 flow [2022-12-05 23:24:27,844 INFO L130 PetriNetUnfolder]: 29/121 cut-off events. [2022-12-05 23:24:27,845 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-05 23:24:27,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 121 events. 29/121 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 558 event pairs, 16 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 50. Up to 53 conditions per place. [2022-12-05 23:24:27,845 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 29 transitions, 90 flow [2022-12-05 23:24:27,846 INFO L188 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-05 23:24:32,408 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:24:32,409 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4584 [2022-12-05 23:24:32,410 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 29 transitions, 90 flow [2022-12-05 23:24:32,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:24:32,410 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:24:32,410 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 23:24:32,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:24:32,410 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-05 23:24:32,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:24:32,411 INFO L85 PathProgramCache]: Analyzing trace with hash 553267398, now seen corresponding path program 1 times [2022-12-05 23:24:32,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:24:32,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040025167] [2022-12-05 23:24:32,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:24:32,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:24:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:24:32,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:24:32,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:24:32,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040025167] [2022-12-05 23:24:32,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040025167] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:24:32,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:24:32,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:24:32,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150393905] [2022-12-05 23:24:32,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:24:32,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:24:32,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:24:32,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:24:32,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:24:32,605 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 23:24:32,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 29 transitions, 90 flow. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:24:32,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:24:32,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 23:24:32,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:24:32,807 INFO L130 PetriNetUnfolder]: 291/536 cut-off events. [2022-12-05 23:24:32,807 INFO L131 PetriNetUnfolder]: For 147/147 co-relation queries the response was YES. [2022-12-05 23:24:32,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1395 conditions, 536 events. 291/536 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2426 event pairs, 133 based on Foata normal form. 32/566 useless extension candidates. Maximal degree in co-relation 355. Up to 418 conditions per place. [2022-12-05 23:24:32,811 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 30 selfloop transitions, 9 changer transitions 2/41 dead transitions. [2022-12-05 23:24:32,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 41 transitions, 218 flow [2022-12-05 23:24:32,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:24:32,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:24:32,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-05 23:24:32,813 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4533333333333333 [2022-12-05 23:24:32,813 INFO L175 Difference]: Start difference. First operand has 29 places, 29 transitions, 90 flow. Second operand 3 states and 34 transitions. [2022-12-05 23:24:32,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 41 transitions, 218 flow [2022-12-05 23:24:32,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 41 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:24:32,816 INFO L231 Difference]: Finished difference. Result has 31 places, 35 transitions, 155 flow [2022-12-05 23:24:32,816 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=31, PETRI_TRANSITIONS=35} [2022-12-05 23:24:32,817 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2022-12-05 23:24:32,818 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:24:32,818 INFO L89 Accepts]: Start accepts. Operand has 31 places, 35 transitions, 155 flow [2022-12-05 23:24:32,818 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:24:32,819 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:24:32,819 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 35 transitions, 155 flow [2022-12-05 23:24:32,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 35 transitions, 155 flow [2022-12-05 23:24:32,842 INFO L130 PetriNetUnfolder]: 72/193 cut-off events. [2022-12-05 23:24:32,842 INFO L131 PetriNetUnfolder]: For 98/105 co-relation queries the response was YES. [2022-12-05 23:24:32,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 193 events. 72/193 cut-off events. For 98/105 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 978 event pairs, 15 based on Foata normal form. 0/187 useless extension candidates. Maximal degree in co-relation 148. Up to 113 conditions per place. [2022-12-05 23:24:32,843 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 35 transitions, 155 flow [2022-12-05 23:24:32,843 INFO L188 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-05 23:24:32,867 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:32,869 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:32,871 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:32,871 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:33,038 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] L1714-4-->L1744-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#t~pre13#1=|v_ULTIMATE.start_my_drv_probe_#t~pre13#1_55|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_49|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_508|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_88|, #memory_int=|v_#memory_int_568|, ULTIMATE.start_my_drv_probe_#t~nondet14#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet14#1_37|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_508|, ULTIMATE.start_main_#t~ret20#1=|v_ULTIMATE.start_main_#t~ret20#1_120|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#t~pre13#1, ULTIMATE.start_my_drv_probe_#res#1, #memory_$Pointer$.base, ULTIMATE.start_main_~probe_ret~0#1, #memory_int, ULTIMATE.start_my_drv_probe_#t~nondet14#1, #memory_$Pointer$.offset, ULTIMATE.start_main_#t~ret20#1] and [529] $Ultimate##0-->L1693: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_37 24))) (and (= |v_#memory_$Pointer$.offset_245| (store |v_#memory_$Pointer$.offset_246| v_my_callbackThread1of1ForFork0_~data~0.base_37 (store (select |v_#memory_$Pointer$.offset_246| v_my_callbackThread1of1ForFork0_~data~0.base_37) .cse0 (select (select |v_#memory_$Pointer$.offset_245| v_my_callbackThread1of1ForFork0_~data~0.base_37) .cse0)))) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_9| v_my_callbackThread1of1ForFork0_~arg.base_9) (= v_my_callbackThread1of1ForFork0_~data~0.base_37 v_my_callbackThread1of1ForFork0_~__mptr~0.base_13) (= (store |v_#memory_int_303| v_my_callbackThread1of1ForFork0_~data~0.base_37 (store (select |v_#memory_int_303| v_my_callbackThread1of1ForFork0_~data~0.base_37) .cse0 1)) |v_#memory_int_302|) (= v_my_callbackThread1of1ForFork0_~arg.offset_9 |v_my_callbackThread1of1ForFork0_#in~arg.offset_9|) (= (store |v_#memory_$Pointer$.base_246| v_my_callbackThread1of1ForFork0_~data~0.base_37 (store (select |v_#memory_$Pointer$.base_246| v_my_callbackThread1of1ForFork0_~data~0.base_37) .cse0 (select (select |v_#memory_$Pointer$.base_245| v_my_callbackThread1of1ForFork0_~data~0.base_37) .cse0))) |v_#memory_$Pointer$.base_245|) (= v_~my_dev~0.offset_12 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_13) (= v_my_callbackThread1of1ForFork0_~__mptr~0.offset_13 .cse0) (= v_my_callbackThread1of1ForFork0_~__mptr~0.base_13 v_~my_dev~0.base_12))) InVars {my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_9|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_246|, ~my_dev~0.base=v_~my_dev~0.base_12, #memory_int=|v_#memory_int_303|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_9|, ~my_dev~0.offset=v_~my_dev~0.offset_12, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_246|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_245|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_9, ~my_dev~0.base=v_~my_dev~0.base_12, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_9|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_13, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_37, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_37, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_9|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_9, #memory_int=|v_#memory_int_302|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_13, ~my_dev~0.offset=v_~my_dev~0.offset_12, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_245|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork0_~data~0.offset, #memory_$Pointer$.base, my_callbackThread1of1ForFork0_~arg.base, my_callbackThread1of1ForFork0_~arg.offset, #memory_int, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_~data~0.base, #memory_$Pointer$.offset] [2022-12-05 23:24:33,042 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] L1714-4-->L1744-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#t~pre13#1=|v_ULTIMATE.start_my_drv_probe_#t~pre13#1_55|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_49|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_508|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_88|, #memory_int=|v_#memory_int_568|, ULTIMATE.start_my_drv_probe_#t~nondet14#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet14#1_37|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_508|, ULTIMATE.start_main_#t~ret20#1=|v_ULTIMATE.start_main_#t~ret20#1_120|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#t~pre13#1, ULTIMATE.start_my_drv_probe_#res#1, #memory_$Pointer$.base, ULTIMATE.start_main_~probe_ret~0#1, #memory_int, ULTIMATE.start_my_drv_probe_#t~nondet14#1, #memory_$Pointer$.offset, ULTIMATE.start_main_#t~ret20#1] and [539] $Ultimate##0-->L1693: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_51 24))) (and (= (store |v_#memory_$Pointer$.base_266| v_my_callbackThread1of1ForFork1_~data~0.base_51 (store (select |v_#memory_$Pointer$.base_266| v_my_callbackThread1of1ForFork1_~data~0.base_51) .cse0 (select (select |v_#memory_$Pointer$.base_265| v_my_callbackThread1of1ForFork1_~data~0.base_51) .cse0))) |v_#memory_$Pointer$.base_265|) (= (store |v_#memory_int_329| v_my_callbackThread1of1ForFork1_~data~0.base_51 (store (select |v_#memory_int_329| v_my_callbackThread1of1ForFork1_~data~0.base_51) .cse0 1)) |v_#memory_int_328|) (= .cse0 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_23) (= v_~my_dev~0.offset_24 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_23) (= |v_my_callbackThread1of1ForFork1_#in~arg.offset_9| v_my_callbackThread1of1ForFork1_~arg.offset_9) (= (store |v_#memory_$Pointer$.offset_266| v_my_callbackThread1of1ForFork1_~data~0.base_51 (store (select |v_#memory_$Pointer$.offset_266| v_my_callbackThread1of1ForFork1_~data~0.base_51) .cse0 (select (select |v_#memory_$Pointer$.offset_265| v_my_callbackThread1of1ForFork1_~data~0.base_51) .cse0))) |v_#memory_$Pointer$.offset_265|) (= v_my_callbackThread1of1ForFork1_~__mptr~0.base_23 v_~my_dev~0.base_24) (= v_my_callbackThread1of1ForFork1_~data~0.base_51 v_my_callbackThread1of1ForFork1_~__mptr~0.base_23) (= |v_my_callbackThread1of1ForFork1_#in~arg.base_9| v_my_callbackThread1of1ForFork1_~arg.base_9))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_266|, ~my_dev~0.base=v_~my_dev~0.base_24, #memory_int=|v_#memory_int_329|, ~my_dev~0.offset=v_~my_dev~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_266|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_265|, ~my_dev~0.base=v_~my_dev~0.base_24, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_9, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_23, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|, my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_51, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_51, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_9, #memory_int=|v_#memory_int_328|, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_23, ~my_dev~0.offset=v_~my_dev~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_265|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, #memory_$Pointer$.base, my_callbackThread1of1ForFork1_~arg.base, #memory_int, my_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork1_~__mptr~0.base, #memory_$Pointer$.offset] [2022-12-05 23:24:33,045 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] L1714-4-->L1744-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#t~pre13#1=|v_ULTIMATE.start_my_drv_probe_#t~pre13#1_55|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_49|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_508|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_88|, #memory_int=|v_#memory_int_568|, ULTIMATE.start_my_drv_probe_#t~nondet14#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet14#1_37|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_508|, ULTIMATE.start_main_#t~ret20#1=|v_ULTIMATE.start_main_#t~ret20#1_120|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#t~pre13#1, ULTIMATE.start_my_drv_probe_#res#1, #memory_$Pointer$.base, ULTIMATE.start_main_~probe_ret~0#1, #memory_int, ULTIMATE.start_my_drv_probe_#t~nondet14#1, #memory_$Pointer$.offset, ULTIMATE.start_main_#t~ret20#1] and [498] L1697-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_33 28))) (and (= |v_#memory_$Pointer$.offset_165| (store |v_#memory_$Pointer$.offset_166| v_my_callbackThread1of1ForFork0_~data~0.base_33 (store (select |v_#memory_$Pointer$.offset_166| v_my_callbackThread1of1ForFork0_~data~0.base_33) .cse0 (select (select |v_#memory_$Pointer$.offset_165| v_my_callbackThread1of1ForFork0_~data~0.base_33) .cse0)))) (= |v_my_callbackThread1of1ForFork0_#res.base_13| 0) (= (store |v_#memory_int_213| v_my_callbackThread1of1ForFork0_~data~0.base_33 (store (select |v_#memory_int_213| v_my_callbackThread1of1ForFork0_~data~0.base_33) .cse0 (+ v_my_callbackThread1of1ForFork0_~lb~0_21 1))) |v_#memory_int_212|) (= |v_my_callbackThread1of1ForFork0_#res.offset_13| 0) (= (store |v_#memory_$Pointer$.base_166| v_my_callbackThread1of1ForFork0_~data~0.base_33 (store (select |v_#memory_$Pointer$.base_166| v_my_callbackThread1of1ForFork0_~data~0.base_33) .cse0 (select (select |v_#memory_$Pointer$.base_165| v_my_callbackThread1of1ForFork0_~data~0.base_33) .cse0))) |v_#memory_$Pointer$.base_165|))) InVars {my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_33, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_166|, my_callbackThread1of1ForFork0_~lb~0=v_my_callbackThread1of1ForFork0_~lb~0_21, #memory_int=|v_#memory_int_213|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_33, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_166|} OutVars{my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_33, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_13|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_165|, my_callbackThread1of1ForFork0_~lb~0=v_my_callbackThread1of1ForFork0_~lb~0_21, #memory_int=|v_#memory_int_212|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_13|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_33, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_165|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork0_#res.base, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork0_#res.offset, #memory_$Pointer$.offset] [2022-12-05 23:24:33,049 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] L1714-4-->L1744-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#t~pre13#1=|v_ULTIMATE.start_my_drv_probe_#t~pre13#1_55|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_49|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_508|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_88|, #memory_int=|v_#memory_int_568|, ULTIMATE.start_my_drv_probe_#t~nondet14#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet14#1_37|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_508|, ULTIMATE.start_main_#t~ret20#1=|v_ULTIMATE.start_main_#t~ret20#1_120|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#t~pre13#1, ULTIMATE.start_my_drv_probe_#res#1, #memory_$Pointer$.base, ULTIMATE.start_main_~probe_ret~0#1, #memory_int, ULTIMATE.start_my_drv_probe_#t~nondet14#1, #memory_$Pointer$.offset, ULTIMATE.start_main_#t~ret20#1] and [487] L1697-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_29 28))) (and (= (store |v_#memory_int_161| v_my_callbackThread1of1ForFork1_~data~0.base_29 (store (select |v_#memory_int_161| v_my_callbackThread1of1ForFork1_~data~0.base_29) .cse0 (+ v_my_callbackThread1of1ForFork1_~lb~0_19 1))) |v_#memory_int_160|) (= |v_my_callbackThread1of1ForFork1_#res.offset_9| 0) (= |v_my_callbackThread1of1ForFork1_#res.base_9| 0) (= (store |v_#memory_$Pointer$.offset_116| v_my_callbackThread1of1ForFork1_~data~0.base_29 (store (select |v_#memory_$Pointer$.offset_116| v_my_callbackThread1of1ForFork1_~data~0.base_29) .cse0 (select (select |v_#memory_$Pointer$.offset_115| v_my_callbackThread1of1ForFork1_~data~0.base_29) .cse0))) |v_#memory_$Pointer$.offset_115|) (= |v_#memory_$Pointer$.base_115| (store |v_#memory_$Pointer$.base_116| v_my_callbackThread1of1ForFork1_~data~0.base_29 (store (select |v_#memory_$Pointer$.base_116| v_my_callbackThread1of1ForFork1_~data~0.base_29) .cse0 (select (select |v_#memory_$Pointer$.base_115| v_my_callbackThread1of1ForFork1_~data~0.base_29) .cse0)))))) InVars {my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_29, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_29, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_116|, my_callbackThread1of1ForFork1_~lb~0=v_my_callbackThread1of1ForFork1_~lb~0_19, #memory_int=|v_#memory_int_161|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_116|} OutVars{my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_29, my_callbackThread1of1ForFork1_#res.base=|v_my_callbackThread1of1ForFork1_#res.base_9|, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_29, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_115|, my_callbackThread1of1ForFork1_~lb~0=v_my_callbackThread1of1ForFork1_~lb~0_19, #memory_int=|v_#memory_int_160|, my_callbackThread1of1ForFork1_#res.offset=|v_my_callbackThread1of1ForFork1_#res.offset_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_115|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#res.base, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork1_#res.offset, #memory_$Pointer$.offset] [2022-12-05 23:24:33,059 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:24:33,060 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 242 [2022-12-05 23:24:33,061 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 34 transitions, 161 flow [2022-12-05 23:24:33,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:24:33,061 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:24:33,061 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:24:33,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:24:33,061 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-05 23:24:33,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:24:33,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1511688676, now seen corresponding path program 1 times [2022-12-05 23:24:33,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:24:33,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125060246] [2022-12-05 23:24:33,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:24:33,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:24:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:24:33,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:24:33,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:24:33,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125060246] [2022-12-05 23:24:33,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125060246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:24:33,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:24:33,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:24:33,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098896723] [2022-12-05 23:24:33,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:24:33,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-05 23:24:33,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:24:33,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-05 23:24:33,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-05 23:24:33,116 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-05 23:24:33,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 34 transitions, 161 flow. Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:24:33,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:24:33,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-05 23:24:33,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:24:33,163 INFO L130 PetriNetUnfolder]: 45/101 cut-off events. [2022-12-05 23:24:33,163 INFO L131 PetriNetUnfolder]: For 118/118 co-relation queries the response was YES. [2022-12-05 23:24:33,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 101 events. 45/101 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 242 event pairs, 45 based on Foata normal form. 32/132 useless extension candidates. Maximal degree in co-relation 283. Up to 98 conditions per place. [2022-12-05 23:24:33,164 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 16 selfloop transitions, 0 changer transitions 0/17 dead transitions. [2022-12-05 23:24:33,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 17 transitions, 86 flow [2022-12-05 23:24:33,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-05 23:24:33,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-05 23:24:33,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 27 transitions. [2022-12-05 23:24:33,169 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5192307692307693 [2022-12-05 23:24:33,169 INFO L175 Difference]: Start difference. First operand has 30 places, 34 transitions, 161 flow. Second operand 2 states and 27 transitions. [2022-12-05 23:24:33,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 17 transitions, 86 flow [2022-12-05 23:24:33,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 17 transitions, 78 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-05 23:24:33,170 INFO L231 Difference]: Finished difference. Result has 23 places, 17 transitions, 46 flow [2022-12-05 23:24:33,170 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=46, PETRI_PLACES=23, PETRI_TRANSITIONS=17} [2022-12-05 23:24:33,171 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, -10 predicate places. [2022-12-05 23:24:33,171 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:24:33,171 INFO L89 Accepts]: Start accepts. Operand has 23 places, 17 transitions, 46 flow [2022-12-05 23:24:33,171 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:24:33,172 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:24:33,172 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 17 transitions, 46 flow [2022-12-05 23:24:33,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 17 transitions, 46 flow [2022-12-05 23:24:33,178 INFO L130 PetriNetUnfolder]: 4/33 cut-off events. [2022-12-05 23:24:33,178 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:24:33,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 33 events. 4/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 65 event pairs, 4 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 28. Up to 13 conditions per place. [2022-12-05 23:24:33,179 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 17 transitions, 46 flow [2022-12-05 23:24:33,179 INFO L188 LiptonReduction]: Number of co-enabled transitions 52 [2022-12-05 23:24:35,414 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:24:35,415 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2244 [2022-12-05 23:24:35,415 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 17 transitions, 46 flow [2022-12-05 23:24:35,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:24:35,416 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:24:35,416 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:24:35,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:24:35,416 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-05 23:24:35,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:24:35,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1247488126, now seen corresponding path program 1 times [2022-12-05 23:24:35,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:24:35,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312792476] [2022-12-05 23:24:35,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:24:35,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:24:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:24:36,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:24:36,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:24:36,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312792476] [2022-12-05 23:24:36,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312792476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:24:36,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:24:36,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 23:24:36,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089403767] [2022-12-05 23:24:36,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:24:36,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 23:24:36,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:24:36,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 23:24:36,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-05 23:24:36,421 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 23:24:36,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:24:36,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:24:36,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 23:24:36,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:24:36,708 INFO L130 PetriNetUnfolder]: 80/184 cut-off events. [2022-12-05 23:24:36,709 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-12-05 23:24:36,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 184 events. 80/184 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 702 event pairs, 3 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 94. Up to 82 conditions per place. [2022-12-05 23:24:36,710 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 33 selfloop transitions, 10 changer transitions 0/43 dead transitions. [2022-12-05 23:24:36,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 43 transitions, 201 flow [2022-12-05 23:24:36,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:24:36,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:24:36,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-05 23:24:36,711 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43137254901960786 [2022-12-05 23:24:36,711 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 6 states and 44 transitions. [2022-12-05 23:24:36,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 43 transitions, 201 flow [2022-12-05 23:24:36,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 43 transitions, 201 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:24:36,713 INFO L231 Difference]: Finished difference. Result has 28 places, 23 transitions, 97 flow [2022-12-05 23:24:36,713 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=97, PETRI_PLACES=28, PETRI_TRANSITIONS=23} [2022-12-05 23:24:36,714 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, -5 predicate places. [2022-12-05 23:24:36,714 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:24:36,714 INFO L89 Accepts]: Start accepts. Operand has 28 places, 23 transitions, 97 flow [2022-12-05 23:24:36,714 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:24:36,714 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:24:36,715 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 23 transitions, 97 flow [2022-12-05 23:24:36,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 23 transitions, 97 flow [2022-12-05 23:24:36,725 INFO L130 PetriNetUnfolder]: 10/64 cut-off events. [2022-12-05 23:24:36,725 INFO L131 PetriNetUnfolder]: For 28/32 co-relation queries the response was YES. [2022-12-05 23:24:36,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 64 events. 10/64 cut-off events. For 28/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 226 event pairs, 6 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 45. Up to 25 conditions per place. [2022-12-05 23:24:36,725 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 23 transitions, 97 flow [2022-12-05 23:24:36,726 INFO L188 LiptonReduction]: Number of co-enabled transitions 62 [2022-12-05 23:24:36,735 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:24:36,737 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-05 23:24:36,737 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 23 transitions, 97 flow [2022-12-05 23:24:36,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:24:36,738 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:24:36,738 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:24:36,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:24:36,738 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-05 23:24:36,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:24:36,738 INFO L85 PathProgramCache]: Analyzing trace with hash 677927277, now seen corresponding path program 1 times [2022-12-05 23:24:36,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:24:36,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129192804] [2022-12-05 23:24:36,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:24:36,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:24:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:24:38,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:24:38,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:24:38,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129192804] [2022-12-05 23:24:38,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129192804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:24:38,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:24:38,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-05 23:24:38,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924002369] [2022-12-05 23:24:38,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:24:38,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-05 23:24:38,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:24:38,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-05 23:24:38,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-05 23:24:38,391 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 23:24:38,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 23 transitions, 97 flow. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:24:38,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:24:38,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 23:24:38,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:24:39,034 INFO L130 PetriNetUnfolder]: 109/259 cut-off events. [2022-12-05 23:24:39,035 INFO L131 PetriNetUnfolder]: For 182/182 co-relation queries the response was YES. [2022-12-05 23:24:39,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 734 conditions, 259 events. 109/259 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1104 event pairs, 19 based on Foata normal form. 2/259 useless extension candidates. Maximal degree in co-relation 125. Up to 134 conditions per place. [2022-12-05 23:24:39,037 INFO L137 encePairwiseOnDemand]: 7/17 looper letters, 41 selfloop transitions, 13 changer transitions 13/67 dead transitions. [2022-12-05 23:24:39,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 67 transitions, 410 flow [2022-12-05 23:24:39,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 23:24:39,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 23:24:39,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 60 transitions. [2022-12-05 23:24:39,038 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35294117647058826 [2022-12-05 23:24:39,038 INFO L175 Difference]: Start difference. First operand has 28 places, 23 transitions, 97 flow. Second operand 10 states and 60 transitions. [2022-12-05 23:24:39,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 67 transitions, 410 flow [2022-12-05 23:24:39,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 67 transitions, 401 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:24:39,040 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 204 flow [2022-12-05 23:24:39,041 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=204, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2022-12-05 23:24:39,041 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2022-12-05 23:24:39,041 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:24:39,041 INFO L89 Accepts]: Start accepts. Operand has 41 places, 35 transitions, 204 flow [2022-12-05 23:24:39,042 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:24:39,043 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:24:39,043 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 35 transitions, 204 flow [2022-12-05 23:24:39,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 35 transitions, 204 flow [2022-12-05 23:24:39,055 INFO L130 PetriNetUnfolder]: 24/103 cut-off events. [2022-12-05 23:24:39,056 INFO L131 PetriNetUnfolder]: For 103/108 co-relation queries the response was YES. [2022-12-05 23:24:39,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 103 events. 24/103 cut-off events. For 103/108 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 453 event pairs, 3 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 284. Up to 47 conditions per place. [2022-12-05 23:24:39,057 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 35 transitions, 204 flow [2022-12-05 23:24:39,057 INFO L188 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-05 23:24:39,068 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:39,069 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:39,071 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:39,071 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:39,072 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L1693-->L1697: Formula: (= v_my_callbackThread1of1ForFork0_~lb~0_1 (select (select |v_#memory_int_36| v_my_callbackThread1of1ForFork0_~data~0.base_7) (+ v_my_callbackThread1of1ForFork0_~data~0.offset_7 28))) InVars {#memory_int=|v_#memory_int_36|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7} OutVars{#memory_int=|v_#memory_int_36|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, my_callbackThread1of1ForFork0_~lb~0=v_my_callbackThread1of1ForFork0_~lb~0_1, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, my_callbackThread1of1ForFork0_#t~mem7=|v_my_callbackThread1of1ForFork0_#t~mem7_1|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork0_~lb~0, my_callbackThread1of1ForFork0_#t~mem7] and [487] L1697-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_29 28))) (and (= (store |v_#memory_int_161| v_my_callbackThread1of1ForFork1_~data~0.base_29 (store (select |v_#memory_int_161| v_my_callbackThread1of1ForFork1_~data~0.base_29) .cse0 (+ v_my_callbackThread1of1ForFork1_~lb~0_19 1))) |v_#memory_int_160|) (= |v_my_callbackThread1of1ForFork1_#res.offset_9| 0) (= |v_my_callbackThread1of1ForFork1_#res.base_9| 0) (= (store |v_#memory_$Pointer$.offset_116| v_my_callbackThread1of1ForFork1_~data~0.base_29 (store (select |v_#memory_$Pointer$.offset_116| v_my_callbackThread1of1ForFork1_~data~0.base_29) .cse0 (select (select |v_#memory_$Pointer$.offset_115| v_my_callbackThread1of1ForFork1_~data~0.base_29) .cse0))) |v_#memory_$Pointer$.offset_115|) (= |v_#memory_$Pointer$.base_115| (store |v_#memory_$Pointer$.base_116| v_my_callbackThread1of1ForFork1_~data~0.base_29 (store (select |v_#memory_$Pointer$.base_116| v_my_callbackThread1of1ForFork1_~data~0.base_29) .cse0 (select (select |v_#memory_$Pointer$.base_115| v_my_callbackThread1of1ForFork1_~data~0.base_29) .cse0)))))) InVars {my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_29, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_29, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_116|, my_callbackThread1of1ForFork1_~lb~0=v_my_callbackThread1of1ForFork1_~lb~0_19, #memory_int=|v_#memory_int_161|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_116|} OutVars{my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_29, my_callbackThread1of1ForFork1_#res.base=|v_my_callbackThread1of1ForFork1_#res.base_9|, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_29, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_115|, my_callbackThread1of1ForFork1_~lb~0=v_my_callbackThread1of1ForFork1_~lb~0_19, #memory_int=|v_#memory_int_160|, my_callbackThread1of1ForFork1_#res.offset=|v_my_callbackThread1of1ForFork1_#res.offset_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_115|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#res.base, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork1_#res.offset, #memory_$Pointer$.offset] [2022-12-05 23:24:39,183 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:24:39,184 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-05 23:24:39,184 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 34 transitions, 203 flow [2022-12-05 23:24:39,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:24:39,184 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:24:39,184 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:24:39,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:24:39,185 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-05 23:24:39,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:24:39,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1814615517, now seen corresponding path program 2 times [2022-12-05 23:24:39,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:24:39,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060713434] [2022-12-05 23:24:39,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:24:39,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:24:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:24:40,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:24:40,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:24:40,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060713434] [2022-12-05 23:24:40,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060713434] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:24:40,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:24:40,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-05 23:24:40,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393664931] [2022-12-05 23:24:40,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:24:40,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-05 23:24:40,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:24:40,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-05 23:24:40,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-05 23:24:40,447 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-05 23:24:40,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 203 flow. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:24:40,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:24:40,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-05 23:24:40,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:24:41,166 INFO L130 PetriNetUnfolder]: 162/380 cut-off events. [2022-12-05 23:24:41,166 INFO L131 PetriNetUnfolder]: For 566/566 co-relation queries the response was YES. [2022-12-05 23:24:41,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1392 conditions, 380 events. 162/380 cut-off events. For 566/566 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1923 event pairs, 14 based on Foata normal form. 2/380 useless extension candidates. Maximal degree in co-relation 1364. Up to 158 conditions per place. [2022-12-05 23:24:41,179 INFO L137 encePairwiseOnDemand]: 5/19 looper letters, 53 selfloop transitions, 28 changer transitions 13/94 dead transitions. [2022-12-05 23:24:41,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 94 transitions, 703 flow [2022-12-05 23:24:41,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-05 23:24:41,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-05 23:24:41,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 77 transitions. [2022-12-05 23:24:41,185 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33771929824561403 [2022-12-05 23:24:41,186 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 203 flow. Second operand 12 states and 77 transitions. [2022-12-05 23:24:41,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 94 transitions, 703 flow [2022-12-05 23:24:41,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 94 transitions, 673 flow, removed 15 selfloop flow, removed 2 redundant places. [2022-12-05 23:24:41,190 INFO L231 Difference]: Finished difference. Result has 53 places, 53 transitions, 432 flow [2022-12-05 23:24:41,190 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=432, PETRI_PLACES=53, PETRI_TRANSITIONS=53} [2022-12-05 23:24:41,191 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 20 predicate places. [2022-12-05 23:24:41,191 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:24:41,191 INFO L89 Accepts]: Start accepts. Operand has 53 places, 53 transitions, 432 flow [2022-12-05 23:24:41,192 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:24:41,192 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:24:41,192 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 53 transitions, 432 flow [2022-12-05 23:24:41,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 53 transitions, 432 flow [2022-12-05 23:24:41,214 INFO L130 PetriNetUnfolder]: 50/176 cut-off events. [2022-12-05 23:24:41,214 INFO L131 PetriNetUnfolder]: For 416/425 co-relation queries the response was YES. [2022-12-05 23:24:41,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 176 events. 50/176 cut-off events. For 416/425 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 951 event pairs, 2 based on Foata normal form. 1/172 useless extension candidates. Maximal degree in co-relation 670. Up to 73 conditions per place. [2022-12-05 23:24:41,216 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 53 transitions, 432 flow [2022-12-05 23:24:41,216 INFO L188 LiptonReduction]: Number of co-enabled transitions 100 [2022-12-05 23:24:41,221 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:41,222 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2022-12-05 23:24:41,229 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [557] L1714-4-->L1722: Formula: (and (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_75| 0)) (= (store |v_#length_120| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_75| 4) |v_#length_119|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_23| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_25|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_23| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_25|) (= (select (select |v_#memory_int_566| |v_~#t1~0.base_57|) |v_~#t1~0.offset_57|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem15#1_38|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_219| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_23|) (< |v_#StackHeapBarrier_60| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_75|) (= |v_ULTIMATE.start_main_~#data~1#1.base_219| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_23|) (= |v_#valid_160| (store |v_#valid_161| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_75| 1)) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_73| 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_47| |v_ULTIMATE.start_main_~probe_ret~0#1_86|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_86| 0) (= (select |v_#valid_161| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_75|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_60|, ~#t1~0.base=|v_~#t1~0.base_57|, #valid=|v_#valid_161|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_219|, #memory_int=|v_#memory_int_566|, ~#t1~0.offset=|v_~#t1~0.offset_57|, #length=|v_#length_120|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_219|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem15#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem15#1_38|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_75|, ~#t1~0.offset=|v_~#t1~0.offset_57|, ULTIMATE.start_my_drv_probe_#t~nondet14#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet14#1_35|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_25|, ULTIMATE.start_main_#t~ret20#1=|v_ULTIMATE.start_main_#t~ret20#1_116|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_47|, ~#t1~0.base=|v_~#t1~0.base_57|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_86|, #length=|v_#length_119|, ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.offset_62|, ULTIMATE.start_my_drv_disconnect_#t~mem17#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem17#1_50|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_23|, ULTIMATE.start_my_drv_probe_#t~pre13#1=|v_ULTIMATE.start_my_drv_probe_#t~pre13#1_53|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_25|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_219|, ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.base_62|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_73|, #StackHeapBarrier=|v_#StackHeapBarrier_60|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_23|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_566|, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset_36|, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base_36|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_219|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#t~mem15#1, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_probe_#t~pre13#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_probe_#t~nondet14#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_main_#t~ret20#1, ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.base, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_main_~probe_ret~0#1, #valid, #length, ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem17#1, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base] and [554] L1723-2-->ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#memory_int_434| |v_ULTIMATE.start_main_~#data~1#1.base_165|))) (and (= |v_ULTIMATE.start_ldv_assert_~expression#1_201| 0) (= |v_#valid_140| (store |v_#valid_141| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_58| 0)) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_165| 28)) |v_ULTIMATE.start_main_#t~mem22#1_49|) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_159| |v_ULTIMATE.start_ldv_assert_~expression#1_201|) (= (store |v_#memory_int_435| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_58| (store (select |v_#memory_int_435| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_58|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_56| (select (select |v_#memory_int_434| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_58|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_56|))) |v_#memory_int_434|) (= (store |v_#memory_$Pointer$.base_379| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_58| (store (select |v_#memory_$Pointer$.base_379| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_58|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_56| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.base_47|)) |v_#memory_$Pointer$.base_378|) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_159| (ite (= |v_ULTIMATE.start_main_#t~mem22#1_49| 2) 1 0)) (not (= (ite (= 1 (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_165| 24))) 1 0) 0)) (= (store |v_#memory_$Pointer$.offset_379| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_58| (store (select |v_#memory_$Pointer$.offset_379| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_58|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_56| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.offset_47|)) |v_#memory_$Pointer$.offset_378|))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_56|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_379|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_58|, #valid=|v_#valid_141|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_165|, #memory_int=|v_#memory_int_435|, ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.offset_47|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_379|, ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.base_47|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_165|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_201|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_378|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_165|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_159|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_61|, #valid=|v_#valid_140|, #memory_int=|v_#memory_int_434|, ULTIMATE.start_my_drv_disconnect_#t~mem17#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem17#1_38|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_49|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_378|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_165|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1, #memory_$Pointer$.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_ldv_assert_#in~expression#1, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, #valid, #memory_int, ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem17#1, ULTIMATE.start_main_#t~mem22#1, #memory_$Pointer$.offset] [2022-12-05 23:24:41,503 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:41,504 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:41,505 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:24:41,506 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:24:41,507 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L1693-->L1697: Formula: (= v_my_callbackThread1of1ForFork0_~lb~0_1 (select (select |v_#memory_int_36| v_my_callbackThread1of1ForFork0_~data~0.base_7) (+ v_my_callbackThread1of1ForFork0_~data~0.offset_7 28))) InVars {#memory_int=|v_#memory_int_36|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7} OutVars{#memory_int=|v_#memory_int_36|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, my_callbackThread1of1ForFork0_~lb~0=v_my_callbackThread1of1ForFork0_~lb~0_1, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, my_callbackThread1of1ForFork0_#t~mem7=|v_my_callbackThread1of1ForFork0_#t~mem7_1|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork0_~lb~0, my_callbackThread1of1ForFork0_#t~mem7] and [487] L1697-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_29 28))) (and (= (store |v_#memory_int_161| v_my_callbackThread1of1ForFork1_~data~0.base_29 (store (select |v_#memory_int_161| v_my_callbackThread1of1ForFork1_~data~0.base_29) .cse0 (+ v_my_callbackThread1of1ForFork1_~lb~0_19 1))) |v_#memory_int_160|) (= |v_my_callbackThread1of1ForFork1_#res.offset_9| 0) (= |v_my_callbackThread1of1ForFork1_#res.base_9| 0) (= (store |v_#memory_$Pointer$.offset_116| v_my_callbackThread1of1ForFork1_~data~0.base_29 (store (select |v_#memory_$Pointer$.offset_116| v_my_callbackThread1of1ForFork1_~data~0.base_29) .cse0 (select (select |v_#memory_$Pointer$.offset_115| v_my_callbackThread1of1ForFork1_~data~0.base_29) .cse0))) |v_#memory_$Pointer$.offset_115|) (= |v_#memory_$Pointer$.base_115| (store |v_#memory_$Pointer$.base_116| v_my_callbackThread1of1ForFork1_~data~0.base_29 (store (select |v_#memory_$Pointer$.base_116| v_my_callbackThread1of1ForFork1_~data~0.base_29) .cse0 (select (select |v_#memory_$Pointer$.base_115| v_my_callbackThread1of1ForFork1_~data~0.base_29) .cse0)))))) InVars {my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_29, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_29, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_116|, my_callbackThread1of1ForFork1_~lb~0=v_my_callbackThread1of1ForFork1_~lb~0_19, #memory_int=|v_#memory_int_161|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_116|} OutVars{my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_29, my_callbackThread1of1ForFork1_#res.base=|v_my_callbackThread1of1ForFork1_#res.base_9|, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_29, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_115|, my_callbackThread1of1ForFork1_~lb~0=v_my_callbackThread1of1ForFork1_~lb~0_19, #memory_int=|v_#memory_int_160|, my_callbackThread1of1ForFork1_#res.offset=|v_my_callbackThread1of1ForFork1_#res.offset_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_115|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#res.base, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork1_#res.offset, #memory_$Pointer$.offset] [2022-12-05 23:24:41,557 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L1693-->L1697: Formula: (= v_my_callbackThread1of1ForFork0_~lb~0_1 (select (select |v_#memory_int_36| v_my_callbackThread1of1ForFork0_~data~0.base_7) (+ v_my_callbackThread1of1ForFork0_~data~0.offset_7 28))) InVars {#memory_int=|v_#memory_int_36|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7} OutVars{#memory_int=|v_#memory_int_36|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, my_callbackThread1of1ForFork0_~lb~0=v_my_callbackThread1of1ForFork0_~lb~0_1, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, my_callbackThread1of1ForFork0_#t~mem7=|v_my_callbackThread1of1ForFork0_#t~mem7_1|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork0_~lb~0, my_callbackThread1of1ForFork0_#t~mem7] and [557] L1714-4-->L1722: Formula: (and (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_75| 0)) (= (store |v_#length_120| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_75| 4) |v_#length_119|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_23| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_25|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_23| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_25|) (= (select (select |v_#memory_int_566| |v_~#t1~0.base_57|) |v_~#t1~0.offset_57|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem15#1_38|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_219| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_23|) (< |v_#StackHeapBarrier_60| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_75|) (= |v_ULTIMATE.start_main_~#data~1#1.base_219| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_23|) (= |v_#valid_160| (store |v_#valid_161| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_75| 1)) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_73| 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_47| |v_ULTIMATE.start_main_~probe_ret~0#1_86|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_86| 0) (= (select |v_#valid_161| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_75|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_60|, ~#t1~0.base=|v_~#t1~0.base_57|, #valid=|v_#valid_161|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_219|, #memory_int=|v_#memory_int_566|, ~#t1~0.offset=|v_~#t1~0.offset_57|, #length=|v_#length_120|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_219|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem15#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem15#1_38|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_75|, ~#t1~0.offset=|v_~#t1~0.offset_57|, ULTIMATE.start_my_drv_probe_#t~nondet14#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet14#1_35|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_25|, ULTIMATE.start_main_#t~ret20#1=|v_ULTIMATE.start_main_#t~ret20#1_116|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_47|, ~#t1~0.base=|v_~#t1~0.base_57|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_86|, #length=|v_#length_119|, ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.offset_62|, ULTIMATE.start_my_drv_disconnect_#t~mem17#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem17#1_50|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_23|, ULTIMATE.start_my_drv_probe_#t~pre13#1=|v_ULTIMATE.start_my_drv_probe_#t~pre13#1_53|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_25|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_219|, ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.base_62|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_73|, #StackHeapBarrier=|v_#StackHeapBarrier_60|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_23|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_566|, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset_36|, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base_36|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_219|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#t~mem15#1, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_probe_#t~pre13#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_probe_#t~nondet14#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_main_#t~ret20#1, ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.base, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_main_~probe_ret~0#1, #valid, #length, ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem17#1, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base] [2022-12-05 23:24:41,640 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L1693-->L1697: Formula: (= v_my_callbackThread1of1ForFork0_~lb~0_1 (select (select |v_#memory_int_36| v_my_callbackThread1of1ForFork0_~data~0.base_7) (+ v_my_callbackThread1of1ForFork0_~data~0.offset_7 28))) InVars {#memory_int=|v_#memory_int_36|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7} OutVars{#memory_int=|v_#memory_int_36|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, my_callbackThread1of1ForFork0_~lb~0=v_my_callbackThread1of1ForFork0_~lb~0_1, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, my_callbackThread1of1ForFork0_#t~mem7=|v_my_callbackThread1of1ForFork0_#t~mem7_1|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork0_~lb~0, my_callbackThread1of1ForFork0_#t~mem7] and [565] L1714-4-->ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#memory_int_683| |v_ULTIMATE.start_main_~#data~1#1.base_245|))) (and (= |v_ULTIMATE.start_main_~#data~1#1.base_245| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_25|) (= |v_ULTIMATE.start_my_drv_probe_#res#1_63| |v_ULTIMATE.start_main_~probe_ret~0#1_102|) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_172| |v_ULTIMATE.start_ldv_assert_~expression#1_218|) (= (store |v_#memory_int_684| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_88| (store (select |v_#memory_int_684| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_88|) 0 (select (select |v_#memory_int_683| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_88|) 0))) |v_#memory_int_683|) (= (select (select |v_#memory_int_684| |v_~#t1~0.base_59|) |v_~#t1~0.offset_59|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem15#1_48|) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_88| 0)) (= |v_ULTIMATE.start_main_#t~mem22#1_57| (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_245| 28))) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_25| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_27|) (= (store |v_#valid_180| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_88| 0) |v_#valid_178|) (= (store |v_#memory_$Pointer$.base_625| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_88| (store (select |v_#memory_$Pointer$.base_625| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_88|) 0 |v_ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.base_65|)) |v_#memory_$Pointer$.base_624|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_245| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_25|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_102| 0) (= (store |v_#memory_$Pointer$.offset_625| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_88| (store (select |v_#memory_$Pointer$.offset_625| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_88|) 0 |v_ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.offset_65|)) |v_#memory_$Pointer$.offset_624|) (= (select |v_#valid_180| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_88|) 0) (= |v_ULTIMATE.start_ldv_assert_~expression#1_218| 0) (not (= (ite (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_245| 24)) 1) 1 0) 0)) (< |v_#StackHeapBarrier_62| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_88|) (= (store |v_#length_124| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_88| 4) |v_#length_123|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_25| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_27|) (= (ite (= |v_ULTIMATE.start_main_#t~mem22#1_57| 2) 1 0) |v_ULTIMATE.start_ldv_assert_#in~expression#1_172|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_62|, ~#t1~0.base=|v_~#t1~0.base_59|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_625|, #valid=|v_#valid_180|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_245|, #memory_int=|v_#memory_int_684|, ~#t1~0.offset=|v_~#t1~0.offset_59|, #length=|v_#length_124|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_625|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_245|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem15#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem15#1_48|, ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_218|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_624|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_87|, ~#t1~0.offset=|v_~#t1~0.offset_59|, ULTIMATE.start_my_drv_probe_#t~nondet14#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet14#1_51|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_67|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_27|, ULTIMATE.start_main_#t~ret20#1=|v_ULTIMATE.start_main_#t~ret20#1_136|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_63|, ~#t1~0.base=|v_~#t1~0.base_59|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_102|, ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.offset_64|, #length=|v_#length_123|, ULTIMATE.start_my_drv_disconnect_#t~mem17#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem17#1_60|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_57|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_25|, ULTIMATE.start_my_drv_probe_#t~pre13#1=|v_ULTIMATE.start_my_drv_probe_#t~pre13#1_71|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_27|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_245|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_172|, ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.base_64|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_77|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_25|, #valid=|v_#valid_178|, #memory_int=|v_#memory_int_683|, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset_48|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_624|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_245|, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base_48|} AuxVars[|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_88|, |v_ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.base_65|, |v_ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.offset_65|] AssignedVars[ULTIMATE.start_my_drv_disconnect_#t~mem15#1, ULTIMATE.start_ldv_assert_~expression#1, #memory_$Pointer$.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_probe_#t~nondet14#1, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_main_#t~ret20#1, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_main_~probe_ret~0#1, ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.offset, #length, ULTIMATE.start_my_drv_disconnect_#t~mem17#1, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_probe_#t~pre13#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_ldv_assert_#in~expression#1, ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, #valid, #memory_int, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base] [2022-12-05 23:24:41,901 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L1693-->L1697: Formula: (= v_my_callbackThread1of1ForFork0_~lb~0_1 (select (select |v_#memory_int_36| v_my_callbackThread1of1ForFork0_~data~0.base_7) (+ v_my_callbackThread1of1ForFork0_~data~0.offset_7 28))) InVars {#memory_int=|v_#memory_int_36|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7} OutVars{#memory_int=|v_#memory_int_36|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, my_callbackThread1of1ForFork0_~lb~0=v_my_callbackThread1of1ForFork0_~lb~0_1, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, my_callbackThread1of1ForFork0_#t~mem7=|v_my_callbackThread1of1ForFork0_#t~mem7_1|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork0_~lb~0, my_callbackThread1of1ForFork0_#t~mem7] and [557] L1714-4-->L1722: Formula: (and (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_75| 0)) (= (store |v_#length_120| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_75| 4) |v_#length_119|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_23| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_25|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_23| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_25|) (= (select (select |v_#memory_int_566| |v_~#t1~0.base_57|) |v_~#t1~0.offset_57|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem15#1_38|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_219| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_23|) (< |v_#StackHeapBarrier_60| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_75|) (= |v_ULTIMATE.start_main_~#data~1#1.base_219| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_23|) (= |v_#valid_160| (store |v_#valid_161| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_75| 1)) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_73| 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_47| |v_ULTIMATE.start_main_~probe_ret~0#1_86|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_86| 0) (= (select |v_#valid_161| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_75|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_60|, ~#t1~0.base=|v_~#t1~0.base_57|, #valid=|v_#valid_161|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_219|, #memory_int=|v_#memory_int_566|, ~#t1~0.offset=|v_~#t1~0.offset_57|, #length=|v_#length_120|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_219|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem15#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem15#1_38|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_75|, ~#t1~0.offset=|v_~#t1~0.offset_57|, ULTIMATE.start_my_drv_probe_#t~nondet14#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet14#1_35|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_25|, ULTIMATE.start_main_#t~ret20#1=|v_ULTIMATE.start_main_#t~ret20#1_116|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_47|, ~#t1~0.base=|v_~#t1~0.base_57|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_86|, #length=|v_#length_119|, ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.offset_62|, ULTIMATE.start_my_drv_disconnect_#t~mem17#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem17#1_50|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_23|, ULTIMATE.start_my_drv_probe_#t~pre13#1=|v_ULTIMATE.start_my_drv_probe_#t~pre13#1_53|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_25|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_219|, ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.base_62|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_73|, #StackHeapBarrier=|v_#StackHeapBarrier_60|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_23|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_566|, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset_36|, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base_36|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_219|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#t~mem15#1, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_probe_#t~pre13#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_probe_#t~nondet14#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_main_#t~ret20#1, ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.base, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_main_~probe_ret~0#1, #valid, #length, ULTIMATE.start_my_drv_disconnect_#t~nondet18#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem17#1, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base] [2022-12-05 23:24:42,012 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L1693-->L1697: Formula: (= v_my_callbackThread1of1ForFork0_~lb~0_1 (select (select |v_#memory_int_36| v_my_callbackThread1of1ForFork0_~data~0.base_7) (+ v_my_callbackThread1of1ForFork0_~data~0.offset_7 28))) InVars {#memory_int=|v_#memory_int_36|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7} OutVars{#memory_int=|v_#memory_int_36|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, my_callbackThread1of1ForFork0_~lb~0=v_my_callbackThread1of1ForFork0_~lb~0_1, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, my_callbackThread1of1ForFork0_#t~mem7=|v_my_callbackThread1of1ForFork0_#t~mem7_1|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork0_~lb~0, my_callbackThread1of1ForFork0_#t~mem7] and [487] L1697-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_29 28))) (and (= (store |v_#memory_int_161| v_my_callbackThread1of1ForFork1_~data~0.base_29 (store (select |v_#memory_int_161| v_my_callbackThread1of1ForFork1_~data~0.base_29) .cse0 (+ v_my_callbackThread1of1ForFork1_~lb~0_19 1))) |v_#memory_int_160|) (= |v_my_callbackThread1of1ForFork1_#res.offset_9| 0) (= |v_my_callbackThread1of1ForFork1_#res.base_9| 0) (= (store |v_#memory_$Pointer$.offset_116| v_my_callbackThread1of1ForFork1_~data~0.base_29 (store (select |v_#memory_$Pointer$.offset_116| v_my_callbackThread1of1ForFork1_~data~0.base_29) .cse0 (select (select |v_#memory_$Pointer$.offset_115| v_my_callbackThread1of1ForFork1_~data~0.base_29) .cse0))) |v_#memory_$Pointer$.offset_115|) (= |v_#memory_$Pointer$.base_115| (store |v_#memory_$Pointer$.base_116| v_my_callbackThread1of1ForFork1_~data~0.base_29 (store (select |v_#memory_$Pointer$.base_116| v_my_callbackThread1of1ForFork1_~data~0.base_29) .cse0 (select (select |v_#memory_$Pointer$.base_115| v_my_callbackThread1of1ForFork1_~data~0.base_29) .cse0)))))) InVars {my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_29, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_29, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_116|, my_callbackThread1of1ForFork1_~lb~0=v_my_callbackThread1of1ForFork1_~lb~0_19, #memory_int=|v_#memory_int_161|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_116|} OutVars{my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_29, my_callbackThread1of1ForFork1_#res.base=|v_my_callbackThread1of1ForFork1_#res.base_9|, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_29, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_115|, my_callbackThread1of1ForFork1_~lb~0=v_my_callbackThread1of1ForFork1_~lb~0_19, #memory_int=|v_#memory_int_160|, my_callbackThread1of1ForFork1_#res.offset=|v_my_callbackThread1of1ForFork1_#res.offset_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_115|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#res.base, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork1_#res.offset, #memory_$Pointer$.offset] [2022-12-05 23:24:42,087 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:24:42,088 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 897 [2022-12-05 23:24:42,088 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 53 transitions, 475 flow [2022-12-05 23:24:42,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:24:42,089 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:24:42,089 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:24:42,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:24:42,089 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-05 23:24:42,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:24:42,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1452123489, now seen corresponding path program 1 times [2022-12-05 23:24:42,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:24:42,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090048312] [2022-12-05 23:24:42,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:24:42,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:24:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:24:42,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:24:42,570 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.InterpolantChecker.checkInductivity(InterpolantChecker.java:409) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:383) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:154) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:260) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:237) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:848) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:776) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:350) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-05 23:24:42,575 INFO L158 Benchmark]: Toolchain (without parser) took 60413.89ms. Allocated memory was 194.0MB in the beginning and 280.0MB in the end (delta: 86.0MB). Free memory was 167.4MB in the beginning and 210.1MB in the end (delta: -42.8MB). Peak memory consumption was 176.2MB. Max. memory is 8.0GB. [2022-12-05 23:24:42,576 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 194.0MB. Free memory was 171.9MB in the beginning and 171.8MB in the end (delta: 70.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:24:42,576 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1049.30ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 167.4MB in the beginning and 204.3MB in the end (delta: -37.0MB). Peak memory consumption was 61.5MB. Max. memory is 8.0GB. [2022-12-05 23:24:42,576 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.29ms. Allocated memory is still 232.8MB. Free memory was 204.3MB in the beginning and 201.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:24:42,577 INFO L158 Benchmark]: Boogie Preprocessor took 44.09ms. Allocated memory is still 232.8MB. Free memory was 201.2MB in the beginning and 198.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 23:24:42,577 INFO L158 Benchmark]: RCFGBuilder took 682.39ms. Allocated memory is still 232.8MB. Free memory was 198.0MB in the beginning and 174.4MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-05 23:24:42,578 INFO L158 Benchmark]: TraceAbstraction took 58552.64ms. Allocated memory was 232.8MB in the beginning and 280.0MB in the end (delta: 47.2MB). Free memory was 173.9MB in the beginning and 210.1MB in the end (delta: -36.2MB). Peak memory consumption was 143.1MB. Max. memory is 8.0GB. [2022-12-05 23:24:42,580 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 194.0MB. Free memory was 171.9MB in the beginning and 171.8MB in the end (delta: 70.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1049.30ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 167.4MB in the beginning and 204.3MB in the end (delta: -37.0MB). Peak memory consumption was 61.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 78.29ms. Allocated memory is still 232.8MB. Free memory was 204.3MB in the beginning and 201.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.09ms. Allocated memory is still 232.8MB. Free memory was 201.2MB in the beginning and 198.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 682.39ms. Allocated memory is still 232.8MB. Free memory was 198.0MB in the beginning and 174.4MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 58552.64ms. Allocated memory was 232.8MB in the beginning and 280.0MB in the end (delta: 47.2MB). Free memory was 173.9MB in the beginning and 210.1MB in the end (delta: -36.2MB). Peak memory consumption was 143.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 42.3s, 153 PlacesBefore, 33 PlacesAfterwards, 153 TransitionsBefore, 29 TransitionsAfterwards, 1584 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 77 TrivialYvCompositions, 43 ConcurrentYvCompositions, 4 ChoiceCompositions, 127 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 981, independent: 919, independent conditional: 919, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 24, unknown conditional: 24, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 981, independent: 919, independent conditional: 0, independent unconditional: 919, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 24, unknown conditional: 0, unknown unconditional: 24] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 981, independent: 919, independent conditional: 0, independent unconditional: 919, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 24, unknown conditional: 0, unknown unconditional: 24] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 981, independent: 919, independent conditional: 0, independent unconditional: 919, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 24, unknown conditional: 0, unknown unconditional: 24] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 845, independent: 808, independent conditional: 0, independent unconditional: 808, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 845, independent: 808, independent conditional: 0, independent unconditional: 808, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 37, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30749, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 486, dependent conditional: 0, dependent unconditional: 486, unknown: 30263, unknown conditional: 0, unknown unconditional: 30263] ], Cache Queries: [ total: 981, independent: 111, independent conditional: 0, independent unconditional: 111, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 855, unknown conditional: 0, unknown unconditional: 855] , Statistics on independence cache: Total cache size (in pairs): 1321, Positive cache size: 1298, Positive conditional cache size: 0, Positive unconditional cache size: 1298, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 14, Unknown conditional cache size: 0, Unknown unconditional cache size: 14, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 27 PlacesBefore, 26 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 56, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 56, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 36, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 25, unknown conditional: 0, unknown unconditional: 25] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 29 PlacesBefore, 29 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 3, dependent unconditional: 2, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 3, dependent unconditional: 2, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4560, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 186, dependent conditional: 95, dependent unconditional: 91, unknown: 4373, unknown conditional: 4373, unknown unconditional: 0] ], Cache Queries: [ total: 20, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 11, unknown conditional: 7, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 32, Positive cache size: 11, Positive conditional cache size: 0, Positive unconditional cache size: 11, Negative cache size: 21, Negative conditional cache size: 3, Negative unconditional cache size: 18, Unknown cache size: 2, Unknown conditional cache size: 2, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 31 PlacesBefore, 30 PlacesAfterwards, 35 TransitionsBefore, 34 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 111, independent: 59, independent conditional: 59, independent unconditional: 0, dependent: 52, dependent conditional: 52, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 111, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 52, dependent conditional: 6, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 111, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 52, dependent conditional: 6, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 52, dependent conditional: 6, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 10, dependent conditional: 9, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 111, independent: 49, independent conditional: 0, independent unconditional: 49, dependent: 49, dependent conditional: 4, dependent unconditional: 45, unknown: 13, unknown conditional: 2, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 23, Positive conditional cache size: 0, Positive unconditional cache size: 23, Negative cache size: 24, Negative conditional cache size: 5, Negative unconditional cache size: 19, Unknown cache size: 2, Unknown conditional cache size: 2, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 21 PlacesBefore, 21 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 52 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2234, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 2150, unknown conditional: 0, unknown unconditional: 2150] ], Cache Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 23, Positive conditional cache size: 0, Positive unconditional cache size: 23, Negative cache size: 27, Negative conditional cache size: 5, Negative unconditional cache size: 22, Unknown cache size: 3, Unknown conditional cache size: 2, Unknown unconditional cache size: 1, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 28 PlacesBefore, 28 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 62 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 5, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 5, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 5, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, Negative cache size: 30, Negative conditional cache size: 8, Negative unconditional cache size: 22, Unknown cache size: 3, Unknown conditional cache size: 2, Unknown unconditional cache size: 1, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 38 PlacesBefore, 37 PlacesAfterwards, 35 TransitionsBefore, 34 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 32, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 27, Positive conditional cache size: 1, Positive unconditional cache size: 26, Negative cache size: 34, Negative conditional cache size: 12, Negative unconditional cache size: 22, Unknown cache size: 3, Unknown conditional cache size: 2, Unknown unconditional cache size: 1, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 50 PlacesBefore, 50 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 100 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 101, independent: 61, independent conditional: 61, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 101, independent: 61, independent conditional: 61, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 101, independent: 61, independent conditional: 61, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 101, independent: 61, independent conditional: 61, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 101, independent: 58, independent conditional: 58, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 38, Positive conditional cache size: 4, Positive unconditional cache size: 34, Negative cache size: 37, Negative conditional cache size: 15, Negative unconditional cache size: 22, Unknown cache size: 3, Unknown conditional cache size: 2, Unknown unconditional cache size: 1, Eliminated conditions: 0, Maximal queried relation: 0 - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.InterpolantChecker.checkInductivity(InterpolantChecker.java:409) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-05 23:24:42,667 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...