/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 --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-2_5-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 01:21:14,963 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 01:21:14,965 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 01:21:14,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 01:21:14,990 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 01:21:14,993 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 01:21:14,995 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 01:21:14,998 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 01:21:15,002 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 01:21:15,006 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 01:21:15,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 01:21:15,008 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 01:21:15,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 01:21:15,008 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 01:21:15,009 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 01:21:15,010 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 01:21:15,010 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 01:21:15,011 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 01:21:15,012 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 01:21:15,013 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 01:21:15,014 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 01:21:15,015 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 01:21:15,015 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 01:21:15,017 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 01:21:15,019 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 01:21:15,019 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 01:21:15,019 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 01:21:15,020 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 01:21:15,020 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 01:21:15,021 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 01:21:15,021 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 01:21:15,021 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 01:21:15,022 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 01:21:15,022 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 01:21:15,023 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 01:21:15,023 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 01:21:15,023 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 01:21:15,024 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 01:21:15,024 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 01:21:15,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 01:21:15,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 01:21:15,031 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-06 01:21:15,060 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 01:21:15,060 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 01:21:15,061 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 01:21:15,061 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 01:21:15,061 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 01:21:15,061 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 01:21:15,061 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 01:21:15,062 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 01:21:15,062 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 01:21:15,062 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 01:21:15,062 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 01:21:15,062 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 01:21:15,062 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 01:21:15,062 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 01:21:15,062 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 01:21:15,062 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 01:21:15,062 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 01:21:15,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 01:21:15,063 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 01:21:15,063 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 01:21:15,063 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 01:21:15,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:21:15,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 01:21:15,063 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 01:21:15,063 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 01:21:15,063 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 01:21:15,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 01:21:15,064 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 01:21:15,064 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 01:21:15,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 01:21:15,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 01:21:15,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 01:21:15,359 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 01:21:15,359 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 01:21:15,360 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_5-container_of.i [2022-12-06 01:21:16,285 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 01:21:16,549 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 01:21:16,550 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i [2022-12-06 01:21:16,567 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bc10e7f2/492077497fc54fe393a5dc28b8ccac30/FLAG9a15ad0a3 [2022-12-06 01:21:16,580 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bc10e7f2/492077497fc54fe393a5dc28b8ccac30 [2022-12-06 01:21:16,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 01:21:16,582 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 01:21:16,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 01:21:16,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 01:21:16,586 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 01:21:16,586 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:21:16" (1/1) ... [2022-12-06 01:21:16,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21c94922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:21:16, skipping insertion in model container [2022-12-06 01:21:16,587 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:21:16" (1/1) ... [2022-12-06 01:21:16,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 01:21:16,649 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 01:21:16,785 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-06 01:21:17,235 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_5-container_of.i[75002,75015] [2022-12-06 01:21:17,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:21:17,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:21:17,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:21:17,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:21:17,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:21:17,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:21:17,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:21:17,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:21:17,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:21:17,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:21:17,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:21:17,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:21:17,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:21:17,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:21:17,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:21:17,286 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 01:21:17,303 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-06 01:21:17,339 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_5-container_of.i[75002,75015] [2022-12-06 01:21:17,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:21:17,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:21:17,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:21:17,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:21:17,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:21:17,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:21:17,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:21:17,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:21:17,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:21:17,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:21:17,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:21:17,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:21:17,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:21:17,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:21:17,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:21:17,425 INFO L208 MainTranslator]: Completed translation [2022-12-06 01:21:17,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:21:17 WrapperNode [2022-12-06 01:21:17,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 01:21:17,426 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 01:21:17,426 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 01:21:17,426 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 01:21:17,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:21:17" (1/1) ... [2022-12-06 01:21:17,459 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:21:17" (1/1) ... [2022-12-06 01:21:17,485 INFO L138 Inliner]: procedures = 469, calls = 63, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 143 [2022-12-06 01:21:17,485 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 01:21:17,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 01:21:17,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 01:21:17,487 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 01:21:17,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:21:17" (1/1) ... [2022-12-06 01:21:17,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:21:17" (1/1) ... [2022-12-06 01:21:17,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:21:17" (1/1) ... [2022-12-06 01:21:17,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:21:17" (1/1) ... [2022-12-06 01:21:17,507 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:21:17" (1/1) ... [2022-12-06 01:21:17,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:21:17" (1/1) ... [2022-12-06 01:21:17,511 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:21:17" (1/1) ... [2022-12-06 01:21:17,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:21:17" (1/1) ... [2022-12-06 01:21:17,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 01:21:17,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 01:21:17,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 01:21:17,517 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 01:21:17,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:21:17" (1/1) ... [2022-12-06 01:21:17,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:21:17,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:21:17,569 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-06 01:21:17,590 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-06 01:21:17,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 01:21:17,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 01:21:17,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 01:21:17,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 01:21:17,606 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 01:21:17,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 01:21:17,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-06 01:21:17,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 01:21:17,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 01:21:17,607 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2022-12-06 01:21:17,607 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2022-12-06 01:21:17,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 01:21:17,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 01:21:17,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 01:21:17,608 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 01:21:17,870 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 01:21:17,871 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 01:21:18,099 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 01:21:18,139 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 01:21:18,140 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 01:21:18,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:21:18 BoogieIcfgContainer [2022-12-06 01:21:18,144 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 01:21:18,145 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 01:21:18,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 01:21:18,148 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 01:21:18,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 01:21:16" (1/3) ... [2022-12-06 01:21:18,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71011948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:21:18, skipping insertion in model container [2022-12-06 01:21:18,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:21:17" (2/3) ... [2022-12-06 01:21:18,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71011948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:21:18, skipping insertion in model container [2022-12-06 01:21:18,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:21:18" (3/3) ... [2022-12-06 01:21:18,150 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_5-container_of.i [2022-12-06 01:21:18,162 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 01:21:18,163 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-12-06 01:21:18,163 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 01:21:18,213 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 01:21:18,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 158 transitions, 332 flow [2022-12-06 01:21:18,316 INFO L130 PetriNetUnfolder]: 8/196 cut-off events. [2022-12-06 01:21:18,316 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 01:21:18,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 196 events. 8/196 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 344 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 103. Up to 4 conditions per place. [2022-12-06 01:21:18,321 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 158 transitions, 332 flow [2022-12-06 01:21:18,324 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 146 transitions, 304 flow [2022-12-06 01:21:18,325 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:21:18,336 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 146 transitions, 304 flow [2022-12-06 01:21:18,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 146 transitions, 304 flow [2022-12-06 01:21:18,363 INFO L130 PetriNetUnfolder]: 5/177 cut-off events. [2022-12-06 01:21:18,363 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 01:21:18,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 177 events. 5/177 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 292 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 93. Up to 4 conditions per place. [2022-12-06 01:21:18,366 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 146 transitions, 304 flow [2022-12-06 01:21:18,366 INFO L188 LiptonReduction]: Number of co-enabled transitions 2548 [2022-12-06 01:21:18,468 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:18,469 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:18,472 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:18,472 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:32,168 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:32,169 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:32,171 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:32,172 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:34,536 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:34,537 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:34,539 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:34,539 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:34,580 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:34,580 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:34,582 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:34,582 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:39,281 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:39,281 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:39,283 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:39,284 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:41,622 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:41,623 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:41,625 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:41,626 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:44,148 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:44,149 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:44,151 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:44,151 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:44,306 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:44,306 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:44,309 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:44,309 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:48,963 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:48,963 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:48,966 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:48,975 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:49,791 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:49,791 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:49,793 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:49,793 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:55,037 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:55,038 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2022-12-06 01:21:55,039 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:55,040 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2022-12-06 01:21:55,042 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:55,042 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:55,044 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:55,045 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:55,046 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:55,047 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:55,048 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:55,049 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:55,051 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:55,052 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:55,053 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:55,054 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:55,056 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:55,056 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:55,058 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:55,058 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:58,308 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:58,309 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-06 01:21:58,312 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:58,312 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:58,314 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:58,315 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-06 01:21:58,317 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:58,317 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:58,322 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:58,323 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:58,326 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:58,326 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:58,329 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:58,330 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-06 01:21:58,337 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:58,337 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:21:58,353 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:58,354 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-06 01:21:58,357 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:21:58,357 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:22:00,528 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:22:00,528 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:22:00,530 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:22:00,530 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:22:00,575 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:22:00,576 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:22:00,578 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:22:00,578 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:22:00,728 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:22:00,728 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-06 01:22:00,733 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:22:00,733 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2022-12-06 01:22:00,739 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:22:00,740 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:22:00,743 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:22:00,744 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-06 01:22:00,748 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:22:00,749 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2022-12-06 01:22:00,757 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:22:00,758 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:22:00,764 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:22:00,765 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-06 01:22:00,767 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:22:00,768 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:22:00,770 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:22:00,771 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-06 01:22:00,773 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:22:00,773 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:22:11,401 INFO L203 LiptonReduction]: Total number of compositions: 112 [2022-12-06 01:22:11,423 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 01:22:11,430 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;@5b217ba4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 01:22:11,430 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-06 01:22:11,434 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-06 01:22:11,435 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:22:11,435 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:22:11,437 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 01:22:11,437 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:22:11,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:22:11,442 INFO L85 PathProgramCache]: Analyzing trace with hash 566858, now seen corresponding path program 1 times [2022-12-06 01:22:11,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:22:11,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020986478] [2022-12-06 01:22:11,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:22:11,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:22:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:22:11,705 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-06 01:22:11,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:22:11,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020986478] [2022-12-06 01:22:11,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020986478] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:22:11,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:22:11,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:22:11,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88888731] [2022-12-06 01:22:11,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:22:11,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 01:22:11,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:22:11,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 01:22:11,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 01:22:11,727 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2022-12-06 01:22:11,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:22:11,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:22:11,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2022-12-06 01:22:11,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:22:11,869 INFO L130 PetriNetUnfolder]: 353/693 cut-off events. [2022-12-06 01:22:11,869 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-06 01:22:11,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 693 events. 353/693 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3692 event pairs, 352 based on Foata normal form. 31/560 useless extension candidates. Maximal degree in co-relation 1146. Up to 621 conditions per place. [2022-12-06 01:22:11,878 INFO L137 encePairwiseOnDemand]: 38/39 looper letters, 31 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2022-12-06 01:22:11,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 38 transitions, 150 flow [2022-12-06 01:22:11,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 01:22:11,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 01:22:11,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2022-12-06 01:22:11,887 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2022-12-06 01:22:11,891 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2022-12-06 01:22:11,892 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:22:11,892 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 38 transitions, 150 flow [2022-12-06 01:22:11,897 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 38 transitions, 150 flow [2022-12-06 01:22:11,897 INFO L188 LiptonReduction]: Number of co-enabled transitions 148 [2022-12-06 01:22:11,900 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:22:11,901 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:22:11,902 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:22:11,903 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:22:11,978 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:22:11,979 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:22:11,980 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:22:11,981 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:22:12,125 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:22:12,126 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:22:12,127 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:22:12,128 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:22:12,652 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 01:22:12,653 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 761 [2022-12-06 01:22:12,653 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 136 flow [2022-12-06 01:22:12,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:22:12,654 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:22:12,654 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-06 01:22:12,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 01:22:12,654 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:22:12,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:22:12,654 INFO L85 PathProgramCache]: Analyzing trace with hash 17567358, now seen corresponding path program 1 times [2022-12-06 01:22:12,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:22:12,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462133657] [2022-12-06 01:22:12,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:22:12,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:22:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:22:12,887 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-06 01:22:12,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:22:12,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462133657] [2022-12-06 01:22:12,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462133657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:22:12,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:22:12,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:22:12,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334542569] [2022-12-06 01:22:12,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:22:12,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:22:12,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:22:12,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:22:12,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:22:12,890 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 01:22:12,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 136 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-06 01:22:12,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:22:12,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 01:22:12,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:22:13,059 INFO L130 PetriNetUnfolder]: 487/858 cut-off events. [2022-12-06 01:22:13,060 INFO L131 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2022-12-06 01:22:13,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2540 conditions, 858 events. 487/858 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4013 event pairs, 241 based on Foata normal form. 0/687 useless extension candidates. Maximal degree in co-relation 2299. Up to 801 conditions per place. [2022-12-06 01:22:13,066 INFO L137 encePairwiseOnDemand]: 23/32 looper letters, 36 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2022-12-06 01:22:13,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 43 transitions, 264 flow [2022-12-06 01:22:13,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:22:13,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:22:13,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-06 01:22:13,069 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46875 [2022-12-06 01:22:13,069 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2022-12-06 01:22:13,070 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:22:13,070 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 43 transitions, 264 flow [2022-12-06 01:22:13,073 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 43 transitions, 264 flow [2022-12-06 01:22:13,073 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:22:13,075 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:22:13,077 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 01:22:13,077 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 43 transitions, 264 flow [2022-12-06 01:22:13,077 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-06 01:22:13,077 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:22:13,077 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 01:22:13,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 01:22:13,077 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:22:13,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:22:13,078 INFO L85 PathProgramCache]: Analyzing trace with hash 544588664, now seen corresponding path program 1 times [2022-12-06 01:22:13,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:22:13,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576201174] [2022-12-06 01:22:13,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:22:13,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:22:13,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:22:13,243 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-06 01:22:13,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:22:13,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576201174] [2022-12-06 01:22:13,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576201174] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:22:13,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:22:13,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:22:13,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949808901] [2022-12-06 01:22:13,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:22:13,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:22:13,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:22:13,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:22:13,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:22:13,244 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 01:22:13,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 43 transitions, 264 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-06 01:22:13,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:22:13,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 01:22:13,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:22:13,406 INFO L130 PetriNetUnfolder]: 541/965 cut-off events. [2022-12-06 01:22:13,406 INFO L131 PetriNetUnfolder]: For 87/87 co-relation queries the response was YES. [2022-12-06 01:22:13,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3827 conditions, 965 events. 541/965 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4772 event pairs, 246 based on Foata normal form. 31/795 useless extension candidates. Maximal degree in co-relation 3511. Up to 908 conditions per place. [2022-12-06 01:22:13,411 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 51 selfloop transitions, 10 changer transitions 2/63 dead transitions. [2022-12-06 01:22:13,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 63 transitions, 510 flow [2022-12-06 01:22:13,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:22:13,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:22:13,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 01:22:13,412 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46236559139784944 [2022-12-06 01:22:13,413 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2022-12-06 01:22:13,413 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:22:13,413 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 63 transitions, 510 flow [2022-12-06 01:22:13,417 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 63 transitions, 510 flow [2022-12-06 01:22:13,417 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:22:13,418 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:22:13,419 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 01:22:13,419 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 63 transitions, 510 flow [2022-12-06 01:22:13,419 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-06 01:22:13,419 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:22:13,419 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:22:13,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 01:22:13,419 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:22:13,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:22:13,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1743551297, now seen corresponding path program 1 times [2022-12-06 01:22:13,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:22:13,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352711097] [2022-12-06 01:22:13,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:22:13,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:22:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:22:13,486 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-06 01:22:13,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:22:13,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352711097] [2022-12-06 01:22:13,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352711097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:22:13,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:22:13,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:22:13,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885223991] [2022-12-06 01:22:13,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:22:13,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:22:13,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:22:13,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:22:13,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:22:13,488 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2022-12-06 01:22:13,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 63 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-06 01:22:13,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:22:13,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2022-12-06 01:22:13,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:22:13,592 INFO L130 PetriNetUnfolder]: 156/303 cut-off events. [2022-12-06 01:22:13,592 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-12-06 01:22:13,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1527 conditions, 303 events. 156/303 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1023 event pairs, 28 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 1135. Up to 300 conditions per place. [2022-12-06 01:22:13,594 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 29 selfloop transitions, 1 changer transitions 9/40 dead transitions. [2022-12-06 01:22:13,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 404 flow [2022-12-06 01:22:13,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:22:13,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:22:13,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-06 01:22:13,595 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4838709677419355 [2022-12-06 01:22:13,596 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2022-12-06 01:22:13,596 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:22:13,596 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 40 transitions, 404 flow [2022-12-06 01:22:13,598 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 40 transitions, 404 flow [2022-12-06 01:22:13,598 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:22:13,602 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:22:13,603 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:22:13,609 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:22:13,610 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 01:22:13,687 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:22:13,688 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-06 01:22:13,688 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 398 flow [2022-12-06 01:22:13,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-06 01:22:13,688 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:22:13,688 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:22:13,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 01:22:13,688 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:22:13,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:22:13,688 INFO L85 PathProgramCache]: Analyzing trace with hash -562688316, now seen corresponding path program 1 times [2022-12-06 01:22:13,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:22:13,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480194518] [2022-12-06 01:22:13,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:22:13,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:22:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:22:13,870 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-06 01:22:13,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:22:13,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480194518] [2022-12-06 01:22:13,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480194518] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:22:13,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:22:13,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:22:13,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725141698] [2022-12-06 01:22:13,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:22:13,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:22:13,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:22:13,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:22:13,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:22:13,873 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 01:22:13,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 398 flow. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:22:13,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:22:13,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 01:22:13,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:22:13,969 INFO L130 PetriNetUnfolder]: 159/312 cut-off events. [2022-12-06 01:22:13,970 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-06 01:22:13,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1882 conditions, 312 events. 159/312 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1081 event pairs, 29 based on Foata normal form. 0/263 useless extension candidates. Maximal degree in co-relation 1360. Up to 308 conditions per place. [2022-12-06 01:22:13,971 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 32 selfloop transitions, 6 changer transitions 12/50 dead transitions. [2022-12-06 01:22:13,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 607 flow [2022-12-06 01:22:13,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:22:13,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:22:13,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-06 01:22:13,973 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2022-12-06 01:22:13,974 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -1 predicate places. [2022-12-06 01:22:13,974 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:22:13,974 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 50 transitions, 607 flow [2022-12-06 01:22:13,976 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 50 transitions, 607 flow [2022-12-06 01:22:14,004 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:22:14,004 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:22:14,005 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-06 01:22:14,005 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 50 transitions, 607 flow [2022-12-06 01:22:14,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:22:14,005 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:22:14,005 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:22:14,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 01:22:14,005 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:22:14,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:22:14,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1639903999, now seen corresponding path program 1 times [2022-12-06 01:22:14,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:22:14,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358130194] [2022-12-06 01:22:14,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:22:14,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:22:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:22:14,403 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-06 01:22:14,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:22:14,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358130194] [2022-12-06 01:22:14,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358130194] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:22:14,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:22:14,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 01:22:14,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745391642] [2022-12-06 01:22:14,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:22:14,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 01:22:14,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:22:14,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 01:22:14,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 01:22:14,405 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 01:22:14,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 50 transitions, 607 flow. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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-06 01:22:14,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:22:14,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 01:22:14,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:22:14,756 INFO L130 PetriNetUnfolder]: 190/409 cut-off events. [2022-12-06 01:22:14,756 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-06 01:22:14,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2865 conditions, 409 events. 190/409 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1672 event pairs, 5 based on Foata normal form. 0/350 useless extension candidates. Maximal degree in co-relation 1830. Up to 402 conditions per place. [2022-12-06 01:22:14,758 INFO L137 encePairwiseOnDemand]: 14/28 looper letters, 62 selfloop transitions, 19 changer transitions 19/100 dead transitions. [2022-12-06 01:22:14,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 100 transitions, 1403 flow [2022-12-06 01:22:14,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 01:22:14,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 01:22:14,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 84 transitions. [2022-12-06 01:22:14,760 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-06 01:22:14,760 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2022-12-06 01:22:14,760 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:22:14,760 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 100 transitions, 1403 flow [2022-12-06 01:22:14,763 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 100 transitions, 1403 flow [2022-12-06 01:22:14,763 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:22:14,763 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:22:14,764 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-06 01:22:14,764 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 100 transitions, 1403 flow [2022-12-06 01:22:14,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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-06 01:22:14,764 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:22:14,764 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:22:14,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 01:22:14,765 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:22:14,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:22:14,765 INFO L85 PathProgramCache]: Analyzing trace with hash -202178755, now seen corresponding path program 2 times [2022-12-06 01:22:14,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:22:14,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675989309] [2022-12-06 01:22:14,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:22:14,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:22:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:22:15,217 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-06 01:22:15,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:22:15,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675989309] [2022-12-06 01:22:15,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675989309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:22:15,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:22:15,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 01:22:15,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430692392] [2022-12-06 01:22:15,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:22:15,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 01:22:15,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:22:15,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 01:22:15,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 01:22:15,221 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 01:22:15,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 100 transitions, 1403 flow. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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-06 01:22:15,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:22:15,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 01:22:15,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:22:15,561 INFO L130 PetriNetUnfolder]: 188/405 cut-off events. [2022-12-06 01:22:15,561 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2022-12-06 01:22:15,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3243 conditions, 405 events. 188/405 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1658 event pairs, 4 based on Foata normal form. 0/348 useless extension candidates. Maximal degree in co-relation 2090. Up to 398 conditions per place. [2022-12-06 01:22:15,563 INFO L137 encePairwiseOnDemand]: 14/28 looper letters, 75 selfloop transitions, 20 changer transitions 22/117 dead transitions. [2022-12-06 01:22:15,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 117 transitions, 1871 flow [2022-12-06 01:22:15,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 01:22:15,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 01:22:15,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-12-06 01:22:15,565 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36607142857142855 [2022-12-06 01:22:15,565 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2022-12-06 01:22:15,565 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:22:15,565 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 117 transitions, 1871 flow [2022-12-06 01:22:15,568 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 117 transitions, 1871 flow [2022-12-06 01:22:15,568 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:22:15,568 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:22:15,569 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-06 01:22:15,569 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 117 transitions, 1871 flow [2022-12-06 01:22:15,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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-06 01:22:15,569 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:22:15,569 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:22:15,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 01:22:15,569 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 01:22:15,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:22:15,570 INFO L85 PathProgramCache]: Analyzing trace with hash -66708344, now seen corresponding path program 1 times [2022-12-06 01:22:15,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:22:15,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802298866] [2022-12-06 01:22:15,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:22:15,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:22:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 01:22:15,615 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 01:22:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 01:22:15,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 01:22:15,677 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 01:22:15,677 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2022-12-06 01:22:15,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2022-12-06 01:22:15,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2022-12-06 01:22:15,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2022-12-06 01:22:15,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2022-12-06 01:22:15,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2022-12-06 01:22:15,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2022-12-06 01:22:15,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2022-12-06 01:22:15,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 01:22:15,679 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-12-06 01:22:15,682 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 01:22:15,682 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 01:22:15,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 01:22:15 BasicIcfg [2022-12-06 01:22:15,713 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 01:22:15,713 INFO L158 Benchmark]: Toolchain (without parser) took 59131.11ms. Allocated memory was 202.4MB in the beginning and 246.4MB in the end (delta: 44.0MB). Free memory was 175.6MB in the beginning and 124.5MB in the end (delta: 51.1MB). Peak memory consumption was 96.2MB. Max. memory is 8.0GB. [2022-12-06 01:22:15,714 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 202.4MB. Free memory is still 179.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 01:22:15,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 841.73ms. Allocated memory is still 202.4MB. Free memory was 175.6MB in the beginning and 121.0MB in the end (delta: 54.5MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. [2022-12-06 01:22:15,714 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.05ms. Allocated memory is still 202.4MB. Free memory was 121.0MB in the beginning and 117.4MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 01:22:15,714 INFO L158 Benchmark]: Boogie Preprocessor took 30.07ms. Allocated memory is still 202.4MB. Free memory was 117.4MB in the beginning and 114.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 01:22:15,714 INFO L158 Benchmark]: RCFGBuilder took 626.47ms. Allocated memory is still 202.4MB. Free memory was 114.7MB in the beginning and 87.5MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 01:22:15,714 INFO L158 Benchmark]: TraceAbstraction took 57567.94ms. Allocated memory was 202.4MB in the beginning and 246.4MB in the end (delta: 44.0MB). Free memory was 86.4MB in the beginning and 124.5MB in the end (delta: -38.0MB). Peak memory consumption was 7.1MB. Max. memory is 8.0GB. [2022-12-06 01:22:15,715 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 202.4MB. Free memory is still 179.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 841.73ms. Allocated memory is still 202.4MB. Free memory was 175.6MB in the beginning and 121.0MB in the end (delta: 54.5MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.05ms. Allocated memory is still 202.4MB. Free memory was 121.0MB in the beginning and 117.4MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.07ms. Allocated memory is still 202.4MB. Free memory was 117.4MB in the beginning and 114.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 626.47ms. Allocated memory is still 202.4MB. Free memory was 114.7MB in the beginning and 87.5MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 57567.94ms. Allocated memory was 202.4MB in the beginning and 246.4MB in the end (delta: 44.0MB). Free memory was 86.4MB in the beginning and 124.5MB in the end (delta: -38.0MB). Peak memory consumption was 7.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 53.0s, 148 PlacesBefore, 43 PlacesAfterwards, 146 TransitionsBefore, 39 TransitionsAfterwards, 2548 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 60 TrivialYvCompositions, 47 ConcurrentYvCompositions, 2 ChoiceCompositions, 112 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1794, independent: 1667, independent conditional: 1667, independent unconditional: 0, dependent: 69, dependent conditional: 69, dependent unconditional: 0, unknown: 58, unknown conditional: 58, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1794, independent: 1667, independent conditional: 0, independent unconditional: 1667, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 58, unknown conditional: 0, unknown unconditional: 58] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1794, independent: 1667, independent conditional: 0, independent unconditional: 1667, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 58, unknown conditional: 0, unknown unconditional: 58] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1794, independent: 1667, independent conditional: 0, independent unconditional: 1667, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 58, unknown conditional: 0, unknown unconditional: 58] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1432, independent: 1384, independent conditional: 0, independent unconditional: 1384, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1432, independent: 1378, independent conditional: 0, independent unconditional: 1378, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 54, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41676, independent: 95, independent conditional: 0, independent unconditional: 95, dependent: 540, dependent conditional: 0, dependent unconditional: 540, unknown: 41041, unknown conditional: 0, unknown unconditional: 41041] ], Cache Queries: [ total: 1794, independent: 283, independent conditional: 0, independent unconditional: 283, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 1471, unknown conditional: 0, unknown unconditional: 1471] , Statistics on independence cache: Total cache size (in pairs): 2258, Positive cache size: 2229, Positive conditional cache size: 0, Positive unconditional cache size: 2229, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 19, Unknown conditional cache size: 0, Unknown unconditional cache size: 19, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 44 PlacesBefore, 38 PlacesAfterwards, 38 TransitionsBefore, 32 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 40 PlacesAfterwards, 40 TransitionsBefore, 39 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 100 TransitionsBefore, 100 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 117 TransitionsBefore, 117 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - 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; [L1745] CALL, EXPR 0 my_drv_init() [L1739] 0 return 0; [L1745] RET, EXPR 0 my_drv_init() [L1745] 0 int ret = my_drv_init(); [L1746] COND TRUE 0 ret==0 [L1747] 0 int probe_ret; [L1748] 0 struct my_data data; [L1749] CALL, EXPR 0 my_drv_probe(&data) [L1706] 0 struct device *d = &data->dev; [L1708] 0 data->shared.a = 0 [L1709] 0 data->shared.b = 0 [L1710] 0 int res = __VERIFIER_nondet_int(); [L1711] COND FALSE 0 !(\read(res)) [L1713] 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)=-2147483648, 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) );}) [L1694] 1 data->shared.a = 1 [L1697] EXPR 1 data->shared.b [L1697] 1 int lb = data->shared.b; [L1700] 1 data->shared.b = lb + 1 [L1703] 1 return 0; [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\result={0:0}, __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)=-2147483647, 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) );}) [L1694] 2 data->shared.a = 1 VAL [\result={0:0}, __mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}] [L1697] EXPR 2 data->shared.b [L1697] 2 int lb = data->shared.b; [L1715] 0 return 0; [L1749] RET, EXPR 0 my_drv_probe(&data) [L1749] 0 probe_ret = my_drv_probe(&data) VAL [\result={0:0}, __mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, data={6:0}, dev={6:24}, lb=1, my_drv_probe(&data)=0, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1750] COND TRUE 0 probe_ret==0 [L1751] CALL 0 my_drv_disconnect(&data) [L1721] 0 void *status; [L1722] 0 \read(t1) VAL [\read(t1)=-2147483648, \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=1, status={5:0}, t1={3:0}, t2={4:0}] [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\read(t1)=-2147483648, \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=1, pthread_join(t1, &status)={0:0}, status={5:0}, t1={3:0}, t2={4:0}] [L1724] 0 data->shared.a = 3 [L1727] 0 data->shared.b = 3 [L1730] EXPR 0 data->shared.a [L1730] CALL 0 ldv_assert(data->shared.a==3) [L1675] COND FALSE 0 !(!expression) [L1730] RET 0 ldv_assert(data->shared.a==3) [L1700] 2 data->shared.b = lb + 1 [L1703] 2 return 0; [L1733] EXPR 0 data->shared.b [L1733] CALL 0 ldv_assert(data->shared.b==3) [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=1, 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: 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: 1713]: 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: 1714]: 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, 168 locations, 8 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: 57.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 53.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 260 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 260 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 745 IncrementalHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 3 mSDtfsCounter, 745 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1871occurred in iteration=7, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 400 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 01:22:15,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...