/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-2_2-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:22:23,966 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:22:23,968 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:22:24,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:22:24,005 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:22:24,008 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:22:24,011 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:22:24,015 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:22:24,018 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:22:24,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:22:24,023 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:22:24,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:22:24,025 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:22:24,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:22:24,028 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:22:24,031 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:22:24,031 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:22:24,032 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:22:24,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:22:24,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:22:24,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:22:24,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:22:24,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:22:24,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:22:24,050 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:22:24,050 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:22:24,051 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:22:24,052 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:22:24,052 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:22:24,053 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:22:24,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:22:24,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:22:24,056 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:22:24,057 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:22:24,057 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:22:24,057 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:22:24,058 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:22:24,058 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:22:24,058 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:22:24,059 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:22:24,060 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:22:24,060 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:22:24,090 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:22:24,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:22:24,092 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:22:24,092 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:22:24,093 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:22:24,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:22:24,093 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:22:24,094 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:22:24,094 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:22:24,094 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:22:24,095 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:22:24,095 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:22:24,095 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:22:24,095 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:22:24,095 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:22:24,095 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:22:24,095 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:22:24,096 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:22:24,096 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:22:24,096 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:22:24,096 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:22:24,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:22:24,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:22:24,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:22:24,104 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:22:24,104 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:22:24,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:22:24,104 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:22:24,104 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:22:24,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:22:24,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:22:24,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:22:24,436 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:22:24,436 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:22:24,437 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_2-container_of.i [2022-12-05 23:22:25,520 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:22:25,777 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:22:25,777 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_2-container_of.i [2022-12-05 23:22:25,795 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daa9c88ca/0c0f70f1321448969b8fc9310f923579/FLAGa6c6a57e9 [2022-12-05 23:22:26,100 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daa9c88ca/0c0f70f1321448969b8fc9310f923579 [2022-12-05 23:22:26,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:22:26,104 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:22:26,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:22:26,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:22:26,107 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:22:26,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:22:26" (1/1) ... [2022-12-05 23:22:26,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bb90732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:26, skipping insertion in model container [2022-12-05 23:22:26,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:22:26" (1/1) ... [2022-12-05 23:22:26,114 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:22:26,171 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:22:26,336 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-05 23:22:26,908 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-2_2-container_of.i[75002,75015] [2022-12-05 23:22:26,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:22:26,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:22:26,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:22:26,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:22:26,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:22:26,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:22:26,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:22:26,965 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:22:26,976 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-05 23:22:27,014 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-2_2-container_of.i[75002,75015] [2022-12-05 23:22:27,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:22:27,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:22:27,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:22:27,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:22:27,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:22:27,020 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:22:27,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:22:27,175 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:22:27,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:27 WrapperNode [2022-12-05 23:22:27,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:22:27,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:22:27,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:22:27,177 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:22:27,183 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:22:27" (1/1) ... [2022-12-05 23:22:27,224 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:22:27" (1/1) ... [2022-12-05 23:22:27,263 INFO L138 Inliner]: procedures = 468, calls = 48, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 115 [2022-12-05 23:22:27,264 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:22:27,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:22:27,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:22:27,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:22:27,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:27" (1/1) ... [2022-12-05 23:22:27,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:27" (1/1) ... [2022-12-05 23:22:27,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:27" (1/1) ... [2022-12-05 23:22:27,292 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:27" (1/1) ... [2022-12-05 23:22:27,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:27" (1/1) ... [2022-12-05 23:22:27,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:27" (1/1) ... [2022-12-05 23:22:27,324 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:27" (1/1) ... [2022-12-05 23:22:27,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:27" (1/1) ... [2022-12-05 23:22:27,330 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:22:27,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:22:27,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:22:27,331 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:22:27,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:27" (1/1) ... [2022-12-05 23:22:27,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:22:27,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:22:27,376 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:22:27,400 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:22:27,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:22:27,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:22:27,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:22:27,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 23:22:27,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:22:27,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-05 23:22:27,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:22:27,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:22:27,415 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2022-12-05 23:22:27,415 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2022-12-05 23:22:27,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:22:27,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:22:27,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:22:27,417 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:22:27,734 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:22:27,736 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:22:27,893 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:22:27,907 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:22:27,908 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:22:27,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:22:27 BoogieIcfgContainer [2022-12-05 23:22:27,910 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:22:27,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:22:27,912 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:22:27,914 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:22:27,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:22:26" (1/3) ... [2022-12-05 23:22:27,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d035ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:22:27, skipping insertion in model container [2022-12-05 23:22:27,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:27" (2/3) ... [2022-12-05 23:22:27,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d035ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:22:27, skipping insertion in model container [2022-12-05 23:22:27,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:22:27" (3/3) ... [2022-12-05 23:22:27,916 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i [2022-12-05 23:22:27,931 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:22:27,931 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-12-05 23:22:27,932 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:22:27,978 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-05 23:22:28,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 146 transitions, 308 flow [2022-12-05 23:22:28,094 INFO L130 PetriNetUnfolder]: 8/184 cut-off events. [2022-12-05 23:22:28,094 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 23:22:28,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 184 events. 8/184 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 308 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 100. Up to 4 conditions per place. [2022-12-05 23:22:28,099 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 146 transitions, 308 flow [2022-12-05 23:22:28,107 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 134 transitions, 280 flow [2022-12-05 23:22:28,108 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:22:28,127 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 134 transitions, 280 flow [2022-12-05 23:22:28,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 134 transitions, 280 flow [2022-12-05 23:22:28,182 INFO L130 PetriNetUnfolder]: 5/165 cut-off events. [2022-12-05 23:22:28,182 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 23:22:28,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 165 events. 5/165 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs, 0 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 90. Up to 4 conditions per place. [2022-12-05 23:22:28,187 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 134 transitions, 280 flow [2022-12-05 23:22:28,187 INFO L188 LiptonReduction]: Number of co-enabled transitions 1780 [2022-12-05 23:22:28,374 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:28,375 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:28,379 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:28,381 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:28,878 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:28,880 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:28,882 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:28,883 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:31,485 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:31,486 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:31,488 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:31,489 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:31,755 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:31,756 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:31,759 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:31,760 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:34,240 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:34,242 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:34,243 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:34,244 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:39,036 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:39,036 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:39,038 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:39,039 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:41,421 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:41,422 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:41,424 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:41,425 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:41,494 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:41,495 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:41,496 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:41,497 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:41,620 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:41,621 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:41,623 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:41,624 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:46,945 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:46,946 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:46,948 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:46,948 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:49,720 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:49,721 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2022-12-05 23:22:49,724 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:49,725 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2022-12-05 23:22:49,727 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:49,728 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:49,730 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:49,731 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:49,734 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:49,735 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:49,737 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:49,740 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:49,743 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:49,743 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2022-12-05 23:22:49,746 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:49,746 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:49,750 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:49,752 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:49,755 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:49,755 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:53,242 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:53,243 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:53,244 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:53,245 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:53,339 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:53,340 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:53,341 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:53,342 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:53,605 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:53,606 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-05 23:22:53,611 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:53,612 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:53,618 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:53,619 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-05 23:22:53,621 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:53,622 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:53,634 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:53,634 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:53,639 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:53,640 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:53,643 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:53,643 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-05 23:22:53,647 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:53,648 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:53,651 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:53,651 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-05 23:22:53,656 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:53,657 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:58,590 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:58,592 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-05 23:22:58,598 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:58,598 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2022-12-05 23:22:58,604 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:58,604 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:58,608 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:58,609 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-05 23:22:58,615 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:58,616 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2022-12-05 23:22:58,618 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:58,619 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:58,628 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:58,629 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-05 23:22:58,634 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:58,635 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:58,638 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:58,638 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-05 23:22:58,642 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:58,643 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:18,353 INFO L203 LiptonReduction]: Total number of compositions: 110 [2022-12-05 23:23:18,365 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:23:18,370 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;@681d27a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:23:18,371 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 23:23:18,374 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-05 23:23:18,374 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:23:18,374 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:18,374 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-05 23:23:18,375 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-05 23:23:18,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:18,378 INFO L85 PathProgramCache]: Analyzing trace with hash 496104, now seen corresponding path program 1 times [2022-12-05 23:23:18,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:18,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111428937] [2022-12-05 23:23:18,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:18,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:18,696 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:23:18,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:18,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111428937] [2022-12-05 23:23:18,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111428937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:18,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:18,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:23:18,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595299472] [2022-12-05 23:23:18,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:18,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-05 23:23:18,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:18,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-05 23:23:18,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-05 23:23:18,736 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-05 23:23:18,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 66 flow. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:18,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:18,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-05 23:23:18,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:18,850 INFO L130 PetriNetUnfolder]: 166/318 cut-off events. [2022-12-05 23:23:18,851 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-05 23:23:18,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 318 events. 166/318 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1296 event pairs, 165 based on Foata normal form. 17/298 useless extension candidates. Maximal degree in co-relation 572. Up to 305 conditions per place. [2022-12-05 23:23:18,857 INFO L137 encePairwiseOnDemand]: 26/27 looper letters, 23 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2022-12-05 23:23:18,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 26 transitions, 110 flow [2022-12-05 23:23:18,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-05 23:23:18,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-05 23:23:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 30 transitions. [2022-12-05 23:23:18,867 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-05 23:23:18,868 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 66 flow. Second operand 2 states and 30 transitions. [2022-12-05 23:23:18,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 26 transitions, 110 flow [2022-12-05 23:23:18,871 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:23:18,872 INFO L231 Difference]: Finished difference. Result has 28 places, 26 transitions, 56 flow [2022-12-05 23:23:18,873 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, 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:23:18,878 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2022-12-05 23:23:18,878 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:18,879 INFO L89 Accepts]: Start accepts. Operand has 28 places, 26 transitions, 56 flow [2022-12-05 23:23:18,881 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:18,881 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:18,881 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 26 transitions, 56 flow [2022-12-05 23:23:18,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 26 transitions, 56 flow [2022-12-05 23:23:18,895 INFO L130 PetriNetUnfolder]: 1/32 cut-off events. [2022-12-05 23:23:18,895 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:23:18,895 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 5. Compared 60 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:23:18,896 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 26 transitions, 56 flow [2022-12-05 23:23:18,896 INFO L188 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-05 23:23:18,916 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:18,916 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:18,918 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:18,918 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:19,087 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:23:19,089 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 211 [2022-12-05 23:23:19,089 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 25 transitions, 54 flow [2022-12-05 23:23:19,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:23:19,089 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:19,089 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-05 23:23:19,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:23:19,090 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-05 23:23:19,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:19,090 INFO L85 PathProgramCache]: Analyzing trace with hash 15374103, now seen corresponding path program 1 times [2022-12-05 23:23:19,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:19,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520612472] [2022-12-05 23:23:19,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:19,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:19,398 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:23:19,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:19,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520612472] [2022-12-05 23:23:19,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520612472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:19,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:19,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:23:19,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445966926] [2022-12-05 23:23:19,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:19,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:23:19,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:19,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:23:19,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:23:19,410 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 23:23:19,410 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:23:19,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:19,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 23:23:19,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:19,574 INFO L130 PetriNetUnfolder]: 264/481 cut-off events. [2022-12-05 23:23:19,575 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 23:23:19,580 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 2043 event pairs, 122 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:23:19,582 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 28 selfloop transitions, 6 changer transitions 0/34 dead transitions. [2022-12-05 23:23:19,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 34 transitions, 140 flow [2022-12-05 23:23:19,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:23:19,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:23:19,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-05 23:23:19,586 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-05 23:23:19,586 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:23:19,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 34 transitions, 140 flow [2022-12-05 23:23:19,586 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:23:19,588 INFO L231 Difference]: Finished difference. Result has 29 places, 29 transitions, 90 flow [2022-12-05 23:23:19,588 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:23:19,588 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2022-12-05 23:23:19,589 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:19,589 INFO L89 Accepts]: Start accepts. Operand has 29 places, 29 transitions, 90 flow [2022-12-05 23:23:19,589 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:19,589 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:19,589 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 29 transitions, 90 flow [2022-12-05 23:23:19,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 29 transitions, 90 flow [2022-12-05 23:23:19,602 INFO L130 PetriNetUnfolder]: 29/121 cut-off events. [2022-12-05 23:23:19,602 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-05 23:23:19,602 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 564 event pairs, 16 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 50. Up to 53 conditions per place. [2022-12-05 23:23:19,603 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 29 transitions, 90 flow [2022-12-05 23:23:19,603 INFO L188 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-05 23:23:19,619 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:23:19,622 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-05 23:23:19,623 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 29 transitions, 90 flow [2022-12-05 23:23:19,623 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:23:19,623 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:19,623 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 23:23:19,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:23:19,623 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-05 23:23:19,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:19,624 INFO L85 PathProgramCache]: Analyzing trace with hash 476595173, now seen corresponding path program 1 times [2022-12-05 23:23:19,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:19,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989436606] [2022-12-05 23:23:19,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:19,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:19,812 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:23:19,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:19,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989436606] [2022-12-05 23:23:19,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989436606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:19,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:19,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:23:19,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037269430] [2022-12-05 23:23:19,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:19,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:23:19,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:19,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:23:19,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:23:19,814 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 23:23:19,814 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:23:19,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:19,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 23:23:19,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:19,974 INFO L130 PetriNetUnfolder]: 291/536 cut-off events. [2022-12-05 23:23:19,974 INFO L131 PetriNetUnfolder]: For 146/146 co-relation queries the response was YES. [2022-12-05 23:23:19,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1395 conditions, 536 events. 291/536 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2407 event pairs, 135 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:23:19,977 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 30 selfloop transitions, 9 changer transitions 2/41 dead transitions. [2022-12-05 23:23:19,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 41 transitions, 218 flow [2022-12-05 23:23:19,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:23:19,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:23:19,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-05 23:23:19,979 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4533333333333333 [2022-12-05 23:23:19,979 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:23:19,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 41 transitions, 218 flow [2022-12-05 23:23:19,981 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:23:19,982 INFO L231 Difference]: Finished difference. Result has 31 places, 35 transitions, 155 flow [2022-12-05 23:23:19,982 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:23:19,983 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2022-12-05 23:23:19,983 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:19,983 INFO L89 Accepts]: Start accepts. Operand has 31 places, 35 transitions, 155 flow [2022-12-05 23:23:19,983 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:19,984 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:19,984 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 35 transitions, 155 flow [2022-12-05 23:23:19,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 35 transitions, 155 flow [2022-12-05 23:23:20,005 INFO L130 PetriNetUnfolder]: 72/193 cut-off events. [2022-12-05 23:23:20,006 INFO L131 PetriNetUnfolder]: For 98/105 co-relation queries the response was YES. [2022-12-05 23:23:20,006 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 982 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:23:20,007 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 35 transitions, 155 flow [2022-12-05 23:23:20,007 INFO L188 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-05 23:23:20,029 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:20,030 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:20,032 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:20,032 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:20,197 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [481] L1712-4-->L1742-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#t~nondet12#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet12#1_31|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_39|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_487|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_76|, #memory_int=|v_#memory_int_532|, ULTIMATE.start_main_#t~ret18#1=|v_ULTIMATE.start_main_#t~ret18#1_96|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_487|, ULTIMATE.start_my_drv_probe_#t~pre11#1=|v_ULTIMATE.start_my_drv_probe_#t~pre11#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#t~nondet12#1, ULTIMATE.start_my_drv_probe_#res#1, #memory_$Pointer$.base, ULTIMATE.start_main_~probe_ret~0#1, #memory_int, ULTIMATE.start_main_#t~ret18#1, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_probe_#t~pre11#1] and [457] $Ultimate##0-->L1693: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_53 24))) (and (= .cse0 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_13) (= v_my_callbackThread1of1ForFork1_~arg.offset_11 v_my_callbackThread1of1ForFork1_~dev~0.offset_15) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~arg.base_11) (= (store |v_#memory_$Pointer$.base_231| v_my_callbackThread1of1ForFork1_~data~0.base_53 (store (select |v_#memory_$Pointer$.base_231| v_my_callbackThread1of1ForFork1_~data~0.base_53) .cse0 (select (select |v_#memory_$Pointer$.base_230| v_my_callbackThread1of1ForFork1_~data~0.base_53) .cse0))) |v_#memory_$Pointer$.base_230|) (= v_my_callbackThread1of1ForFork1_~arg.base_11 |v_my_callbackThread1of1ForFork1_#in~arg.base_9|) (= v_my_callbackThread1of1ForFork1_~arg.offset_11 |v_my_callbackThread1of1ForFork1_#in~arg.offset_9|) (= (store |v_#memory_int_277| v_my_callbackThread1of1ForFork1_~data~0.base_53 (store (select |v_#memory_int_277| v_my_callbackThread1of1ForFork1_~data~0.base_53) .cse0 1)) |v_#memory_int_276|) (= |v_#memory_$Pointer$.offset_230| (store |v_#memory_$Pointer$.offset_231| v_my_callbackThread1of1ForFork1_~data~0.base_53 (store (select |v_#memory_$Pointer$.offset_231| v_my_callbackThread1of1ForFork1_~data~0.base_53) .cse0 (select (select |v_#memory_$Pointer$.offset_230| v_my_callbackThread1of1ForFork1_~data~0.base_53) .cse0)))) (= v_my_callbackThread1of1ForFork1_~data~0.base_53 v_my_callbackThread1of1ForFork1_~__mptr~0.base_13) (= v_my_callbackThread1of1ForFork1_~dev~0.offset_15 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_13) (= v_my_callbackThread1of1ForFork1_~dev~0.base_15 v_my_callbackThread1of1ForFork1_~__mptr~0.base_13))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_9|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_231|, #memory_int=|v_#memory_int_277|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_231|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_9|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_230|, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_11, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_13, 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_53, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_53, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_11, #memory_int=|v_#memory_int_276|, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_13, my_callbackThread1of1ForFork1_~dev~0.offset=v_my_callbackThread1of1ForFork1_~dev~0.offset_15, my_callbackThread1of1ForFork1_~dev~0.base=v_my_callbackThread1of1ForFork1_~dev~0.base_15, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_230|} 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, my_callbackThread1of1ForFork1_~dev~0.offset, my_callbackThread1of1ForFork1_~dev~0.base, #memory_$Pointer$.offset] [2022-12-05 23:23:20,205 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [481] L1712-4-->L1742-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#t~nondet12#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet12#1_31|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_39|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_487|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_76|, #memory_int=|v_#memory_int_532|, ULTIMATE.start_main_#t~ret18#1=|v_ULTIMATE.start_main_#t~ret18#1_96|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_487|, ULTIMATE.start_my_drv_probe_#t~pre11#1=|v_ULTIMATE.start_my_drv_probe_#t~pre11#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#t~nondet12#1, ULTIMATE.start_my_drv_probe_#res#1, #memory_$Pointer$.base, ULTIMATE.start_main_~probe_ret~0#1, #memory_int, ULTIMATE.start_main_#t~ret18#1, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_probe_#t~pre11#1] and [456] $Ultimate##0-->L1693: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_35 24))) (and (= v_my_callbackThread1of1ForFork0_~dev~0.offset_15 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_15) (= v_my_callbackThread1of1ForFork0_~arg.base_11 |v_my_callbackThread1of1ForFork0_#in~arg.base_9|) (= (store |v_#memory_int_273| v_my_callbackThread1of1ForFork0_~data~0.base_35 (store (select |v_#memory_int_273| v_my_callbackThread1of1ForFork0_~data~0.base_35) .cse0 1)) |v_#memory_int_272|) (= v_my_callbackThread1of1ForFork0_~arg.offset_11 |v_my_callbackThread1of1ForFork0_#in~arg.offset_9|) (= v_my_callbackThread1of1ForFork0_~dev~0.base_15 v_my_callbackThread1of1ForFork0_~__mptr~0.base_15) (= v_my_callbackThread1of1ForFork0_~data~0.base_35 v_my_callbackThread1of1ForFork0_~__mptr~0.base_15) (= (store |v_#memory_$Pointer$.offset_227| v_my_callbackThread1of1ForFork0_~data~0.base_35 (store (select |v_#memory_$Pointer$.offset_227| v_my_callbackThread1of1ForFork0_~data~0.base_35) .cse0 (select (select |v_#memory_$Pointer$.offset_226| v_my_callbackThread1of1ForFork0_~data~0.base_35) .cse0))) |v_#memory_$Pointer$.offset_226|) (= v_my_callbackThread1of1ForFork0_~arg.offset_11 v_my_callbackThread1of1ForFork0_~dev~0.offset_15) (= v_my_callbackThread1of1ForFork0_~dev~0.base_15 v_my_callbackThread1of1ForFork0_~arg.base_11) (= (store |v_#memory_$Pointer$.base_227| v_my_callbackThread1of1ForFork0_~data~0.base_35 (store (select |v_#memory_$Pointer$.base_227| v_my_callbackThread1of1ForFork0_~data~0.base_35) .cse0 (select (select |v_#memory_$Pointer$.base_226| v_my_callbackThread1of1ForFork0_~data~0.base_35) .cse0))) |v_#memory_$Pointer$.base_226|) (= .cse0 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_15))) InVars {my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_9|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_227|, #memory_int=|v_#memory_int_273|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_227|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_226|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_11, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_9|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_15, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_35, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_35, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_9|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_11, #memory_int=|v_#memory_int_272|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_15, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_15, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_15, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_226|} 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_~dev~0.base, my_callbackThread1of1ForFork0_~data~0.base, my_callbackThread1of1ForFork0_~dev~0.offset, #memory_$Pointer$.offset] [2022-12-05 23:23:20,208 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [481] L1712-4-->L1742-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#t~nondet12#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet12#1_31|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_39|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_487|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_76|, #memory_int=|v_#memory_int_532|, ULTIMATE.start_main_#t~ret18#1=|v_ULTIMATE.start_main_#t~ret18#1_96|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_487|, ULTIMATE.start_my_drv_probe_#t~pre11#1=|v_ULTIMATE.start_my_drv_probe_#t~pre11#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#t~nondet12#1, ULTIMATE.start_my_drv_probe_#res#1, #memory_$Pointer$.base, ULTIMATE.start_main_~probe_ret~0#1, #memory_int, ULTIMATE.start_main_#t~ret18#1, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_probe_#t~pre11#1] and [372] L1697-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_21 28))) (and (= (store |v_#memory_$Pointer$.base_48| v_my_callbackThread1of1ForFork1_~data~0.base_21 (store (select |v_#memory_$Pointer$.base_48| v_my_callbackThread1of1ForFork1_~data~0.base_21) .cse0 (select (select |v_#memory_$Pointer$.base_47| v_my_callbackThread1of1ForFork1_~data~0.base_21) .cse0))) |v_#memory_$Pointer$.base_47|) (= |v_my_callbackThread1of1ForFork1_#res.offset_11| 0) (= (store |v_#memory_$Pointer$.offset_48| v_my_callbackThread1of1ForFork1_~data~0.base_21 (store (select |v_#memory_$Pointer$.offset_48| v_my_callbackThread1of1ForFork1_~data~0.base_21) .cse0 (select (select |v_#memory_$Pointer$.offset_47| v_my_callbackThread1of1ForFork1_~data~0.base_21) .cse0))) |v_#memory_$Pointer$.offset_47|) (= |v_#memory_int_76| (store |v_#memory_int_77| v_my_callbackThread1of1ForFork1_~data~0.base_21 (store (select |v_#memory_int_77| v_my_callbackThread1of1ForFork1_~data~0.base_21) .cse0 (+ v_my_callbackThread1of1ForFork1_~lb~0_13 1)))) (= |v_my_callbackThread1of1ForFork1_#res.base_11| 0))) InVars {my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_21, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_21, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_48|, my_callbackThread1of1ForFork1_~lb~0=v_my_callbackThread1of1ForFork1_~lb~0_13, #memory_int=|v_#memory_int_77|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_48|} OutVars{my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_21, my_callbackThread1of1ForFork1_#res.base=|v_my_callbackThread1of1ForFork1_#res.base_11|, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_21, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_47|, my_callbackThread1of1ForFork1_~lb~0=v_my_callbackThread1of1ForFork1_~lb~0_13, #memory_int=|v_#memory_int_76|, my_callbackThread1of1ForFork1_#res.offset=|v_my_callbackThread1of1ForFork1_#res.offset_11|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_47|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#res.base, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork1_#res.offset, #memory_$Pointer$.offset] [2022-12-05 23:23:20,212 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [481] L1712-4-->L1742-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#t~nondet12#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet12#1_31|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_39|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_487|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_76|, #memory_int=|v_#memory_int_532|, ULTIMATE.start_main_#t~ret18#1=|v_ULTIMATE.start_main_#t~ret18#1_96|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_487|, ULTIMATE.start_my_drv_probe_#t~pre11#1=|v_ULTIMATE.start_my_drv_probe_#t~pre11#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#t~nondet12#1, ULTIMATE.start_my_drv_probe_#res#1, #memory_$Pointer$.base, ULTIMATE.start_main_~probe_ret~0#1, #memory_int, ULTIMATE.start_main_#t~ret18#1, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_probe_#t~pre11#1] and [431] L1697-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_21 28))) (and (= |v_#memory_$Pointer$.offset_145| (store |v_#memory_$Pointer$.offset_146| v_my_callbackThread1of1ForFork0_~data~0.base_21 (store (select |v_#memory_$Pointer$.offset_146| v_my_callbackThread1of1ForFork0_~data~0.base_21) .cse0 (select (select |v_#memory_$Pointer$.offset_145| v_my_callbackThread1of1ForFork0_~data~0.base_21) .cse0)))) (= (store |v_#memory_int_189| v_my_callbackThread1of1ForFork0_~data~0.base_21 (store (select |v_#memory_int_189| v_my_callbackThread1of1ForFork0_~data~0.base_21) .cse0 (+ v_my_callbackThread1of1ForFork0_~lb~0_13 1))) |v_#memory_int_188|) (= (store |v_#memory_$Pointer$.base_146| v_my_callbackThread1of1ForFork0_~data~0.base_21 (store (select |v_#memory_$Pointer$.base_146| v_my_callbackThread1of1ForFork0_~data~0.base_21) .cse0 (select (select |v_#memory_$Pointer$.base_145| v_my_callbackThread1of1ForFork0_~data~0.base_21) .cse0))) |v_#memory_$Pointer$.base_145|) (= |v_my_callbackThread1of1ForFork0_#res.offset_11| 0) (= |v_my_callbackThread1of1ForFork0_#res.base_11| 0))) InVars {my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_21, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_146|, my_callbackThread1of1ForFork0_~lb~0=v_my_callbackThread1of1ForFork0_~lb~0_13, #memory_int=|v_#memory_int_189|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_21, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_146|} OutVars{my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_21, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_11|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_145|, my_callbackThread1of1ForFork0_~lb~0=v_my_callbackThread1of1ForFork0_~lb~0_13, #memory_int=|v_#memory_int_188|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_11|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_21, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_145|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork0_#res.base, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork0_#res.offset, #memory_$Pointer$.offset] [2022-12-05 23:23:20,223 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:23:20,224 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 241 [2022-12-05 23:23:20,224 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 34 transitions, 161 flow [2022-12-05 23:23:20,224 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:23:20,224 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:20,224 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:20,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:23:20,224 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-05 23:23:20,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:20,225 INFO L85 PathProgramCache]: Analyzing trace with hash -600227607, now seen corresponding path program 1 times [2022-12-05 23:23:20,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:20,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67234087] [2022-12-05 23:23:20,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:20,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:20,271 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:23:20,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:20,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67234087] [2022-12-05 23:23:20,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67234087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:20,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:20,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:23:20,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932594856] [2022-12-05 23:23:20,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:20,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-05 23:23:20,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:20,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-05 23:23:20,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-05 23:23:20,275 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-05 23:23:20,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 34 transitions, 161 flow. Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:23:20,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:20,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-05 23:23:20,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:20,313 INFO L130 PetriNetUnfolder]: 45/101 cut-off events. [2022-12-05 23:23:20,314 INFO L131 PetriNetUnfolder]: For 113/113 co-relation queries the response was YES. [2022-12-05 23:23:20,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 101 events. 45/101 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 244 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:23:20,315 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 16 selfloop transitions, 0 changer transitions 0/17 dead transitions. [2022-12-05 23:23:20,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 17 transitions, 86 flow [2022-12-05 23:23:20,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-05 23:23:20,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-05 23:23:20,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 25 transitions. [2022-12-05 23:23:20,316 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4807692307692308 [2022-12-05 23:23:20,316 INFO L175 Difference]: Start difference. First operand has 30 places, 34 transitions, 161 flow. Second operand 2 states and 25 transitions. [2022-12-05 23:23:20,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 17 transitions, 86 flow [2022-12-05 23:23:20,316 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:23:20,317 INFO L231 Difference]: Finished difference. Result has 23 places, 17 transitions, 46 flow [2022-12-05 23:23:20,317 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:23:20,318 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, -8 predicate places. [2022-12-05 23:23:20,318 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:20,318 INFO L89 Accepts]: Start accepts. Operand has 23 places, 17 transitions, 46 flow [2022-12-05 23:23:20,318 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:20,319 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:20,319 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 17 transitions, 46 flow [2022-12-05 23:23:20,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 17 transitions, 46 flow [2022-12-05 23:23:20,323 INFO L130 PetriNetUnfolder]: 4/33 cut-off events. [2022-12-05 23:23:20,323 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:23:20,324 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 66 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:23:20,324 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 17 transitions, 46 flow [2022-12-05 23:23:20,324 INFO L188 LiptonReduction]: Number of co-enabled transitions 52 [2022-12-05 23:23:22,565 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:23:22,566 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2248 [2022-12-05 23:23:22,566 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 17 transitions, 46 flow [2022-12-05 23:23:22,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:23:22,566 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:22,566 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:23:22,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:23:22,566 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-05 23:23:22,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:22,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1230531998, now seen corresponding path program 1 times [2022-12-05 23:23:22,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:22,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725018444] [2022-12-05 23:23:22,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:22,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:23,828 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:23:23,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:23,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725018444] [2022-12-05 23:23:23,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725018444] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:23,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:23,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 23:23:23,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098472456] [2022-12-05 23:23:23,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:23,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 23:23:23,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:23,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 23:23:23,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-05 23:23:23,830 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 23:23:23,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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:23:23,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:23,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 23:23:23,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:24,168 INFO L130 PetriNetUnfolder]: 89/203 cut-off events. [2022-12-05 23:23:24,168 INFO L131 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2022-12-05 23:23:24,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 203 events. 89/203 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 808 event pairs, 3 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 64. Up to 85 conditions per place. [2022-12-05 23:23:24,170 INFO L137 encePairwiseOnDemand]: 9/17 looper letters, 38 selfloop transitions, 11 changer transitions 0/49 dead transitions. [2022-12-05 23:23:24,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 49 transitions, 233 flow [2022-12-05 23:23:24,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 23:23:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 23:23:24,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2022-12-05 23:23:24,171 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36764705882352944 [2022-12-05 23:23:24,171 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 8 states and 50 transitions. [2022-12-05 23:23:24,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 49 transitions, 233 flow [2022-12-05 23:23:24,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 49 transitions, 233 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:23:24,172 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 102 flow [2022-12-05 23:23:24,173 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=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=102, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2022-12-05 23:23:24,173 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2022-12-05 23:23:24,173 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:24,173 INFO L89 Accepts]: Start accepts. Operand has 31 places, 23 transitions, 102 flow [2022-12-05 23:23:24,174 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:24,174 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:24,174 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 23 transitions, 102 flow [2022-12-05 23:23:24,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 23 transitions, 102 flow [2022-12-05 23:23:24,183 INFO L130 PetriNetUnfolder]: 9/66 cut-off events. [2022-12-05 23:23:24,183 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-05 23:23:24,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 66 events. 9/66 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 239 event pairs, 8 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 67. Up to 27 conditions per place. [2022-12-05 23:23:24,184 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 23 transitions, 102 flow [2022-12-05 23:23:24,184 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-05 23:23:24,338 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:23:24,339 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-05 23:23:24,339 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 102 flow [2022-12-05 23:23:24,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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:23:24,340 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:24,340 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:23:24,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:23:24,340 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-05 23:23:24,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:24,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1790724328, now seen corresponding path program 1 times [2022-12-05 23:23:24,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:24,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133174660] [2022-12-05 23:23:24,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:24,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:26,076 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:23:26,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:26,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133174660] [2022-12-05 23:23:26,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133174660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:26,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:26,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-05 23:23:26,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626970242] [2022-12-05 23:23:26,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:26,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-05 23:23:26,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:26,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-05 23:23:26,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-12-05 23:23:26,078 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 23:23:26,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 102 flow. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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:23:26,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:26,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 23:23:26,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:27,034 INFO L130 PetriNetUnfolder]: 139/311 cut-off events. [2022-12-05 23:23:27,034 INFO L131 PetriNetUnfolder]: For 207/207 co-relation queries the response was YES. [2022-12-05 23:23:27,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 882 conditions, 311 events. 139/311 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1393 event pairs, 32 based on Foata normal form. 1/310 useless extension candidates. Maximal degree in co-relation 367. Up to 191 conditions per place. [2022-12-05 23:23:27,036 INFO L137 encePairwiseOnDemand]: 4/17 looper letters, 45 selfloop transitions, 19 changer transitions 13/77 dead transitions. [2022-12-05 23:23:27,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 77 transitions, 474 flow [2022-12-05 23:23:27,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 23:23:27,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 23:23:27,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-12-05 23:23:27,038 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2986425339366516 [2022-12-05 23:23:27,038 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 102 flow. Second operand 13 states and 66 transitions. [2022-12-05 23:23:27,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 77 transitions, 474 flow [2022-12-05 23:23:27,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 77 transitions, 466 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 23:23:27,040 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 268 flow [2022-12-05 23:23:27,040 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=268, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2022-12-05 23:23:27,041 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2022-12-05 23:23:27,041 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:27,041 INFO L89 Accepts]: Start accepts. Operand has 48 places, 40 transitions, 268 flow [2022-12-05 23:23:27,045 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:27,045 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:27,045 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 40 transitions, 268 flow [2022-12-05 23:23:27,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 40 transitions, 268 flow [2022-12-05 23:23:27,058 INFO L130 PetriNetUnfolder]: 22/117 cut-off events. [2022-12-05 23:23:27,058 INFO L131 PetriNetUnfolder]: For 147/150 co-relation queries the response was YES. [2022-12-05 23:23:27,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 117 events. 22/117 cut-off events. For 147/150 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 584 event pairs, 1 based on Foata normal form. 2/116 useless extension candidates. Maximal degree in co-relation 351. Up to 50 conditions per place. [2022-12-05 23:23:27,059 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 40 transitions, 268 flow [2022-12-05 23:23:27,059 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-05 23:23:27,173 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:27,174 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2022-12-05 23:23:27,180 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [456] $Ultimate##0-->L1693: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_35 24))) (and (= v_my_callbackThread1of1ForFork0_~dev~0.offset_15 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_15) (= v_my_callbackThread1of1ForFork0_~arg.base_11 |v_my_callbackThread1of1ForFork0_#in~arg.base_9|) (= (store |v_#memory_int_273| v_my_callbackThread1of1ForFork0_~data~0.base_35 (store (select |v_#memory_int_273| v_my_callbackThread1of1ForFork0_~data~0.base_35) .cse0 1)) |v_#memory_int_272|) (= v_my_callbackThread1of1ForFork0_~arg.offset_11 |v_my_callbackThread1of1ForFork0_#in~arg.offset_9|) (= v_my_callbackThread1of1ForFork0_~dev~0.base_15 v_my_callbackThread1of1ForFork0_~__mptr~0.base_15) (= v_my_callbackThread1of1ForFork0_~data~0.base_35 v_my_callbackThread1of1ForFork0_~__mptr~0.base_15) (= (store |v_#memory_$Pointer$.offset_227| v_my_callbackThread1of1ForFork0_~data~0.base_35 (store (select |v_#memory_$Pointer$.offset_227| v_my_callbackThread1of1ForFork0_~data~0.base_35) .cse0 (select (select |v_#memory_$Pointer$.offset_226| v_my_callbackThread1of1ForFork0_~data~0.base_35) .cse0))) |v_#memory_$Pointer$.offset_226|) (= v_my_callbackThread1of1ForFork0_~arg.offset_11 v_my_callbackThread1of1ForFork0_~dev~0.offset_15) (= v_my_callbackThread1of1ForFork0_~dev~0.base_15 v_my_callbackThread1of1ForFork0_~arg.base_11) (= (store |v_#memory_$Pointer$.base_227| v_my_callbackThread1of1ForFork0_~data~0.base_35 (store (select |v_#memory_$Pointer$.base_227| v_my_callbackThread1of1ForFork0_~data~0.base_35) .cse0 (select (select |v_#memory_$Pointer$.base_226| v_my_callbackThread1of1ForFork0_~data~0.base_35) .cse0))) |v_#memory_$Pointer$.base_226|) (= .cse0 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_15))) InVars {my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_9|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_227|, #memory_int=|v_#memory_int_273|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_227|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_226|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_11, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_9|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_15, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_35, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_35, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_9|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_11, #memory_int=|v_#memory_int_272|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_15, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_15, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_15, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_226|} 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_~dev~0.base, my_callbackThread1of1ForFork0_~data~0.base, my_callbackThread1of1ForFork0_~dev~0.offset, #memory_$Pointer$.offset] and [477] L1721-2-->ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#memory_int_400| |v_ULTIMATE.start_main_~#data~1#1.base_147|))) (and (= |v_#valid_116| (store |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56| 0)) (= |v_#memory_$Pointer$.base_362| (store |v_#memory_$Pointer$.base_363| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56| (store (select |v_#memory_$Pointer$.base_363| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_54| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base_43|))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_117| (ite (= |v_ULTIMATE.start_main_#t~mem20#1_55| 2) 1 0)) (= |v_ULTIMATE.start_ldv_assert_~expression#1_121| 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_147| 28)) |v_ULTIMATE.start_main_#t~mem20#1_55|) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_117| |v_ULTIMATE.start_ldv_assert_~expression#1_121|) (= (store |v_#memory_int_401| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56| (store (select |v_#memory_int_401| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_54| (select (select |v_#memory_int_400| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_54|))) |v_#memory_int_400|) (not (= (ite (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_147| 24)) 1) 1 0) 0)) (= (store |v_#memory_$Pointer$.offset_363| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56| (store (select |v_#memory_$Pointer$.offset_363| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_54| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset_43|)) |v_#memory_$Pointer$.offset_362|))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_54|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_363|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56|, #valid=|v_#valid_117|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_147|, #memory_int=|v_#memory_int_401|, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset_43|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_363|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_147|, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base_43|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem15#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem15#1_32|, ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_121|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_362|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_147|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_117|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_55|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_65|, #valid=|v_#valid_116|, #memory_int=|v_#memory_int_400|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_362|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_147|} AuxVars[] 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_ldv_assert_#in~expression#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, #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:23:27,458 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:23:27,459 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 418 [2022-12-05 23:23:27,459 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 289 flow [2022-12-05 23:23:27,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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:23:27,460 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:27,460 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:27,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:23:27,460 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-05 23:23:27,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:27,460 INFO L85 PathProgramCache]: Analyzing trace with hash 767117381, now seen corresponding path program 1 times [2022-12-05 23:23:27,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:27,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968032194] [2022-12-05 23:23:27,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:27,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:28,858 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:23:28,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:28,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968032194] [2022-12-05 23:23:28,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968032194] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:28,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:28,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-05 23:23:28,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805818347] [2022-12-05 23:23:28,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:28,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-05 23:23:28,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:28,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-05 23:23:28,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-12-05 23:23:28,860 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-05 23:23:28,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 289 flow. Second operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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:23:28,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:28,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-05 23:23:28,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:29,707 INFO L130 PetriNetUnfolder]: 144/344 cut-off events. [2022-12-05 23:23:29,708 INFO L131 PetriNetUnfolder]: For 651/651 co-relation queries the response was YES. [2022-12-05 23:23:29,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1321 conditions, 344 events. 144/344 cut-off events. For 651/651 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1689 event pairs, 34 based on Foata normal form. 1/342 useless extension candidates. Maximal degree in co-relation 1302. Up to 216 conditions per place. [2022-12-05 23:23:29,710 INFO L137 encePairwiseOnDemand]: 6/19 looper letters, 51 selfloop transitions, 31 changer transitions 11/93 dead transitions. [2022-12-05 23:23:29,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 93 transitions, 759 flow [2022-12-05 23:23:29,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 23:23:29,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 23:23:29,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 77 transitions. [2022-12-05 23:23:29,713 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3117408906882591 [2022-12-05 23:23:29,713 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 289 flow. Second operand 13 states and 77 transitions. [2022-12-05 23:23:29,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 93 transitions, 759 flow [2022-12-05 23:23:29,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 93 transitions, 705 flow, removed 26 selfloop flow, removed 3 redundant places. [2022-12-05 23:23:29,718 INFO L231 Difference]: Finished difference. Result has 63 places, 58 transitions, 486 flow [2022-12-05 23:23:29,718 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=486, PETRI_PLACES=63, PETRI_TRANSITIONS=58} [2022-12-05 23:23:29,721 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 32 predicate places. [2022-12-05 23:23:29,721 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:29,721 INFO L89 Accepts]: Start accepts. Operand has 63 places, 58 transitions, 486 flow [2022-12-05 23:23:29,723 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:29,723 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:29,723 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 58 transitions, 486 flow [2022-12-05 23:23:29,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 58 transitions, 486 flow [2022-12-05 23:23:29,742 INFO L130 PetriNetUnfolder]: 26/138 cut-off events. [2022-12-05 23:23:29,743 INFO L131 PetriNetUnfolder]: For 358/366 co-relation queries the response was YES. [2022-12-05 23:23:29,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 533 conditions, 138 events. 26/138 cut-off events. For 358/366 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 728 event pairs, 1 based on Foata normal form. 1/135 useless extension candidates. Maximal degree in co-relation 502. Up to 41 conditions per place. [2022-12-05 23:23:29,744 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 58 transitions, 486 flow [2022-12-05 23:23:29,744 INFO L188 LiptonReduction]: Number of co-enabled transitions 112 [2022-12-05 23:23:29,980 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:29,981 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2022-12-05 23:23:29,997 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [456] $Ultimate##0-->L1693: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_35 24))) (and (= v_my_callbackThread1of1ForFork0_~dev~0.offset_15 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_15) (= v_my_callbackThread1of1ForFork0_~arg.base_11 |v_my_callbackThread1of1ForFork0_#in~arg.base_9|) (= (store |v_#memory_int_273| v_my_callbackThread1of1ForFork0_~data~0.base_35 (store (select |v_#memory_int_273| v_my_callbackThread1of1ForFork0_~data~0.base_35) .cse0 1)) |v_#memory_int_272|) (= v_my_callbackThread1of1ForFork0_~arg.offset_11 |v_my_callbackThread1of1ForFork0_#in~arg.offset_9|) (= v_my_callbackThread1of1ForFork0_~dev~0.base_15 v_my_callbackThread1of1ForFork0_~__mptr~0.base_15) (= v_my_callbackThread1of1ForFork0_~data~0.base_35 v_my_callbackThread1of1ForFork0_~__mptr~0.base_15) (= (store |v_#memory_$Pointer$.offset_227| v_my_callbackThread1of1ForFork0_~data~0.base_35 (store (select |v_#memory_$Pointer$.offset_227| v_my_callbackThread1of1ForFork0_~data~0.base_35) .cse0 (select (select |v_#memory_$Pointer$.offset_226| v_my_callbackThread1of1ForFork0_~data~0.base_35) .cse0))) |v_#memory_$Pointer$.offset_226|) (= v_my_callbackThread1of1ForFork0_~arg.offset_11 v_my_callbackThread1of1ForFork0_~dev~0.offset_15) (= v_my_callbackThread1of1ForFork0_~dev~0.base_15 v_my_callbackThread1of1ForFork0_~arg.base_11) (= (store |v_#memory_$Pointer$.base_227| v_my_callbackThread1of1ForFork0_~data~0.base_35 (store (select |v_#memory_$Pointer$.base_227| v_my_callbackThread1of1ForFork0_~data~0.base_35) .cse0 (select (select |v_#memory_$Pointer$.base_226| v_my_callbackThread1of1ForFork0_~data~0.base_35) .cse0))) |v_#memory_$Pointer$.base_226|) (= .cse0 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_15))) InVars {my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_9|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_227|, #memory_int=|v_#memory_int_273|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_227|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_226|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_11, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_9|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_15, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_35, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_35, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_9|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_11, #memory_int=|v_#memory_int_272|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_15, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_15, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_15, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_226|} 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_~dev~0.base, my_callbackThread1of1ForFork0_~data~0.base, my_callbackThread1of1ForFork0_~dev~0.offset, #memory_$Pointer$.offset] and [477] L1721-2-->ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#memory_int_400| |v_ULTIMATE.start_main_~#data~1#1.base_147|))) (and (= |v_#valid_116| (store |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56| 0)) (= |v_#memory_$Pointer$.base_362| (store |v_#memory_$Pointer$.base_363| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56| (store (select |v_#memory_$Pointer$.base_363| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_54| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base_43|))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_117| (ite (= |v_ULTIMATE.start_main_#t~mem20#1_55| 2) 1 0)) (= |v_ULTIMATE.start_ldv_assert_~expression#1_121| 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_147| 28)) |v_ULTIMATE.start_main_#t~mem20#1_55|) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_117| |v_ULTIMATE.start_ldv_assert_~expression#1_121|) (= (store |v_#memory_int_401| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56| (store (select |v_#memory_int_401| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_54| (select (select |v_#memory_int_400| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_54|))) |v_#memory_int_400|) (not (= (ite (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_147| 24)) 1) 1 0) 0)) (= (store |v_#memory_$Pointer$.offset_363| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56| (store (select |v_#memory_$Pointer$.offset_363| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_54| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset_43|)) |v_#memory_$Pointer$.offset_362|))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_54|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_363|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56|, #valid=|v_#valid_117|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_147|, #memory_int=|v_#memory_int_401|, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset_43|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_363|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_147|, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base_43|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem15#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem15#1_32|, ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_121|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_362|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_147|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_117|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_55|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_65|, #valid=|v_#valid_116|, #memory_int=|v_#memory_int_400|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_362|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_147|} AuxVars[] 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_ldv_assert_#in~expression#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, #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:23:30,244 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:23:30,245 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 524 [2022-12-05 23:23:30,245 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 489 flow [2022-12-05 23:23:30,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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:23:30,245 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:30,245 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:30,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:23:30,246 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-05 23:23:30,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:30,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1501102409, now seen corresponding path program 2 times [2022-12-05 23:23:30,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:30,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546207176] [2022-12-05 23:23:30,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:30,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:31,631 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:23:31,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:31,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546207176] [2022-12-05 23:23:31,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546207176] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:31,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:31,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-05 23:23:31,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352209351] [2022-12-05 23:23:31,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:31,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-05 23:23:31,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:31,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-05 23:23:31,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-12-05 23:23:31,633 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-05 23:23:31,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 489 flow. Second operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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:23:31,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:31,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-05 23:23:31,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:32,549 INFO L130 PetriNetUnfolder]: 152/383 cut-off events. [2022-12-05 23:23:32,549 INFO L131 PetriNetUnfolder]: For 1245/1245 co-relation queries the response was YES. [2022-12-05 23:23:32,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1689 conditions, 383 events. 152/383 cut-off events. For 1245/1245 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1990 event pairs, 57 based on Foata normal form. 1/378 useless extension candidates. Maximal degree in co-relation 1631. Up to 123 conditions per place. [2022-12-05 23:23:32,552 INFO L137 encePairwiseOnDemand]: 8/19 looper letters, 71 selfloop transitions, 31 changer transitions 17/119 dead transitions. [2022-12-05 23:23:32,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 119 transitions, 1120 flow [2022-12-05 23:23:32,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 23:23:32,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 23:23:32,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 83 transitions. [2022-12-05 23:23:32,561 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31203007518796994 [2022-12-05 23:23:32,562 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 489 flow. Second operand 14 states and 83 transitions. [2022-12-05 23:23:32,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 119 transitions, 1120 flow [2022-12-05 23:23:32,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 119 transitions, 1011 flow, removed 40 selfloop flow, removed 5 redundant places. [2022-12-05 23:23:32,571 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 635 flow [2022-12-05 23:23:32,572 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=635, PETRI_PLACES=73, PETRI_TRANSITIONS=71} [2022-12-05 23:23:32,574 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 42 predicate places. [2022-12-05 23:23:32,574 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:32,574 INFO L89 Accepts]: Start accepts. Operand has 73 places, 71 transitions, 635 flow [2022-12-05 23:23:32,576 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:32,576 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:32,576 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 71 transitions, 635 flow [2022-12-05 23:23:32,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 71 transitions, 635 flow [2022-12-05 23:23:32,603 INFO L130 PetriNetUnfolder]: 29/165 cut-off events. [2022-12-05 23:23:32,603 INFO L131 PetriNetUnfolder]: For 542/550 co-relation queries the response was YES. [2022-12-05 23:23:32,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 165 events. 29/165 cut-off events. For 542/550 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 920 event pairs, 2 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 569. Up to 43 conditions per place. [2022-12-05 23:23:32,605 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 71 transitions, 635 flow [2022-12-05 23:23:32,605 INFO L188 LiptonReduction]: Number of co-enabled transitions 118 [2022-12-05 23:23:32,616 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:32,617 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:32,618 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:32,620 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:32,621 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [480] L1712-4-->L1720: Formula: (and (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_71| 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_37| 0) (= (store |v_#length_92| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_73| 4) |v_#length_91|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_193| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_19|) (= (store |v_#valid_137| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_73| 1) |v_#valid_136|) (= (select (select |v_#memory_int_530| |v_~#t1~0.base_41|) |v_~#t1~0.offset_41|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem13#1_32|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_74| 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_73| 0)) (= |v_ULTIMATE.start_main_~#data~1#1.base_193| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_19|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_19| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_19|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_19| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_19|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_73|) (= (select |v_#valid_137| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_73|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_42|, ~#t1~0.base=|v_~#t1~0.base_41|, #valid=|v_#valid_137|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_193|, #memory_int=|v_#memory_int_530|, ~#t1~0.offset=|v_~#t1~0.offset_41|, #length=|v_#length_92|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_193|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem15#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem15#1_44|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_73|, ~#t1~0.offset=|v_~#t1~0.offset_41|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_19|, ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.offset_36|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_37|, ~#t1~0.base=|v_~#t1~0.base_41|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_74|, #length=|v_#length_91|, ULTIMATE.start_my_drv_probe_#t~pre11#1=|v_ULTIMATE.start_my_drv_probe_#t~pre11#1_45|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_19|, ULTIMATE.start_my_drv_probe_#t~nondet12#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet12#1_29|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_19|, ULTIMATE.start_my_drv_disconnect_#t~mem13#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem13#1_32|, ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.base_36|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_193|, ULTIMATE.start_main_#t~ret18#1=|v_ULTIMATE.start_main_#t~ret18#1_92|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_71|, #StackHeapBarrier=|v_#StackHeapBarrier_42|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_19|, #valid=|v_#valid_136|, #memory_int=|v_#memory_int_530|, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset_58|, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base_58|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_193|} 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~nondet12#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~mem13#1, ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.base, ULTIMATE.start_main_#t~ret18#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.offset, 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~nondet16#1.offset, ULTIMATE.start_my_drv_probe_#t~pre11#1, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base] and [431] L1697-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_21 28))) (and (= |v_#memory_$Pointer$.offset_145| (store |v_#memory_$Pointer$.offset_146| v_my_callbackThread1of1ForFork0_~data~0.base_21 (store (select |v_#memory_$Pointer$.offset_146| v_my_callbackThread1of1ForFork0_~data~0.base_21) .cse0 (select (select |v_#memory_$Pointer$.offset_145| v_my_callbackThread1of1ForFork0_~data~0.base_21) .cse0)))) (= (store |v_#memory_int_189| v_my_callbackThread1of1ForFork0_~data~0.base_21 (store (select |v_#memory_int_189| v_my_callbackThread1of1ForFork0_~data~0.base_21) .cse0 (+ v_my_callbackThread1of1ForFork0_~lb~0_13 1))) |v_#memory_int_188|) (= (store |v_#memory_$Pointer$.base_146| v_my_callbackThread1of1ForFork0_~data~0.base_21 (store (select |v_#memory_$Pointer$.base_146| v_my_callbackThread1of1ForFork0_~data~0.base_21) .cse0 (select (select |v_#memory_$Pointer$.base_145| v_my_callbackThread1of1ForFork0_~data~0.base_21) .cse0))) |v_#memory_$Pointer$.base_145|) (= |v_my_callbackThread1of1ForFork0_#res.offset_11| 0) (= |v_my_callbackThread1of1ForFork0_#res.base_11| 0))) InVars {my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_21, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_146|, my_callbackThread1of1ForFork0_~lb~0=v_my_callbackThread1of1ForFork0_~lb~0_13, #memory_int=|v_#memory_int_189|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_21, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_146|} OutVars{my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_21, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_11|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_145|, my_callbackThread1of1ForFork0_~lb~0=v_my_callbackThread1of1ForFork0_~lb~0_13, #memory_int=|v_#memory_int_188|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_11|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_21, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_145|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork0_#res.base, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork0_#res.offset, #memory_$Pointer$.offset] [2022-12-05 23:23:32,777 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [480] L1712-4-->L1720: Formula: (and (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_71| 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_37| 0) (= (store |v_#length_92| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_73| 4) |v_#length_91|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_193| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_19|) (= (store |v_#valid_137| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_73| 1) |v_#valid_136|) (= (select (select |v_#memory_int_530| |v_~#t1~0.base_41|) |v_~#t1~0.offset_41|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem13#1_32|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_74| 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_73| 0)) (= |v_ULTIMATE.start_main_~#data~1#1.base_193| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_19|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_19| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_19|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_19| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_19|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_73|) (= (select |v_#valid_137| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_73|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_42|, ~#t1~0.base=|v_~#t1~0.base_41|, #valid=|v_#valid_137|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_193|, #memory_int=|v_#memory_int_530|, ~#t1~0.offset=|v_~#t1~0.offset_41|, #length=|v_#length_92|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_193|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem15#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem15#1_44|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_73|, ~#t1~0.offset=|v_~#t1~0.offset_41|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_19|, ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.offset_36|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_37|, ~#t1~0.base=|v_~#t1~0.base_41|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_74|, #length=|v_#length_91|, ULTIMATE.start_my_drv_probe_#t~pre11#1=|v_ULTIMATE.start_my_drv_probe_#t~pre11#1_45|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_19|, ULTIMATE.start_my_drv_probe_#t~nondet12#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet12#1_29|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_19|, ULTIMATE.start_my_drv_disconnect_#t~mem13#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem13#1_32|, ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.base_36|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_193|, ULTIMATE.start_main_#t~ret18#1=|v_ULTIMATE.start_main_#t~ret18#1_92|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_71|, #StackHeapBarrier=|v_#StackHeapBarrier_42|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_19|, #valid=|v_#valid_136|, #memory_int=|v_#memory_int_530|, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset_58|, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base_58|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_193|} 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~nondet12#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~mem13#1, ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.base, ULTIMATE.start_main_#t~ret18#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.offset, 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~nondet16#1.offset, ULTIMATE.start_my_drv_probe_#t~pre11#1, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base] and [372] L1697-->my_callbackEXIT: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_21 28))) (and (= (store |v_#memory_$Pointer$.base_48| v_my_callbackThread1of1ForFork1_~data~0.base_21 (store (select |v_#memory_$Pointer$.base_48| v_my_callbackThread1of1ForFork1_~data~0.base_21) .cse0 (select (select |v_#memory_$Pointer$.base_47| v_my_callbackThread1of1ForFork1_~data~0.base_21) .cse0))) |v_#memory_$Pointer$.base_47|) (= |v_my_callbackThread1of1ForFork1_#res.offset_11| 0) (= (store |v_#memory_$Pointer$.offset_48| v_my_callbackThread1of1ForFork1_~data~0.base_21 (store (select |v_#memory_$Pointer$.offset_48| v_my_callbackThread1of1ForFork1_~data~0.base_21) .cse0 (select (select |v_#memory_$Pointer$.offset_47| v_my_callbackThread1of1ForFork1_~data~0.base_21) .cse0))) |v_#memory_$Pointer$.offset_47|) (= |v_#memory_int_76| (store |v_#memory_int_77| v_my_callbackThread1of1ForFork1_~data~0.base_21 (store (select |v_#memory_int_77| v_my_callbackThread1of1ForFork1_~data~0.base_21) .cse0 (+ v_my_callbackThread1of1ForFork1_~lb~0_13 1)))) (= |v_my_callbackThread1of1ForFork1_#res.base_11| 0))) InVars {my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_21, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_21, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_48|, my_callbackThread1of1ForFork1_~lb~0=v_my_callbackThread1of1ForFork1_~lb~0_13, #memory_int=|v_#memory_int_77|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_48|} OutVars{my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_21, my_callbackThread1of1ForFork1_#res.base=|v_my_callbackThread1of1ForFork1_#res.base_11|, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_21, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_47|, my_callbackThread1of1ForFork1_~lb~0=v_my_callbackThread1of1ForFork1_~lb~0_13, #memory_int=|v_#memory_int_76|, my_callbackThread1of1ForFork1_#res.offset=|v_my_callbackThread1of1ForFork1_#res.offset_11|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_47|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#res.base, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork1_#res.offset, #memory_$Pointer$.offset] [2022-12-05 23:23:32,943 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:23:32,944 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 370 [2022-12-05 23:23:32,944 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 70 transitions, 643 flow [2022-12-05 23:23:32,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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:23:32,944 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:32,944 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:32,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:23:32,944 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-05 23:23:32,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:32,945 INFO L85 PathProgramCache]: Analyzing trace with hash -667738993, now seen corresponding path program 3 times [2022-12-05 23:23:32,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:32,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105708653] [2022-12-05 23:23:32,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:32,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:34,210 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:23:34,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:34,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105708653] [2022-12-05 23:23:34,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105708653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:34,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:34,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-05 23:23:34,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362447878] [2022-12-05 23:23:34,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:34,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-05 23:23:34,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:34,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-05 23:23:34,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-12-05 23:23:34,211 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:23:34,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 70 transitions, 643 flow. Second operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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:23:34,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:34,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:23:34,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:35,277 INFO L130 PetriNetUnfolder]: 176/447 cut-off events. [2022-12-05 23:23:35,277 INFO L131 PetriNetUnfolder]: For 2049/2049 co-relation queries the response was YES. [2022-12-05 23:23:35,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2115 conditions, 447 events. 176/447 cut-off events. For 2049/2049 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2486 event pairs, 66 based on Foata normal form. 2/443 useless extension candidates. Maximal degree in co-relation 1882. Up to 330 conditions per place. [2022-12-05 23:23:35,281 INFO L137 encePairwiseOnDemand]: 5/20 looper letters, 82 selfloop transitions, 38 changer transitions 12/132 dead transitions. [2022-12-05 23:23:35,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 132 transitions, 1376 flow [2022-12-05 23:23:35,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-05 23:23:35,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-05 23:23:35,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 88 transitions. [2022-12-05 23:23:35,283 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.275 [2022-12-05 23:23:35,283 INFO L175 Difference]: Start difference. First operand has 69 places, 70 transitions, 643 flow. Second operand 16 states and 88 transitions. [2022-12-05 23:23:35,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 132 transitions, 1376 flow [2022-12-05 23:23:35,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 132 transitions, 1288 flow, removed 32 selfloop flow, removed 6 redundant places. [2022-12-05 23:23:35,294 INFO L231 Difference]: Finished difference. Result has 91 places, 96 transitions, 1021 flow [2022-12-05 23:23:35,294 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1021, PETRI_PLACES=91, PETRI_TRANSITIONS=96} [2022-12-05 23:23:35,294 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 60 predicate places. [2022-12-05 23:23:35,294 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:35,295 INFO L89 Accepts]: Start accepts. Operand has 91 places, 96 transitions, 1021 flow [2022-12-05 23:23:35,296 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:35,296 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:35,296 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 96 transitions, 1021 flow [2022-12-05 23:23:35,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 96 transitions, 1021 flow [2022-12-05 23:23:35,325 INFO L130 PetriNetUnfolder]: 43/214 cut-off events. [2022-12-05 23:23:35,326 INFO L131 PetriNetUnfolder]: For 949/955 co-relation queries the response was YES. [2022-12-05 23:23:35,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 973 conditions, 214 events. 43/214 cut-off events. For 949/955 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1281 event pairs, 2 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 911. Up to 57 conditions per place. [2022-12-05 23:23:35,328 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 96 transitions, 1021 flow [2022-12-05 23:23:35,328 INFO L188 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-05 23:23:35,366 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:35,367 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:35,368 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:35,371 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:35,373 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:35,373 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:23:35,374 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [320] L1693-->L1697: Formula: (= (select (select |v_#memory_int_34| v_my_callbackThread1of1ForFork0_~data~0.base_7) (+ v_my_callbackThread1of1ForFork0_~data~0.offset_7 28)) v_my_callbackThread1of1ForFork0_~lb~0_1) InVars {#memory_int=|v_#memory_int_34|, 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_34|, 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 [455] L1720-1-->L1721: Formula: (and (= (store |v_#memory_$Pointer$.offset_223| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_45| (store (select |v_#memory_$Pointer$.offset_223| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_45|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_43| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.offset_21|)) |v_#memory_$Pointer$.offset_222|) (= (store |v_#memory_$Pointer$.base_223| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_45| (store (select |v_#memory_$Pointer$.base_223| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_45|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_43| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.base_21|)) |v_#memory_$Pointer$.base_222|) (= (store |v_#memory_int_269| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_45| (store (select |v_#memory_int_269| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_45|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_43| (select (select |v_#memory_int_268| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_45|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_43|))) |v_#memory_int_268|)) InVars {ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.offset_21|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_43|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_223|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_45|, #memory_int=|v_#memory_int_269|, ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.base_21|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_223|} OutVars{ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_43|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_222|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_45|, ULTIMATE.start_my_drv_disconnect_#t~mem13#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem13#1_22|, #memory_int=|v_#memory_int_268|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_222|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.offset, #memory_$Pointer$.base, ULTIMATE.start_my_drv_disconnect_#t~mem13#1, #memory_int, ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.base, #memory_$Pointer$.offset] [2022-12-05 23:23:35,466 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:23:35,467 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2022-12-05 23:23:35,471 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [455] L1720-1-->L1721: Formula: (and (= (store |v_#memory_$Pointer$.offset_223| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_45| (store (select |v_#memory_$Pointer$.offset_223| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_45|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_43| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.offset_21|)) |v_#memory_$Pointer$.offset_222|) (= (store |v_#memory_$Pointer$.base_223| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_45| (store (select |v_#memory_$Pointer$.base_223| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_45|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_43| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.base_21|)) |v_#memory_$Pointer$.base_222|) (= (store |v_#memory_int_269| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_45| (store (select |v_#memory_int_269| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_45|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_43| (select (select |v_#memory_int_268| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_45|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_43|))) |v_#memory_int_268|)) InVars {ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.offset_21|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_43|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_223|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_45|, #memory_int=|v_#memory_int_269|, ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.base_21|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_223|} OutVars{ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_43|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_222|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_45|, ULTIMATE.start_my_drv_disconnect_#t~mem13#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem13#1_22|, #memory_int=|v_#memory_int_268|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_222|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.offset, #memory_$Pointer$.base, ULTIMATE.start_my_drv_disconnect_#t~mem13#1, #memory_int, ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.base, #memory_$Pointer$.offset] and [477] L1721-2-->ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#memory_int_400| |v_ULTIMATE.start_main_~#data~1#1.base_147|))) (and (= |v_#valid_116| (store |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56| 0)) (= |v_#memory_$Pointer$.base_362| (store |v_#memory_$Pointer$.base_363| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56| (store (select |v_#memory_$Pointer$.base_363| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_54| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base_43|))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_117| (ite (= |v_ULTIMATE.start_main_#t~mem20#1_55| 2) 1 0)) (= |v_ULTIMATE.start_ldv_assert_~expression#1_121| 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_147| 28)) |v_ULTIMATE.start_main_#t~mem20#1_55|) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_117| |v_ULTIMATE.start_ldv_assert_~expression#1_121|) (= (store |v_#memory_int_401| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56| (store (select |v_#memory_int_401| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_54| (select (select |v_#memory_int_400| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_54|))) |v_#memory_int_400|) (not (= (ite (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_147| 24)) 1) 1 0) 0)) (= (store |v_#memory_$Pointer$.offset_363| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56| (store (select |v_#memory_$Pointer$.offset_363| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_54| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset_43|)) |v_#memory_$Pointer$.offset_362|))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_54|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_363|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56|, #valid=|v_#valid_117|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_147|, #memory_int=|v_#memory_int_401|, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset_43|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_363|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_147|, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base_43|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem15#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem15#1_32|, ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_121|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_362|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_147|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_117|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_55|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_65|, #valid=|v_#valid_116|, #memory_int=|v_#memory_int_400|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_362|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_147|} AuxVars[] 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_ldv_assert_#in~expression#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, #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:23:35,603 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:23:35,604 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 310 [2022-12-05 23:23:35,604 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 95 transitions, 1032 flow [2022-12-05 23:23:35,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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:23:35,604 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:35,604 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:35,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:23:35,604 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-05 23:23:35,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:35,605 INFO L85 PathProgramCache]: Analyzing trace with hash -485749491, now seen corresponding path program 1 times [2022-12-05 23:23:35,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:35,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402809220] [2022-12-05 23:23:35,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:35,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:23:36,381 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:23:36,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:23:36,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402809220] [2022-12-05 23:23:36,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402809220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:23:36,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:23:36,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 23:23:36,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484027113] [2022-12-05 23:23:36,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:23:36,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 23:23:36,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:23:36,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 23:23:36,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-05 23:23:36,383 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-05 23:23:36,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 95 transitions, 1032 flow. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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:23:36,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:23:36,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-05 23:23:36,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:23:36,978 INFO L130 PetriNetUnfolder]: 223/590 cut-off events. [2022-12-05 23:23:36,978 INFO L131 PetriNetUnfolder]: For 2651/2651 co-relation queries the response was YES. [2022-12-05 23:23:36,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2863 conditions, 590 events. 223/590 cut-off events. For 2651/2651 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3688 event pairs, 79 based on Foata normal form. 0/584 useless extension candidates. Maximal degree in co-relation 2783. Up to 284 conditions per place. [2022-12-05 23:23:36,983 INFO L137 encePairwiseOnDemand]: 9/23 looper letters, 100 selfloop transitions, 53 changer transitions 4/157 dead transitions. [2022-12-05 23:23:36,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 157 transitions, 1854 flow [2022-12-05 23:23:36,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 23:23:36,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 23:23:36,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2022-12-05 23:23:36,984 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2956521739130435 [2022-12-05 23:23:36,985 INFO L175 Difference]: Start difference. First operand has 88 places, 95 transitions, 1032 flow. Second operand 10 states and 68 transitions. [2022-12-05 23:23:36,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 157 transitions, 1854 flow [2022-12-05 23:23:36,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 157 transitions, 1818 flow, removed 17 selfloop flow, removed 4 redundant places. [2022-12-05 23:23:37,000 INFO L231 Difference]: Finished difference. Result has 98 places, 115 transitions, 1377 flow [2022-12-05 23:23:37,000 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1377, PETRI_PLACES=98, PETRI_TRANSITIONS=115} [2022-12-05 23:23:37,000 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 67 predicate places. [2022-12-05 23:23:37,000 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:23:37,001 INFO L89 Accepts]: Start accepts. Operand has 98 places, 115 transitions, 1377 flow [2022-12-05 23:23:37,002 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:23:37,002 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:23:37,002 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 115 transitions, 1377 flow [2022-12-05 23:23:37,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 115 transitions, 1377 flow [2022-12-05 23:23:37,042 INFO L130 PetriNetUnfolder]: 59/306 cut-off events. [2022-12-05 23:23:37,042 INFO L131 PetriNetUnfolder]: For 1805/1827 co-relation queries the response was YES. [2022-12-05 23:23:37,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1465 conditions, 306 events. 59/306 cut-off events. For 1805/1827 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2130 event pairs, 8 based on Foata normal form. 5/303 useless extension candidates. Maximal degree in co-relation 1390. Up to 89 conditions per place. [2022-12-05 23:23:37,046 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 115 transitions, 1377 flow [2022-12-05 23:23:37,046 INFO L188 LiptonReduction]: Number of co-enabled transitions 158 [2022-12-05 23:23:37,055 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] $Ultimate##0-->L1697: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_123 24))) (and (= v_my_callbackThread1of1ForFork1_~dev~0.base_43 v_my_callbackThread1of1ForFork1_~arg.base_39) (= |v_#memory_$Pointer$.offset_597| (store |v_#memory_$Pointer$.offset_598| v_my_callbackThread1of1ForFork1_~data~0.base_123 (store (select |v_#memory_$Pointer$.offset_598| v_my_callbackThread1of1ForFork1_~data~0.base_123) .cse0 (select (select |v_#memory_$Pointer$.offset_597| v_my_callbackThread1of1ForFork1_~data~0.base_123) .cse0)))) (= v_my_callbackThread1of1ForFork1_~arg.offset_39 v_my_callbackThread1of1ForFork1_~dev~0.offset_43) (= (store |v_#memory_int_645| v_my_callbackThread1of1ForFork1_~data~0.base_123 (store (select |v_#memory_int_645| v_my_callbackThread1of1ForFork1_~data~0.base_123) .cse0 1)) |v_#memory_int_644|) (= v_my_callbackThread1of1ForFork1_~lb~0_57 (select (select |v_#memory_int_644| v_my_callbackThread1of1ForFork1_~data~0.base_123) (+ v_my_callbackThread1of1ForFork1_~data~0.offset_123 28))) (= v_my_callbackThread1of1ForFork1_~arg.offset_39 |v_my_callbackThread1of1ForFork1_#in~arg.offset_47|) (= v_my_callbackThread1of1ForFork1_~__mptr~0.offset_41 .cse0) (= v_my_callbackThread1of1ForFork1_~data~0.base_123 v_my_callbackThread1of1ForFork1_~__mptr~0.base_41) (= v_my_callbackThread1of1ForFork1_~arg.base_39 |v_my_callbackThread1of1ForFork1_#in~arg.base_47|) (= (store |v_#memory_$Pointer$.base_598| v_my_callbackThread1of1ForFork1_~data~0.base_123 (store (select |v_#memory_$Pointer$.base_598| v_my_callbackThread1of1ForFork1_~data~0.base_123) .cse0 (select (select |v_#memory_$Pointer$.base_597| v_my_callbackThread1of1ForFork1_~data~0.base_123) .cse0))) |v_#memory_$Pointer$.base_597|) (= v_my_callbackThread1of1ForFork1_~dev~0.offset_43 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_41) (= v_my_callbackThread1of1ForFork1_~dev~0.base_43 v_my_callbackThread1of1ForFork1_~__mptr~0.base_41))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_47|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_598|, #memory_int=|v_#memory_int_645|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_598|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_47|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_597|, my_callbackThread1of1ForFork1_~lb~0=v_my_callbackThread1of1ForFork1_~lb~0_57, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_39, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_41, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_47|, my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_47|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_123, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_123, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_39, my_callbackThread1of1ForFork1_#t~mem7=|v_my_callbackThread1of1ForFork1_#t~mem7_34|, #memory_int=|v_#memory_int_644|, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_41, my_callbackThread1of1ForFork1_~dev~0.offset=v_my_callbackThread1of1ForFork1_~dev~0.offset_43, my_callbackThread1of1ForFork1_~dev~0.base=v_my_callbackThread1of1ForFork1_~dev~0.base_43, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_597|} AuxVars[] AssignedVars[#memory_$Pointer$.base, my_callbackThread1of1ForFork1_~lb~0, my_callbackThread1of1ForFork1_~arg.base, my_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, my_callbackThread1of1ForFork1_#t~mem7, #memory_int, my_callbackThread1of1ForFork1_~__mptr~0.base, my_callbackThread1of1ForFork1_~dev~0.offset, my_callbackThread1of1ForFork1_~dev~0.base, #memory_$Pointer$.offset] and [399] L1711-4-->L1712-3: Formula: (and (= |v_#memory_int_104| (store |v_#memory_int_105| |v_~#t2~0.base_9| (store (select |v_#memory_int_105| |v_~#t2~0.base_9|) |v_~#t2~0.offset_9| |v_ULTIMATE.start_my_drv_probe_#t~pre11#1_17|))) (= (store |v_#memory_$Pointer$.offset_72| |v_~#t2~0.base_9| (store (select |v_#memory_$Pointer$.offset_72| |v_~#t2~0.base_9|) |v_~#t2~0.offset_9| (select (select |v_#memory_$Pointer$.offset_71| |v_~#t2~0.base_9|) |v_~#t2~0.offset_9|))) |v_#memory_$Pointer$.offset_71|) (= |v_#pthreadsForks_24| |v_ULTIMATE.start_my_drv_probe_#t~pre11#1_17|) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_$Pointer$.base_72| |v_~#t2~0.base_9| (store (select |v_#memory_$Pointer$.base_72| |v_~#t2~0.base_9|) |v_~#t2~0.offset_9| (select (select |v_#memory_$Pointer$.base_71| |v_~#t2~0.base_9|) |v_~#t2~0.offset_9|))) |v_#memory_$Pointer$.base_71|)) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_72|, #pthreadsForks=|v_#pthreadsForks_24|, ~#t2~0.offset=|v_~#t2~0.offset_9|, #memory_int=|v_#memory_int_105|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_72|, ~#t2~0.base=|v_~#t2~0.base_9|} OutVars{ULTIMATE.start_my_drv_probe_#t~pre9#1=|v_ULTIMATE.start_my_drv_probe_#t~pre9#1_17|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_71|, #pthreadsForks=|v_#pthreadsForks_23|, ~#t2~0.offset=|v_~#t2~0.offset_9|, #memory_int=|v_#memory_int_104|, ULTIMATE.start_my_drv_probe_#t~nondet10#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet10#1_11|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_71|, ULTIMATE.start_my_drv_probe_#t~pre11#1=|v_ULTIMATE.start_my_drv_probe_#t~pre11#1_17|, ~#t2~0.base=|v_~#t2~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#t~pre9#1, #memory_$Pointer$.base, #pthreadsForks, #memory_int, ULTIMATE.start_my_drv_probe_#t~nondet10#1, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_probe_#t~pre11#1] [2022-12-05 23:23:37,291 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [480] L1712-4-->L1720: Formula: (and (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_71| 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_37| 0) (= (store |v_#length_92| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_73| 4) |v_#length_91|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_193| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_19|) (= (store |v_#valid_137| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_73| 1) |v_#valid_136|) (= (select (select |v_#memory_int_530| |v_~#t1~0.base_41|) |v_~#t1~0.offset_41|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem13#1_32|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_74| 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_73| 0)) (= |v_ULTIMATE.start_main_~#data~1#1.base_193| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_19|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_19| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_19|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_19| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_19|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_73|) (= (select |v_#valid_137| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_73|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_42|, ~#t1~0.base=|v_~#t1~0.base_41|, #valid=|v_#valid_137|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_193|, #memory_int=|v_#memory_int_530|, ~#t1~0.offset=|v_~#t1~0.offset_41|, #length=|v_#length_92|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_193|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem15#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem15#1_44|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_73|, ~#t1~0.offset=|v_~#t1~0.offset_41|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_19|, ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.offset_36|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_37|, ~#t1~0.base=|v_~#t1~0.base_41|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_74|, #length=|v_#length_91|, ULTIMATE.start_my_drv_probe_#t~pre11#1=|v_ULTIMATE.start_my_drv_probe_#t~pre11#1_45|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_19|, ULTIMATE.start_my_drv_probe_#t~nondet12#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet12#1_29|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_19|, ULTIMATE.start_my_drv_disconnect_#t~mem13#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem13#1_32|, ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.base_36|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_193|, ULTIMATE.start_main_#t~ret18#1=|v_ULTIMATE.start_main_#t~ret18#1_92|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_71|, #StackHeapBarrier=|v_#StackHeapBarrier_42|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_19|, #valid=|v_#valid_136|, #memory_int=|v_#memory_int_530|, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset_58|, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base_58|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_193|} 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~nondet12#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~mem13#1, ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.base, ULTIMATE.start_main_#t~ret18#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.offset, 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~nondet16#1.offset, ULTIMATE.start_my_drv_probe_#t~pre11#1, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base] and [456] $Ultimate##0-->L1693: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_35 24))) (and (= v_my_callbackThread1of1ForFork0_~dev~0.offset_15 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_15) (= v_my_callbackThread1of1ForFork0_~arg.base_11 |v_my_callbackThread1of1ForFork0_#in~arg.base_9|) (= (store |v_#memory_int_273| v_my_callbackThread1of1ForFork0_~data~0.base_35 (store (select |v_#memory_int_273| v_my_callbackThread1of1ForFork0_~data~0.base_35) .cse0 1)) |v_#memory_int_272|) (= v_my_callbackThread1of1ForFork0_~arg.offset_11 |v_my_callbackThread1of1ForFork0_#in~arg.offset_9|) (= v_my_callbackThread1of1ForFork0_~dev~0.base_15 v_my_callbackThread1of1ForFork0_~__mptr~0.base_15) (= v_my_callbackThread1of1ForFork0_~data~0.base_35 v_my_callbackThread1of1ForFork0_~__mptr~0.base_15) (= (store |v_#memory_$Pointer$.offset_227| v_my_callbackThread1of1ForFork0_~data~0.base_35 (store (select |v_#memory_$Pointer$.offset_227| v_my_callbackThread1of1ForFork0_~data~0.base_35) .cse0 (select (select |v_#memory_$Pointer$.offset_226| v_my_callbackThread1of1ForFork0_~data~0.base_35) .cse0))) |v_#memory_$Pointer$.offset_226|) (= v_my_callbackThread1of1ForFork0_~arg.offset_11 v_my_callbackThread1of1ForFork0_~dev~0.offset_15) (= v_my_callbackThread1of1ForFork0_~dev~0.base_15 v_my_callbackThread1of1ForFork0_~arg.base_11) (= (store |v_#memory_$Pointer$.base_227| v_my_callbackThread1of1ForFork0_~data~0.base_35 (store (select |v_#memory_$Pointer$.base_227| v_my_callbackThread1of1ForFork0_~data~0.base_35) .cse0 (select (select |v_#memory_$Pointer$.base_226| v_my_callbackThread1of1ForFork0_~data~0.base_35) .cse0))) |v_#memory_$Pointer$.base_226|) (= .cse0 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_15))) InVars {my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_9|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_227|, #memory_int=|v_#memory_int_273|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_227|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_226|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_11, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_9|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_15, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_35, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_35, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_9|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_11, #memory_int=|v_#memory_int_272|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_15, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_15, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_15, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_226|} 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_~dev~0.base, my_callbackThread1of1ForFork0_~data~0.base, my_callbackThread1of1ForFork0_~dev~0.offset, #memory_$Pointer$.offset] [2022-12-05 23:23:37,530 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [477] L1721-2-->ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#memory_int_400| |v_ULTIMATE.start_main_~#data~1#1.base_147|))) (and (= |v_#valid_116| (store |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56| 0)) (= |v_#memory_$Pointer$.base_362| (store |v_#memory_$Pointer$.base_363| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56| (store (select |v_#memory_$Pointer$.base_363| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_54| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base_43|))) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_117| (ite (= |v_ULTIMATE.start_main_#t~mem20#1_55| 2) 1 0)) (= |v_ULTIMATE.start_ldv_assert_~expression#1_121| 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_147| 28)) |v_ULTIMATE.start_main_#t~mem20#1_55|) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_117| |v_ULTIMATE.start_ldv_assert_~expression#1_121|) (= (store |v_#memory_int_401| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56| (store (select |v_#memory_int_401| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_54| (select (select |v_#memory_int_400| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_54|))) |v_#memory_int_400|) (not (= (ite (= (select .cse0 (+ |v_ULTIMATE.start_main_~#data~1#1.offset_147| 24)) 1) 1 0) 0)) (= (store |v_#memory_$Pointer$.offset_363| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56| (store (select |v_#memory_$Pointer$.offset_363| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56|) |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_54| |v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset_43|)) |v_#memory_$Pointer$.offset_362|))) InVars {ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_54|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_363|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_56|, #valid=|v_#valid_117|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_147|, #memory_int=|v_#memory_int_401|, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset_43|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_363|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_147|, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base_43|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem15#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem15#1_32|, ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_121|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_362|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_147|, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_117|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_55|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_65|, #valid=|v_#valid_116|, #memory_int=|v_#memory_int_400|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_362|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_147|} AuxVars[] 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_ldv_assert_#in~expression#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, #valid, #memory_int, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base] and [480] L1712-4-->L1720: Formula: (and (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_71| 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_37| 0) (= (store |v_#length_92| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_73| 4) |v_#length_91|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_193| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_19|) (= (store |v_#valid_137| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_73| 1) |v_#valid_136|) (= (select (select |v_#memory_int_530| |v_~#t1~0.base_41|) |v_~#t1~0.offset_41|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem13#1_32|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_74| 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_73| 0)) (= |v_ULTIMATE.start_main_~#data~1#1.base_193| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_19|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_19| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_19|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_19| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_19|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_73|) (= (select |v_#valid_137| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_73|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_42|, ~#t1~0.base=|v_~#t1~0.base_41|, #valid=|v_#valid_137|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_193|, #memory_int=|v_#memory_int_530|, ~#t1~0.offset=|v_~#t1~0.offset_41|, #length=|v_#length_92|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_193|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem15#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem15#1_44|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_73|, ~#t1~0.offset=|v_~#t1~0.offset_41|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_19|, ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.offset_36|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_37|, ~#t1~0.base=|v_~#t1~0.base_41|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_74|, #length=|v_#length_91|, ULTIMATE.start_my_drv_probe_#t~pre11#1=|v_ULTIMATE.start_my_drv_probe_#t~pre11#1_45|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_19|, ULTIMATE.start_my_drv_probe_#t~nondet12#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet12#1_29|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_19|, ULTIMATE.start_my_drv_disconnect_#t~mem13#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem13#1_32|, ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.base_36|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_193|, ULTIMATE.start_main_#t~ret18#1=|v_ULTIMATE.start_main_#t~ret18#1_92|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_71|, #StackHeapBarrier=|v_#StackHeapBarrier_42|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_19|, #valid=|v_#valid_136|, #memory_int=|v_#memory_int_530|, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset_58|, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base_58|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_193|} 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~nondet12#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~mem13#1, ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.base, ULTIMATE.start_main_#t~ret18#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.offset, 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~nondet16#1.offset, ULTIMATE.start_my_drv_probe_#t~pre11#1, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base] [2022-12-05 23:23:37,730 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [492] L1693-->my_callbackEXIT: Formula: (let ((.cse0 (select |v_#memory_int_809| v_my_callbackThread1of1ForFork0_~data~0.base_185)) (.cse1 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_185 28))) (and (= (store |v_#memory_int_809| v_my_callbackThread1of1ForFork0_~data~0.base_185 (store .cse0 .cse1 (+ v_my_callbackThread1of1ForFork0_~lb~0_133 1))) |v_#memory_int_808|) (= v_my_callbackThread1of1ForFork0_~lb~0_133 (select .cse0 .cse1)) (= |v_my_callbackThread1of1ForFork0_#res.base_73| 0) (= |v_my_callbackThread1of1ForFork0_#res.offset_73| 0) (= (store |v_#memory_$Pointer$.base_754| v_my_callbackThread1of1ForFork0_~data~0.base_185 (store (select |v_#memory_$Pointer$.base_754| v_my_callbackThread1of1ForFork0_~data~0.base_185) .cse1 (select (select |v_#memory_$Pointer$.base_753| v_my_callbackThread1of1ForFork0_~data~0.base_185) .cse1))) |v_#memory_$Pointer$.base_753|) (= (store |v_#memory_$Pointer$.offset_754| v_my_callbackThread1of1ForFork0_~data~0.base_185 (store (select |v_#memory_$Pointer$.offset_754| v_my_callbackThread1of1ForFork0_~data~0.base_185) .cse1 (select (select |v_#memory_$Pointer$.offset_753| v_my_callbackThread1of1ForFork0_~data~0.base_185) .cse1))) |v_#memory_$Pointer$.offset_753|))) InVars {my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_185, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_754|, #memory_int=|v_#memory_int_809|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_185, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_754|} OutVars{my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_185, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_73|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_753|, my_callbackThread1of1ForFork0_~lb~0=v_my_callbackThread1of1ForFork0_~lb~0_133, my_callbackThread1of1ForFork0_#t~mem7=|v_my_callbackThread1of1ForFork0_#t~mem7_63|, #memory_int=|v_#memory_int_808|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_73|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_185, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_753|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork0_#res.base, #memory_$Pointer$.base, my_callbackThread1of1ForFork0_~lb~0, my_callbackThread1of1ForFork0_#t~mem7, #memory_int, my_callbackThread1of1ForFork0_#res.offset, #memory_$Pointer$.offset] and [480] L1712-4-->L1720: Formula: (and (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_71| 0) (= |v_ULTIMATE.start_my_drv_probe_#res#1_37| 0) (= (store |v_#length_92| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_73| 4) |v_#length_91|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_193| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_19|) (= (store |v_#valid_137| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_73| 1) |v_#valid_136|) (= (select (select |v_#memory_int_530| |v_~#t1~0.base_41|) |v_~#t1~0.offset_41|) |v_ULTIMATE.start_my_drv_disconnect_#t~mem13#1_32|) (= |v_ULTIMATE.start_main_~probe_ret~0#1_74| 0) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_73| 0)) (= |v_ULTIMATE.start_main_~#data~1#1.base_193| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_19|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_19| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_19|) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_19| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_19|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_73|) (= (select |v_#valid_137| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_73|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_42|, ~#t1~0.base=|v_~#t1~0.base_41|, #valid=|v_#valid_137|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_193|, #memory_int=|v_#memory_int_530|, ~#t1~0.offset=|v_~#t1~0.offset_41|, #length=|v_#length_92|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_193|} OutVars{ULTIMATE.start_my_drv_disconnect_#t~mem15#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem15#1_44|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_73|, ~#t1~0.offset=|v_~#t1~0.offset_41|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_19|, ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.offset_36|, ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_37|, ~#t1~0.base=|v_~#t1~0.base_41|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_74|, #length=|v_#length_91|, ULTIMATE.start_my_drv_probe_#t~pre11#1=|v_ULTIMATE.start_my_drv_probe_#t~pre11#1_45|, ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_19|, ULTIMATE.start_my_drv_probe_#t~nondet12#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet12#1_29|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_19|, ULTIMATE.start_my_drv_disconnect_#t~mem13#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem13#1_32|, ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.base_36|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_193|, ULTIMATE.start_main_#t~ret18#1=|v_ULTIMATE.start_main_#t~ret18#1_92|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_71|, #StackHeapBarrier=|v_#StackHeapBarrier_42|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_19|, #valid=|v_#valid_136|, #memory_int=|v_#memory_int_530|, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.offset_58|, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base_58|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_193|} 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~nondet12#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~mem13#1, ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.base, ULTIMATE.start_main_#t~ret18#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet14#1.offset, 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~nondet16#1.offset, ULTIMATE.start_my_drv_probe_#t~pre11#1, ULTIMATE.start_my_drv_disconnect_#t~nondet16#1.base] [2022-12-05 23:23:37,892 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:23:37,893 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 893 [2022-12-05 23:23:37,893 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 115 transitions, 1419 flow [2022-12-05 23:23:37,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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:23:37,893 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:23:37,893 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:37,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:23:37,893 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-05 23:23:37,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:23:37,894 INFO L85 PathProgramCache]: Analyzing trace with hash -485749467, now seen corresponding path program 1 times [2022-12-05 23:23:37,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:23:37,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656829368] [2022-12-05 23:23:37,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:23:37,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:23:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:23:37,936 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 23:23:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:23:37,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 23:23:37,978 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 23:23:37,978 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 23:23:37,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 23:23:37,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2022-12-05 23:23:37,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-12-05 23:23:37,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 23:23:37,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2022-12-05 23:23:37,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 23:23:37,981 INFO L458 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:23:37,985 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:23:37,985 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:23:38,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:23:38 BasicIcfg [2022-12-05 23:23:38,046 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:23:38,046 INFO L158 Benchmark]: Toolchain (without parser) took 71942.66ms. Allocated memory was 167.8MB in the beginning and 420.5MB in the end (delta: 252.7MB). Free memory was 131.5MB in the beginning and 318.9MB in the end (delta: -187.4MB). Peak memory consumption was 66.2MB. Max. memory is 8.0GB. [2022-12-05 23:23:38,046 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 167.8MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:23:38,047 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1071.37ms. Allocated memory is still 167.8MB. Free memory was 131.5MB in the beginning and 120.8MB in the end (delta: 10.7MB). Peak memory consumption was 43.1MB. Max. memory is 8.0GB. [2022-12-05 23:23:38,047 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.89ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 117.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 23:23:38,047 INFO L158 Benchmark]: Boogie Preprocessor took 65.38ms. Allocated memory is still 167.8MB. Free memory was 117.6MB in the beginning and 115.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:23:38,048 INFO L158 Benchmark]: RCFGBuilder took 579.24ms. Allocated memory is still 167.8MB. Free memory was 115.0MB in the beginning and 127.3MB in the end (delta: -12.2MB). Peak memory consumption was 20.3MB. Max. memory is 8.0GB. [2022-12-05 23:23:38,048 INFO L158 Benchmark]: TraceAbstraction took 70134.33ms. Allocated memory was 167.8MB in the beginning and 420.5MB in the end (delta: 252.7MB). Free memory was 126.2MB in the beginning and 318.9MB in the end (delta: -192.7MB). Peak memory consumption was 60.5MB. Max. memory is 8.0GB. [2022-12-05 23:23:38,054 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 167.8MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1071.37ms. Allocated memory is still 167.8MB. Free memory was 131.5MB in the beginning and 120.8MB in the end (delta: 10.7MB). Peak memory consumption was 43.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 86.89ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 117.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 65.38ms. Allocated memory is still 167.8MB. Free memory was 117.6MB in the beginning and 115.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 579.24ms. Allocated memory is still 167.8MB. Free memory was 115.0MB in the beginning and 127.3MB in the end (delta: -12.2MB). Peak memory consumption was 20.3MB. Max. memory is 8.0GB. * TraceAbstraction took 70134.33ms. Allocated memory was 167.8MB in the beginning and 420.5MB in the end (delta: 252.7MB). Free memory was 126.2MB in the beginning and 318.9MB in the end (delta: -192.7MB). Peak memory consumption was 60.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 50.2s, 136 PlacesBefore, 31 PlacesAfterwards, 134 TransitionsBefore, 27 TransitionsAfterwards, 1780 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 60 TrivialYvCompositions, 45 ConcurrentYvCompositions, 2 ChoiceCompositions, 110 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1069, independent: 1002, independent conditional: 1002, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 32, unknown conditional: 32, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1069, independent: 1002, independent conditional: 0, independent unconditional: 1002, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 32, unknown conditional: 0, unknown unconditional: 32] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1069, independent: 1002, independent conditional: 0, independent unconditional: 1002, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 32, unknown conditional: 0, unknown unconditional: 32] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1069, independent: 1002, independent conditional: 0, independent unconditional: 1002, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 32, unknown conditional: 0, unknown unconditional: 32] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 987, independent: 951, independent conditional: 0, independent unconditional: 951, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 987, independent: 947, independent conditional: 0, independent unconditional: 947, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 40, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37194, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 468, dependent conditional: 0, dependent unconditional: 468, unknown: 36724, unknown conditional: 0, unknown unconditional: 36724] ], Cache Queries: [ total: 1069, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 1002, unknown conditional: 0, unknown unconditional: 1002] , Statistics on independence cache: Total cache size (in pairs): 1565, Positive cache size: 1546, Positive conditional cache size: 0, Positive unconditional cache size: 1546, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 17, Unknown conditional cache size: 0, Unknown unconditional cache size: 17, 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: 35, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 35, dependent conditional: 0, dependent unconditional: 35, 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: 0.0s, 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: 23, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 23, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 14, dependent conditional: 3, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 14, dependent conditional: 3, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 14, dependent conditional: 3, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 3, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 3, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 10, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 23, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 7, unknown conditional: 3, 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: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.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: 123, independent: 71, independent conditional: 71, 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: 123, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 52, dependent conditional: 26, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 123, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 52, dependent conditional: 26, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 123, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 52, dependent conditional: 26, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 5, dependent conditional: 4, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 4, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 16, dependent conditional: 14, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 123, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 47, dependent conditional: 22, dependent unconditional: 25, unknown: 16, unknown conditional: 4, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, Negative cache size: 26, Negative conditional cache size: 7, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2240, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 2160, unknown conditional: 0, unknown unconditional: 2160] ], Cache Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, Negative cache size: 28, Negative conditional cache size: 7, Negative unconditional cache size: 21, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 31 PlacesBefore, 31 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 5, dependent conditional: 4, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 5, dependent conditional: 4, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 153, independent: 133, independent conditional: 133, independent unconditional: 0, dependent: 20, dependent conditional: 18, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 4, independent conditional: 3, independent unconditional: 1, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 8, unknown conditional: 5, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 26, Positive conditional cache size: 1, Positive unconditional cache size: 25, Negative cache size: 33, Negative conditional cache size: 11, Negative unconditional cache size: 22, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 45 PlacesBefore, 46 PlacesAfterwards, 40 TransitionsBefore, 41 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30, independent: 7, independent conditional: 5, independent unconditional: 2, dependent: 23, dependent conditional: 5, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 35, independent: 7, independent conditional: 5, independent unconditional: 2, dependent: 28, dependent conditional: 10, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35, independent: 7, independent conditional: 5, independent unconditional: 2, dependent: 28, dependent conditional: 10, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 2, independent unconditional: 0, 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: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 10, dependent conditional: 8, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 35, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 25, dependent conditional: 8, dependent unconditional: 17, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 29, Positive conditional cache size: 3, Positive unconditional cache size: 26, Negative cache size: 36, Negative conditional cache size: 13, Negative unconditional cache size: 23, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 60 PlacesBefore, 60 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 65, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 65, independent: 16, independent conditional: 12, independent unconditional: 4, dependent: 49, dependent conditional: 47, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 110, independent: 16, independent conditional: 12, independent unconditional: 4, dependent: 94, dependent conditional: 92, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 110, independent: 16, independent conditional: 12, independent unconditional: 4, dependent: 94, dependent conditional: 92, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 228, independent: 207, independent conditional: 207, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 110, independent: 13, independent conditional: 9, independent unconditional: 4, dependent: 88, dependent conditional: 86, dependent unconditional: 2, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 32, Positive conditional cache size: 6, Positive unconditional cache size: 26, Negative cache size: 42, Negative conditional cache size: 19, Negative unconditional cache size: 23, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 70 PlacesBefore, 69 PlacesAfterwards, 71 TransitionsBefore, 70 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 92, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 60, dependent conditional: 60, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 92, independent: 32, independent conditional: 20, independent unconditional: 12, dependent: 60, dependent conditional: 22, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 116, independent: 32, independent conditional: 20, independent unconditional: 12, dependent: 84, dependent conditional: 46, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 116, independent: 32, independent conditional: 20, independent unconditional: 12, dependent: 84, dependent conditional: 46, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 5, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 116, independent: 32, independent conditional: 20, independent unconditional: 12, dependent: 82, dependent conditional: 45, dependent unconditional: 37, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 32, Positive conditional cache size: 6, Positive unconditional cache size: 26, Negative cache size: 44, Negative conditional cache size: 20, Negative unconditional cache size: 24, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 89 PlacesBefore, 88 PlacesAfterwards, 96 TransitionsBefore, 95 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 48, dependent conditional: 46, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 102, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 100, dependent conditional: 98, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 100, dependent conditional: 98, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 102, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 93, dependent conditional: 91, dependent unconditional: 2, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 34, Positive conditional cache size: 7, Positive unconditional cache size: 27, Negative cache size: 51, Negative conditional cache size: 27, Negative unconditional cache size: 24, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 98 PlacesBefore, 98 PlacesAfterwards, 115 TransitionsBefore, 115 TransitionsAfterwards, 158 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 54, independent: 32, independent conditional: 18, independent unconditional: 14, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 74, independent: 32, independent conditional: 18, independent unconditional: 14, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 74, independent: 32, independent conditional: 18, independent unconditional: 14, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 74, independent: 29, independent conditional: 15, independent unconditional: 14, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 37, Positive conditional cache size: 10, Positive unconditional cache size: 27, Negative cache size: 56, Negative conditional cache size: 32, Negative unconditional cache size: 24, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 0, Maximal queried relation: 3 - CounterExampleResult [Line: 1675]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1676] 0 pthread_t t1,t2; [L1731] CALL, EXPR 0 my_drv_init() [L1725] 0 return 0; [L1731] RET, EXPR 0 my_drv_init() [L1731] 0 int ret = my_drv_init(); [L1732] COND TRUE 0 ret==0 [L1733] 0 int probe_ret; [L1734] 0 struct my_data data; [L1735] CALL, EXPR 0 my_drv_probe(&data) [L1704] 0 struct device *d = &data->dev; [L1706] 0 data->shared.a = 0 [L1707] 0 data->shared.b = 0 [L1708] 0 int res = __VERIFIER_nondet_int(); [L1709] COND FALSE 0 !(\read(res)) [L1711] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={6:24}, d={6:24}, data={6:0}, data={6:0}, pthread_create(&t1, ((void *)0), my_callback, (void *)d)=-2, res=0, t1={3:0}, t2={4:0}] [L1689] 1 struct device *dev = (struct device*)arg; [L1690] 1 struct my_data *data; [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L1691] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1693] 1 data->shared.a = 1 [L1696] EXPR 1 data->shared.b [L1696] 1 int lb = data->shared.b; [L1712] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [__mptr={6:24}, arg={6:24}, arg={6:24}, d={6:24}, data={6:0}, data={6:0}, data={6:0}, dev={6:24}, lb=0, pthread_create(&t2, ((void *)0), my_callback, (void *)d)=-1, res=0, t1={3:0}, t2={4:0}] [L1689] 2 struct device *dev = (struct device*)arg; [L1690] 2 struct my_data *data; [L1691] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L1691] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1693] 2 data->shared.a = 1 VAL [__mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}] [L1696] EXPR 2 data->shared.b [L1696] 2 int lb = data->shared.b; [L1713] 0 return 0; [L1735] RET, EXPR 0 my_drv_probe(&data) [L1735] 0 probe_ret = my_drv_probe(&data) [L1736] COND TRUE 0 probe_ret==0 [L1737] CALL 0 my_drv_disconnect(&data) [L1719] 0 void *status; [L1720] 0 \read(t1) [L1699] 0 data->shared.b = lb + 1 [L1701] 0 return 0; [L1720] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\read(t1)=-2, \result={0:0}, __mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, data={6:0}, data={6:0}, dev={6:24}, lb=0, pthread_join(t1, &status)={0:0}, status={5:0}, t1={3:0}, t2={4:0}] [L1699] 2 data->shared.b = lb + 1 [L1701] 2 return 0; [L1721] 0 \read(t2) VAL [\read(t2)=-1, \result={0:0}, __mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, data={6:0}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1={3:0}, t2={4:0}] [L1721] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\read(t2)=-1, \result={0:0}, __mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, data={6:0}, data={6:0}, dev={6:24}, lb=0, pthread_join(t2, &status)={0:0}, status={5:0}, t1={3:0}, t2={4:0}] [L1737] RET 0 my_drv_disconnect(&data) [L1738] EXPR 0 data.shared.a [L1738] CALL 0 ldv_assert(data.shared.a==1) [L1675] COND FALSE 0 !(!expression) [L1738] RET 0 ldv_assert(data.shared.a==1) [L1739] EXPR 0 data.shared.b [L1739] CALL 0 ldv_assert(data.shared.b==2) [L1675] COND TRUE 0 !expression [L1675] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, expression=0, lb=0, t1={3:0}, t2={4:0}] - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1712]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1711]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 153 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 70.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 50.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 301 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 301 mSDsluCounter, 23 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 205 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2394 IncrementalHoareTripleChecker+Invalid, 2599 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 205 mSolverCounterUnsat, 11 mSDtfsCounter, 2394 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1419occurred in iteration=10, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 2236 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 23:23:38,167 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...