/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-misc-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:29:14,339 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:29:14,341 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:29:14,375 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:29:14,376 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:29:14,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:29:14,381 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:29:14,385 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:29:14,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:29:14,389 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:29:14,390 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:29:14,391 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:29:14,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:29:14,395 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:29:14,396 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:29:14,396 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:29:14,397 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:29:14,398 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:29:14,399 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:29:14,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:29:14,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:29:14,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:29:14,403 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:29:14,403 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:29:14,406 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:29:14,407 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:29:14,407 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:29:14,408 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:29:14,408 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:29:14,409 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:29:14,409 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:29:14,410 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:29:14,411 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:29:14,411 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:29:14,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:29:14,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:29:14,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:29:14,427 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:29:14,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:29:14,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:29:14,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:29:14,429 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:29:14,464 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:29:14,464 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:29:14,465 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:29:14,466 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:29:14,466 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:29:14,467 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:29:14,467 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:29:14,467 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:29:14,467 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:29:14,467 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:29:14,468 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:29:14,468 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:29:14,468 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:29:14,468 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:29:14,468 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:29:14,468 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:29:14,469 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:29:14,469 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:29:14,469 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:29:14,469 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:29:14,469 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:29:14,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:29:14,470 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:29:14,470 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:29:14,470 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:29:14,470 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:29:14,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:29:14,470 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:29:14,470 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 07:29:14,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:29:14,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:29:14,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:29:14,813 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:29:14,814 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:29:14,815 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-5.wvr.c [2022-12-06 07:29:15,829 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:29:16,060 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:29:16,061 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-5.wvr.c [2022-12-06 07:29:16,069 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8852dc8db/79396511aac54594bb6cd2c57f029c3d/FLAG855d20c6c [2022-12-06 07:29:16,086 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8852dc8db/79396511aac54594bb6cd2c57f029c3d [2022-12-06 07:29:16,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:29:16,089 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:29:16,091 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:29:16,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:29:16,094 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:29:16,094 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:29:16" (1/1) ... [2022-12-06 07:29:16,096 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a387f2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:29:16, skipping insertion in model container [2022-12-06 07:29:16,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:29:16" (1/1) ... [2022-12-06 07:29:16,101 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:29:16,124 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:29:16,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:16,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:16,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:16,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:16,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:16,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:16,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:16,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:16,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:16,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:16,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:16,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:16,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:16,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:16,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:16,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:16,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:16,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:16,292 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-5.wvr.c[3027,3040] [2022-12-06 07:29:16,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:29:16,310 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:29:16,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:16,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:16,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:16,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:16,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:16,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:16,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:16,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:16,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:16,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:16,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:16,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:16,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:16,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:16,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:16,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:16,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:16,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:16,357 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-5.wvr.c[3027,3040] [2022-12-06 07:29:16,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:29:16,369 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:29:16,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:29:16 WrapperNode [2022-12-06 07:29:16,370 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:29:16,371 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:29:16,371 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:29:16,371 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:29:16,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:29:16" (1/1) ... [2022-12-06 07:29:16,391 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:29:16" (1/1) ... [2022-12-06 07:29:16,420 INFO L138 Inliner]: procedures = 22, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-12-06 07:29:16,420 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:29:16,421 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:29:16,421 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:29:16,421 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:29:16,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:29:16" (1/1) ... [2022-12-06 07:29:16,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:29:16" (1/1) ... [2022-12-06 07:29:16,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:29:16" (1/1) ... [2022-12-06 07:29:16,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:29:16" (1/1) ... [2022-12-06 07:29:16,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:29:16" (1/1) ... [2022-12-06 07:29:16,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:29:16" (1/1) ... [2022-12-06 07:29:16,450 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:29:16" (1/1) ... [2022-12-06 07:29:16,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:29:16" (1/1) ... [2022-12-06 07:29:16,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:29:16,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:29:16,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:29:16,454 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:29:16,454 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:29:16" (1/1) ... [2022-12-06 07:29:16,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:29:16,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:29:16,493 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 07:29:16,516 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 07:29:16,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:29:16,530 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:29:16,530 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:29:16,530 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:29:16,531 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:29:16,531 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 07:29:16,531 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 07:29:16,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:29:16,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:29:16,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:29:16,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 07:29:16,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 07:29:16,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:29:16,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:29:16,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:29:16,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:29:16,533 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 07:29:16,635 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:29:16,637 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:29:16,870 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:29:16,953 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:29:16,953 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 07:29:16,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:29:16 BoogieIcfgContainer [2022-12-06 07:29:16,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:29:16,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:29:16,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:29:16,962 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:29:16,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:29:16" (1/3) ... [2022-12-06 07:29:16,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db1e7c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:29:16, skipping insertion in model container [2022-12-06 07:29:16,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:29:16" (2/3) ... [2022-12-06 07:29:16,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db1e7c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:29:16, skipping insertion in model container [2022-12-06 07:29:16,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:29:16" (3/3) ... [2022-12-06 07:29:16,964 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-5.wvr.c [2022-12-06 07:29:16,980 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:29:16,981 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:29:16,981 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:29:17,055 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 07:29:17,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 103 transitions, 230 flow [2022-12-06 07:29:17,170 INFO L130 PetriNetUnfolder]: 7/100 cut-off events. [2022-12-06 07:29:17,170 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:29:17,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 100 events. 7/100 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2022-12-06 07:29:17,175 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 103 transitions, 230 flow [2022-12-06 07:29:17,179 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 90 transitions, 198 flow [2022-12-06 07:29:17,181 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:17,197 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 90 transitions, 198 flow [2022-12-06 07:29:17,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 90 transitions, 198 flow [2022-12-06 07:29:17,226 INFO L130 PetriNetUnfolder]: 7/90 cut-off events. [2022-12-06 07:29:17,227 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:29:17,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 90 events. 7/90 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2022-12-06 07:29:17,232 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 90 transitions, 198 flow [2022-12-06 07:29:17,232 INFO L188 LiptonReduction]: Number of co-enabled transitions 1250 [2022-12-06 07:29:23,041 INFO L203 LiptonReduction]: Total number of compositions: 68 [2022-12-06 07:29:23,060 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:29:23,067 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;@29eecd34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:29:23,068 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 07:29:23,080 INFO L130 PetriNetUnfolder]: 2/21 cut-off events. [2022-12-06 07:29:23,080 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:29:23,080 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:23,081 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:23,081 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:23,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:23,087 INFO L85 PathProgramCache]: Analyzing trace with hash -988867883, now seen corresponding path program 1 times [2022-12-06 07:29:23,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:23,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759694012] [2022-12-06 07:29:23,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:23,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:23,703 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 07:29:23,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:23,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759694012] [2022-12-06 07:29:23,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759694012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:23,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:23,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:23,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902029690] [2022-12-06 07:29:23,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:23,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:29:23,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:23,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:29:23,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:29:23,743 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 07:29:23,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:23,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:23,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 07:29:23,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:24,066 INFO L130 PetriNetUnfolder]: 433/696 cut-off events. [2022-12-06 07:29:24,066 INFO L131 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2022-12-06 07:29:24,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1488 conditions, 696 events. 433/696 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2651 event pairs, 74 based on Foata normal form. 0/578 useless extension candidates. Maximal degree in co-relation 1212. Up to 359 conditions per place. [2022-12-06 07:29:24,072 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 55 selfloop transitions, 5 changer transitions 22/82 dead transitions. [2022-12-06 07:29:24,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 82 transitions, 382 flow [2022-12-06 07:29:24,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:29:24,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:29:24,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2022-12-06 07:29:24,085 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2022-12-06 07:29:24,086 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 62 flow. Second operand 7 states and 84 transitions. [2022-12-06 07:29:24,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 82 transitions, 382 flow [2022-12-06 07:29:24,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 82 transitions, 346 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 07:29:24,094 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 99 flow [2022-12-06 07:29:24,096 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=99, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2022-12-06 07:29:24,100 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2022-12-06 07:29:24,101 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:24,102 INFO L89 Accepts]: Start accepts. Operand has 35 places, 26 transitions, 99 flow [2022-12-06 07:29:24,106 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:24,106 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:24,106 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 26 transitions, 99 flow [2022-12-06 07:29:24,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 99 flow [2022-12-06 07:29:24,131 INFO L130 PetriNetUnfolder]: 30/99 cut-off events. [2022-12-06 07:29:24,134 INFO L131 PetriNetUnfolder]: For 79/86 co-relation queries the response was YES. [2022-12-06 07:29:24,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 99 events. 30/99 cut-off events. For 79/86 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 339 event pairs, 4 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 173. Up to 37 conditions per place. [2022-12-06 07:29:24,139 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 26 transitions, 99 flow [2022-12-06 07:29:24,139 INFO L188 LiptonReduction]: Number of co-enabled transitions 176 [2022-12-06 07:29:24,145 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:29:24,147 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-06 07:29:24,147 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 99 flow [2022-12-06 07:29:24,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:24,147 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:24,147 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:24,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:29:24,148 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:24,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:24,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1722233065, now seen corresponding path program 2 times [2022-12-06 07:29:24,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:24,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504131806] [2022-12-06 07:29:24,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:24,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:24,367 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 07:29:24,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:24,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504131806] [2022-12-06 07:29:24,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504131806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:24,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:24,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:29:24,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789284509] [2022-12-06 07:29:24,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:24,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:24,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:24,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:24,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:24,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 07:29:24,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:24,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:24,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 07:29:24,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:24,520 INFO L130 PetriNetUnfolder]: 260/443 cut-off events. [2022-12-06 07:29:24,521 INFO L131 PetriNetUnfolder]: For 504/504 co-relation queries the response was YES. [2022-12-06 07:29:24,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1373 conditions, 443 events. 260/443 cut-off events. For 504/504 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1580 event pairs, 21 based on Foata normal form. 32/475 useless extension candidates. Maximal degree in co-relation 940. Up to 239 conditions per place. [2022-12-06 07:29:24,524 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 40 selfloop transitions, 6 changer transitions 0/46 dead transitions. [2022-12-06 07:29:24,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 46 transitions, 280 flow [2022-12-06 07:29:24,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:24,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:24,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 07:29:24,526 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2022-12-06 07:29:24,526 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 99 flow. Second operand 4 states and 41 transitions. [2022-12-06 07:29:24,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 46 transitions, 280 flow [2022-12-06 07:29:24,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 46 transitions, 265 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:24,530 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 124 flow [2022-12-06 07:29:24,530 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2022-12-06 07:29:24,531 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2022-12-06 07:29:24,531 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:24,531 INFO L89 Accepts]: Start accepts. Operand has 35 places, 29 transitions, 124 flow [2022-12-06 07:29:24,533 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:24,533 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:24,534 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 29 transitions, 124 flow [2022-12-06 07:29:24,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 29 transitions, 124 flow [2022-12-06 07:29:24,547 INFO L130 PetriNetUnfolder]: 33/106 cut-off events. [2022-12-06 07:29:24,547 INFO L131 PetriNetUnfolder]: For 94/103 co-relation queries the response was YES. [2022-12-06 07:29:24,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 106 events. 33/106 cut-off events. For 94/103 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 360 event pairs, 4 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 219. Up to 41 conditions per place. [2022-12-06 07:29:24,548 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 29 transitions, 124 flow [2022-12-06 07:29:24,548 INFO L188 LiptonReduction]: Number of co-enabled transitions 156 [2022-12-06 07:29:24,549 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [304] $Ultimate##0-->L61: Formula: (= v_~v_assert~0_1 |v_thread1Thread1of1ForFork1_~cond~0#1_1|) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~cond~0#1] and [401] $Ultimate##0-->thread3EXIT: Formula: (and (= 0 |v_thread3Thread1of1ForFork0_#res.base_13|) (= |v_thread3Thread1of1ForFork0_#res.offset_13| 0) (= (ite (= (ite (<= 0 v_~pos~0_145) 1 0) 0) 0 1) v_~v_assert~0_46)) InVars {~pos~0=v_~pos~0_145} OutVars{~v_assert~0=v_~v_assert~0_46, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_13|, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_13|, ~pos~0=v_~pos~0_145} AuxVars[] AssignedVars[~v_assert~0, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] [2022-12-06 07:29:24,602 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [420] $Ultimate##0-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_26| 0) (= (ite (= (ite (<= 0 v_~pos~0_199) 1 0) 0) 0 1) v_~v_assert~0_79) (= |v_thread1Thread1of1ForFork1_~cond~0#1_32| v_~v_assert~0_80) (= 0 |v_thread3Thread1of1ForFork0_#res.base_26|)) InVars {~v_assert~0=v_~v_assert~0_80, ~pos~0=v_~pos~0_199} OutVars{~v_assert~0=v_~v_assert~0_79, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_26|, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_26|, ~pos~0=v_~pos~0_199, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_32|} AuxVars[] AssignedVars[~v_assert~0, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork1_~cond~0#1] and [416] L61-->L57: Formula: (let ((.cse0 (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_In_2| 256) 0)) (.cse1 (not (= 0 (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_3| 256))))) (or (and (= |v_thread1Thread1of1ForFork1_#t~post5#1_In_2| |v_thread1Thread1of1ForFork1_#t~post5#1_Out_6|) (not .cse0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_2|) (= |v_thread1Thread1of1ForFork1_#t~post4#1_In_2| |v_thread1Thread1of1ForFork1_#t~post4#1_Out_6|) (= (+ v_~pos~0_In_10 1) v_~pos~0_Out_28) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_2|) .cse1 (= (+ v_~c1~0_In_7 1) v_~c1~0_Out_12)) (and .cse0 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (< 0 v_~c1~0_In_7) 1 0)) (= v_~c1~0_In_7 (+ v_~c1~0_Out_12 1)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) .cse1 (= |v_thread1Thread1of1ForFork1_#t~post3#1_Out_6| |v_thread1Thread1of1ForFork1_#t~post3#1_In_2|) (= |v_thread1Thread1of1ForFork1_#t~post2#1_Out_6| |v_thread1Thread1of1ForFork1_#t~post2#1_In_2|) (= v_~pos~0_In_10 (+ v_~pos~0_Out_28 1))))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_In_2|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_In_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_2|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_In_2|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_In_2|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_In_2|, ~pos~0=v_~pos~0_In_10, ~c1~0=v_~c1~0_In_7, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_2|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_6|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_Out_6|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_6|, ~pos~0=v_~pos~0_Out_28, ~c1~0=v_~c1~0_Out_12, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~nondet1#1, ~pos~0, ~c1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:29:24,802 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:29:24,803 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 272 [2022-12-06 07:29:24,803 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 142 flow [2022-12-06 07:29:24,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:24,804 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:24,804 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 07:29:24,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:29:24,804 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:24,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:24,805 INFO L85 PathProgramCache]: Analyzing trace with hash 2110559894, now seen corresponding path program 1 times [2022-12-06 07:29:24,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:24,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110642853] [2022-12-06 07:29:24,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:24,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:24,927 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 07:29:24,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:24,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110642853] [2022-12-06 07:29:24,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110642853] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:24,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:24,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:29:24,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163093179] [2022-12-06 07:29:24,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:24,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:24,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:24,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:24,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:24,933 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 07:29:24,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 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 07:29:24,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:24,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 07:29:24,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:25,094 INFO L130 PetriNetUnfolder]: 225/410 cut-off events. [2022-12-06 07:29:25,094 INFO L131 PetriNetUnfolder]: For 539/539 co-relation queries the response was YES. [2022-12-06 07:29:25,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1324 conditions, 410 events. 225/410 cut-off events. For 539/539 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1519 event pairs, 41 based on Foata normal form. 20/430 useless extension candidates. Maximal degree in co-relation 728. Up to 261 conditions per place. [2022-12-06 07:29:25,096 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 36 selfloop transitions, 8 changer transitions 3/47 dead transitions. [2022-12-06 07:29:25,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 333 flow [2022-12-06 07:29:25,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:25,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:25,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 07:29:25,099 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2022-12-06 07:29:25,099 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 142 flow. Second operand 4 states and 41 transitions. [2022-12-06 07:29:25,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 333 flow [2022-12-06 07:29:25,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 47 transitions, 315 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 07:29:25,106 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 172 flow [2022-12-06 07:29:25,106 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2022-12-06 07:29:25,107 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2022-12-06 07:29:25,108 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:25,108 INFO L89 Accepts]: Start accepts. Operand has 40 places, 32 transitions, 172 flow [2022-12-06 07:29:25,108 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:25,109 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:25,112 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 32 transitions, 172 flow [2022-12-06 07:29:25,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 32 transitions, 172 flow [2022-12-06 07:29:25,130 INFO L130 PetriNetUnfolder]: 25/92 cut-off events. [2022-12-06 07:29:25,130 INFO L131 PetriNetUnfolder]: For 139/147 co-relation queries the response was YES. [2022-12-06 07:29:25,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 92 events. 25/92 cut-off events. For 139/147 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 316 event pairs, 1 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 196. Up to 33 conditions per place. [2022-12-06 07:29:25,131 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 32 transitions, 172 flow [2022-12-06 07:29:25,131 INFO L188 LiptonReduction]: Number of co-enabled transitions 148 [2022-12-06 07:29:25,132 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [317] $Ultimate##0-->L87: Formula: (= v_~v_assert~0_4 |v_thread2Thread1of1ForFork2_~cond~1#1_1|) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_1|, ~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1] and [420] $Ultimate##0-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_26| 0) (= (ite (= (ite (<= 0 v_~pos~0_199) 1 0) 0) 0 1) v_~v_assert~0_79) (= |v_thread1Thread1of1ForFork1_~cond~0#1_32| v_~v_assert~0_80) (= 0 |v_thread3Thread1of1ForFork0_#res.base_26|)) InVars {~v_assert~0=v_~v_assert~0_80, ~pos~0=v_~pos~0_199} OutVars{~v_assert~0=v_~v_assert~0_79, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_26|, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_26|, ~pos~0=v_~pos~0_199, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_32|} AuxVars[] AssignedVars[~v_assert~0, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork1_~cond~0#1] [2022-12-06 07:29:25,159 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [317] $Ultimate##0-->L87: Formula: (= v_~v_assert~0_4 |v_thread2Thread1of1ForFork2_~cond~1#1_1|) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_1|, ~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1] and [401] $Ultimate##0-->thread3EXIT: Formula: (and (= 0 |v_thread3Thread1of1ForFork0_#res.base_13|) (= |v_thread3Thread1of1ForFork0_#res.offset_13| 0) (= (ite (= (ite (<= 0 v_~pos~0_145) 1 0) 0) 0 1) v_~v_assert~0_46)) InVars {~pos~0=v_~pos~0_145} OutVars{~v_assert~0=v_~v_assert~0_46, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_13|, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_13|, ~pos~0=v_~pos~0_145} AuxVars[] AssignedVars[~v_assert~0, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] [2022-12-06 07:29:25,185 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [317] $Ultimate##0-->L87: Formula: (= v_~v_assert~0_4 |v_thread2Thread1of1ForFork2_~cond~1#1_1|) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_1|, ~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1] and [421] $Ultimate##0-->L57: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_31| 0) (let ((.cse0 (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_52| 256) 0)) (.cse1 (not (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_39| 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_20|) (= v_~pos~0_204 (+ v_~pos~0_205 1)) (= |v_thread1Thread1of1ForFork1_#t~post4#1_20| |v_thread1Thread1of1ForFork1_#t~post4#1_19|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_20| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|) (not .cse0) .cse1 (= |v_thread1Thread1of1ForFork1_#t~post5#1_19| |v_thread1Thread1of1ForFork1_#t~post5#1_20|) (= (+ v_~c1~0_118 1) v_~c1~0_117)) (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|) (= v_~pos~0_205 (+ v_~pos~0_204 1)) .cse0 (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) .cse1 (= |v_thread1Thread1of1ForFork1_#t~post2#1_24| |v_thread1Thread1of1ForFork1_#t~post2#1_23|) (= |v_thread1Thread1of1ForFork1_#t~post3#1_24| |v_thread1Thread1of1ForFork1_#t~post3#1_23|) (= (+ v_~c1~0_117 1) v_~c1~0_118) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19| (ite (< 0 v_~c1~0_118) 1 0))))) (= |v_thread1Thread1of1ForFork1_~cond~0#1_39| v_~v_assert~0_90) (= (ite (= (ite (<= 0 v_~pos~0_205) 1 0) 0) 0 1) v_~v_assert~0_89) (= 0 |v_thread3Thread1of1ForFork0_#res.base_31|)) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_24|, ~v_assert~0=v_~v_assert~0_90, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_24|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_20|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_20|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_20|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_52|, ~pos~0=v_~pos~0_205, ~c1~0=v_~c1~0_118, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_20|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_23|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_19|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_19|, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_31|, ~c1~0=v_~c1~0_117, ~v_assert~0=v_~v_assert~0_89, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_23|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_31|, ~pos~0=v_~pos~0_204, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork1_#t~post5#1, thread3Thread1of1ForFork0_#res.base, ~c1~0, ~v_assert~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork1_#t~nondet1#1, ~pos~0, thread1Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:29:25,379 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:25,380 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 272 [2022-12-06 07:29:25,381 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 188 flow [2022-12-06 07:29:25,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 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 07:29:25,381 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:25,381 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:25,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:29:25,381 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:25,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:25,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1736905655, now seen corresponding path program 1 times [2022-12-06 07:29:25,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:25,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558369087] [2022-12-06 07:29:25,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:25,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:25,505 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 07:29:25,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:25,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558369087] [2022-12-06 07:29:25,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558369087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:25,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:25,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:29:25,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548064059] [2022-12-06 07:29:25,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:25,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:25,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:25,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:25,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:25,507 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:29:25,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:25,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:25,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:29:25,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:25,652 INFO L130 PetriNetUnfolder]: 219/378 cut-off events. [2022-12-06 07:29:25,652 INFO L131 PetriNetUnfolder]: For 788/788 co-relation queries the response was YES. [2022-12-06 07:29:25,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1353 conditions, 378 events. 219/378 cut-off events. For 788/788 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1299 event pairs, 23 based on Foata normal form. 12/388 useless extension candidates. Maximal degree in co-relation 707. Up to 152 conditions per place. [2022-12-06 07:29:25,655 INFO L137 encePairwiseOnDemand]: 16/25 looper letters, 41 selfloop transitions, 10 changer transitions 1/52 dead transitions. [2022-12-06 07:29:25,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 390 flow [2022-12-06 07:29:25,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:29:25,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:29:25,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-06 07:29:25,657 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.384 [2022-12-06 07:29:25,657 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 188 flow. Second operand 5 states and 48 transitions. [2022-12-06 07:29:25,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 390 flow [2022-12-06 07:29:25,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 365 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-06 07:29:25,660 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 202 flow [2022-12-06 07:29:25,661 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=202, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2022-12-06 07:29:25,662 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2022-12-06 07:29:25,662 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:25,662 INFO L89 Accepts]: Start accepts. Operand has 45 places, 33 transitions, 202 flow [2022-12-06 07:29:25,663 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:25,663 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:25,663 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 33 transitions, 202 flow [2022-12-06 07:29:25,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 33 transitions, 202 flow [2022-12-06 07:29:25,673 INFO L130 PetriNetUnfolder]: 33/96 cut-off events. [2022-12-06 07:29:25,673 INFO L131 PetriNetUnfolder]: For 319/331 co-relation queries the response was YES. [2022-12-06 07:29:25,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313 conditions, 96 events. 33/96 cut-off events. For 319/331 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 302 event pairs, 1 based on Foata normal form. 4/96 useless extension candidates. Maximal degree in co-relation 264. Up to 41 conditions per place. [2022-12-06 07:29:25,674 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 33 transitions, 202 flow [2022-12-06 07:29:25,674 INFO L188 LiptonReduction]: Number of co-enabled transitions 152 [2022-12-06 07:29:26,203 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:26,204 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 542 [2022-12-06 07:29:26,204 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 204 flow [2022-12-06 07:29:26,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:26,205 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:26,205 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 07:29:26,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 07:29:26,205 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:26,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:26,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1692827286, now seen corresponding path program 1 times [2022-12-06 07:29:26,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:26,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479324216] [2022-12-06 07:29:26,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:26,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:26,308 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 07:29:26,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:26,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479324216] [2022-12-06 07:29:26,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479324216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:26,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:26,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:29:26,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480916183] [2022-12-06 07:29:26,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:26,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:26,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:26,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:26,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:26,311 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 07:29:26,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 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 07:29:26,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:26,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 07:29:26,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:26,450 INFO L130 PetriNetUnfolder]: 208/347 cut-off events. [2022-12-06 07:29:26,450 INFO L131 PetriNetUnfolder]: For 1079/1079 co-relation queries the response was YES. [2022-12-06 07:29:26,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1366 conditions, 347 events. 208/347 cut-off events. For 1079/1079 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1081 event pairs, 31 based on Foata normal form. 26/373 useless extension candidates. Maximal degree in co-relation 1051. Up to 119 conditions per place. [2022-12-06 07:29:26,453 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 43 selfloop transitions, 7 changer transitions 3/53 dead transitions. [2022-12-06 07:29:26,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 420 flow [2022-12-06 07:29:26,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:29:26,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:29:26,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-12-06 07:29:26,454 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2022-12-06 07:29:26,455 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 204 flow. Second operand 5 states and 50 transitions. [2022-12-06 07:29:26,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 420 flow [2022-12-06 07:29:26,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 406 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 07:29:26,457 INFO L231 Difference]: Finished difference. Result has 48 places, 32 transitions, 194 flow [2022-12-06 07:29:26,458 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=48, PETRI_TRANSITIONS=32} [2022-12-06 07:29:26,460 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 18 predicate places. [2022-12-06 07:29:26,460 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:26,460 INFO L89 Accepts]: Start accepts. Operand has 48 places, 32 transitions, 194 flow [2022-12-06 07:29:26,461 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:26,461 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:26,461 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 32 transitions, 194 flow [2022-12-06 07:29:26,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 32 transitions, 194 flow [2022-12-06 07:29:26,473 INFO L130 PetriNetUnfolder]: 36/87 cut-off events. [2022-12-06 07:29:26,473 INFO L131 PetriNetUnfolder]: For 384/394 co-relation queries the response was YES. [2022-12-06 07:29:26,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 87 events. 36/87 cut-off events. For 384/394 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 231 event pairs, 2 based on Foata normal form. 3/86 useless extension candidates. Maximal degree in co-relation 296. Up to 44 conditions per place. [2022-12-06 07:29:26,474 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 32 transitions, 194 flow [2022-12-06 07:29:26,474 INFO L188 LiptonReduction]: Number of co-enabled transitions 156 [2022-12-06 07:29:26,627 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:26,628 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:29:26,628 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 196 flow [2022-12-06 07:29:26,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 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 07:29:26,629 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:26,629 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:26,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 07:29:26,629 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:26,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:26,630 INFO L85 PathProgramCache]: Analyzing trace with hash 552198529, now seen corresponding path program 1 times [2022-12-06 07:29:26,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:26,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270931849] [2022-12-06 07:29:26,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:26,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:26,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:26,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:26,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270931849] [2022-12-06 07:29:26,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270931849] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:29:26,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179613838] [2022-12-06 07:29:26,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:26,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:29:26,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:29:26,825 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:29:26,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 07:29:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:26,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 07:29:26,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:29:27,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:27,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:29:27,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:27,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179613838] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:29:27,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:29:27,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 07:29:27,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755045542] [2022-12-06 07:29:27,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:29:27,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:29:27,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:27,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:29:27,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:29:27,184 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 07:29:27,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 196 flow. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 07:29:27,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:27,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 07:29:27,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:27,761 INFO L130 PetriNetUnfolder]: 545/888 cut-off events. [2022-12-06 07:29:27,762 INFO L131 PetriNetUnfolder]: For 3011/3011 co-relation queries the response was YES. [2022-12-06 07:29:27,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4019 conditions, 888 events. 545/888 cut-off events. For 3011/3011 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3609 event pairs, 15 based on Foata normal form. 28/916 useless extension candidates. Maximal degree in co-relation 2488. Up to 335 conditions per place. [2022-12-06 07:29:27,768 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 100 selfloop transitions, 32 changer transitions 47/179 dead transitions. [2022-12-06 07:29:27,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 179 transitions, 1541 flow [2022-12-06 07:29:27,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 07:29:27,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 07:29:27,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 179 transitions. [2022-12-06 07:29:27,771 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3551587301587302 [2022-12-06 07:29:27,771 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 196 flow. Second operand 21 states and 179 transitions. [2022-12-06 07:29:27,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 179 transitions, 1541 flow [2022-12-06 07:29:27,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 179 transitions, 1467 flow, removed 27 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:27,779 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 560 flow [2022-12-06 07:29:27,780 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=560, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2022-12-06 07:29:27,780 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 36 predicate places. [2022-12-06 07:29:27,780 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:27,780 INFO L89 Accepts]: Start accepts. Operand has 66 places, 61 transitions, 560 flow [2022-12-06 07:29:27,782 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:27,782 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:27,782 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 61 transitions, 560 flow [2022-12-06 07:29:27,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 61 transitions, 560 flow [2022-12-06 07:29:27,816 INFO L130 PetriNetUnfolder]: 57/155 cut-off events. [2022-12-06 07:29:27,816 INFO L131 PetriNetUnfolder]: For 644/661 co-relation queries the response was YES. [2022-12-06 07:29:27,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 676 conditions, 155 events. 57/155 cut-off events. For 644/661 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 601 event pairs, 4 based on Foata normal form. 1/152 useless extension candidates. Maximal degree in co-relation 615. Up to 72 conditions per place. [2022-12-06 07:29:27,818 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 61 transitions, 560 flow [2022-12-06 07:29:27,818 INFO L188 LiptonReduction]: Number of co-enabled transitions 306 [2022-12-06 07:29:27,819 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [417] L87-->L83: Formula: (let ((.cse0 (not (= (mod |v_thread2Thread1of1ForFork2_~cond~1#1_In_1| 256) 0))) (.cse1 (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_In_2| 256) 0))) (or (and .cse0 (= (+ v_~pos~0_In_12 1) v_~pos~0_Out_32) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_1|) (not .cse1) (= v_~c2~0_Out_16 (+ v_~c2~0_In_7 1)) (= |v_thread2Thread1of1ForFork2_#t~post9#1_Out_4| |v_thread2Thread1of1ForFork2_#t~post9#1_In_1|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork2_#t~post10#1_In_1| |v_thread2Thread1of1ForFork2_#t~post10#1_Out_4|)) (and .cse0 (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) .cse1 (= (+ v_~c2~0_Out_16 1) v_~c2~0_In_7) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| (ite (< 0 v_~c2~0_In_7) 1 0)) (= |v_thread2Thread1of1ForFork2_#t~post7#1_In_1| |v_thread2Thread1of1ForFork2_#t~post7#1_Out_6|) (= |v_thread2Thread1of1ForFork2_#t~post8#1_In_1| |v_thread2Thread1of1ForFork2_#t~post8#1_Out_6|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= v_~pos~0_In_12 (+ v_~pos~0_Out_32 1))))) InVars {thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_In_1|, thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_In_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_1|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_In_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_1|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_In_1|, ~pos~0=v_~pos~0_In_12, ~c2~0=v_~c2~0_In_7, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_In_1|, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_In_2|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_In_1|, thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_Out_4|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_Out_6|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_Out_6|, ~pos~0=v_~pos~0_Out_32, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_Out_4|, ~c2~0=v_~c2~0_Out_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post10#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post8#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post7#1, ~pos~0, thread2Thread1of1ForFork2_#t~post9#1, ~c2~0, thread2Thread1of1ForFork2_#t~nondet6#1] and [304] $Ultimate##0-->L61: Formula: (= v_~v_assert~0_1 |v_thread1Thread1of1ForFork1_~cond~0#1_1|) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~cond~0#1] [2022-12-06 07:29:27,982 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [401] $Ultimate##0-->thread3EXIT: Formula: (and (= 0 |v_thread3Thread1of1ForFork0_#res.base_13|) (= |v_thread3Thread1of1ForFork0_#res.offset_13| 0) (= (ite (= (ite (<= 0 v_~pos~0_145) 1 0) 0) 0 1) v_~v_assert~0_46)) InVars {~pos~0=v_~pos~0_145} OutVars{~v_assert~0=v_~v_assert~0_46, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_13|, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_13|, ~pos~0=v_~pos~0_145} AuxVars[] AssignedVars[~v_assert~0, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [417] L87-->L83: Formula: (let ((.cse0 (not (= (mod |v_thread2Thread1of1ForFork2_~cond~1#1_In_1| 256) 0))) (.cse1 (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_In_2| 256) 0))) (or (and .cse0 (= (+ v_~pos~0_In_12 1) v_~pos~0_Out_32) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_1|) (not .cse1) (= v_~c2~0_Out_16 (+ v_~c2~0_In_7 1)) (= |v_thread2Thread1of1ForFork2_#t~post9#1_Out_4| |v_thread2Thread1of1ForFork2_#t~post9#1_In_1|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork2_#t~post10#1_In_1| |v_thread2Thread1of1ForFork2_#t~post10#1_Out_4|)) (and .cse0 (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) .cse1 (= (+ v_~c2~0_Out_16 1) v_~c2~0_In_7) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| (ite (< 0 v_~c2~0_In_7) 1 0)) (= |v_thread2Thread1of1ForFork2_#t~post7#1_In_1| |v_thread2Thread1of1ForFork2_#t~post7#1_Out_6|) (= |v_thread2Thread1of1ForFork2_#t~post8#1_In_1| |v_thread2Thread1of1ForFork2_#t~post8#1_Out_6|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= v_~pos~0_In_12 (+ v_~pos~0_Out_32 1))))) InVars {thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_In_1|, thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_In_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_1|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_In_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_1|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_In_1|, ~pos~0=v_~pos~0_In_12, ~c2~0=v_~c2~0_In_7, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_In_1|, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_In_2|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_In_1|, thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_Out_4|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_Out_6|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_Out_6|, ~pos~0=v_~pos~0_Out_32, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_Out_4|, ~c2~0=v_~c2~0_Out_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post10#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post8#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post7#1, ~pos~0, thread2Thread1of1ForFork2_#t~post9#1, ~c2~0, thread2Thread1of1ForFork2_#t~nondet6#1] [2022-12-06 07:29:28,153 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [401] $Ultimate##0-->thread3EXIT: Formula: (and (= 0 |v_thread3Thread1of1ForFork0_#res.base_13|) (= |v_thread3Thread1of1ForFork0_#res.offset_13| 0) (= (ite (= (ite (<= 0 v_~pos~0_145) 1 0) 0) 0 1) v_~v_assert~0_46)) InVars {~pos~0=v_~pos~0_145} OutVars{~v_assert~0=v_~v_assert~0_46, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_13|, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_13|, ~pos~0=v_~pos~0_145} AuxVars[] AssignedVars[~v_assert~0, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [417] L87-->L83: Formula: (let ((.cse0 (not (= (mod |v_thread2Thread1of1ForFork2_~cond~1#1_In_1| 256) 0))) (.cse1 (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_In_2| 256) 0))) (or (and .cse0 (= (+ v_~pos~0_In_12 1) v_~pos~0_Out_32) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_1|) (not .cse1) (= v_~c2~0_Out_16 (+ v_~c2~0_In_7 1)) (= |v_thread2Thread1of1ForFork2_#t~post9#1_Out_4| |v_thread2Thread1of1ForFork2_#t~post9#1_In_1|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork2_#t~post10#1_In_1| |v_thread2Thread1of1ForFork2_#t~post10#1_Out_4|)) (and .cse0 (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) .cse1 (= (+ v_~c2~0_Out_16 1) v_~c2~0_In_7) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| (ite (< 0 v_~c2~0_In_7) 1 0)) (= |v_thread2Thread1of1ForFork2_#t~post7#1_In_1| |v_thread2Thread1of1ForFork2_#t~post7#1_Out_6|) (= |v_thread2Thread1of1ForFork2_#t~post8#1_In_1| |v_thread2Thread1of1ForFork2_#t~post8#1_Out_6|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= v_~pos~0_In_12 (+ v_~pos~0_Out_32 1))))) InVars {thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_In_1|, thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_In_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_1|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_In_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_1|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_In_1|, ~pos~0=v_~pos~0_In_12, ~c2~0=v_~c2~0_In_7, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_In_1|, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_In_2|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_In_1|, thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_Out_4|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_Out_6|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_Out_6|, ~pos~0=v_~pos~0_Out_32, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_Out_4|, ~c2~0=v_~c2~0_Out_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post10#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post8#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post7#1, ~pos~0, thread2Thread1of1ForFork2_#t~post9#1, ~c2~0, thread2Thread1of1ForFork2_#t~nondet6#1] [2022-12-06 07:29:28,355 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [304] $Ultimate##0-->L61: Formula: (= v_~v_assert~0_1 |v_thread1Thread1of1ForFork1_~cond~0#1_1|) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~cond~0#1] and [417] L87-->L83: Formula: (let ((.cse0 (not (= (mod |v_thread2Thread1of1ForFork2_~cond~1#1_In_1| 256) 0))) (.cse1 (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_In_2| 256) 0))) (or (and .cse0 (= (+ v_~pos~0_In_12 1) v_~pos~0_Out_32) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_1|) (not .cse1) (= v_~c2~0_Out_16 (+ v_~c2~0_In_7 1)) (= |v_thread2Thread1of1ForFork2_#t~post9#1_Out_4| |v_thread2Thread1of1ForFork2_#t~post9#1_In_1|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork2_#t~post10#1_In_1| |v_thread2Thread1of1ForFork2_#t~post10#1_Out_4|)) (and .cse0 (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) .cse1 (= (+ v_~c2~0_Out_16 1) v_~c2~0_In_7) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| (ite (< 0 v_~c2~0_In_7) 1 0)) (= |v_thread2Thread1of1ForFork2_#t~post7#1_In_1| |v_thread2Thread1of1ForFork2_#t~post7#1_Out_6|) (= |v_thread2Thread1of1ForFork2_#t~post8#1_In_1| |v_thread2Thread1of1ForFork2_#t~post8#1_Out_6|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= v_~pos~0_In_12 (+ v_~pos~0_Out_32 1))))) InVars {thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_In_1|, thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_In_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_1|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_In_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_1|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_In_1|, ~pos~0=v_~pos~0_In_12, ~c2~0=v_~c2~0_In_7, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_In_1|, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_In_2|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_In_1|, thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_Out_4|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_Out_6|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_Out_6|, ~pos~0=v_~pos~0_Out_32, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_Out_4|, ~c2~0=v_~c2~0_Out_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post10#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post8#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post7#1, ~pos~0, thread2Thread1of1ForFork2_#t~post9#1, ~c2~0, thread2Thread1of1ForFork2_#t~nondet6#1] [2022-12-06 07:29:28,669 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [416] L61-->L57: Formula: (let ((.cse0 (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_In_2| 256) 0)) (.cse1 (not (= 0 (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_3| 256))))) (or (and (= |v_thread1Thread1of1ForFork1_#t~post5#1_In_2| |v_thread1Thread1of1ForFork1_#t~post5#1_Out_6|) (not .cse0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_2|) (= |v_thread1Thread1of1ForFork1_#t~post4#1_In_2| |v_thread1Thread1of1ForFork1_#t~post4#1_Out_6|) (= (+ v_~pos~0_In_10 1) v_~pos~0_Out_28) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_2|) .cse1 (= (+ v_~c1~0_In_7 1) v_~c1~0_Out_12)) (and .cse0 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (< 0 v_~c1~0_In_7) 1 0)) (= v_~c1~0_In_7 (+ v_~c1~0_Out_12 1)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) .cse1 (= |v_thread1Thread1of1ForFork1_#t~post3#1_Out_6| |v_thread1Thread1of1ForFork1_#t~post3#1_In_2|) (= |v_thread1Thread1of1ForFork1_#t~post2#1_Out_6| |v_thread1Thread1of1ForFork1_#t~post2#1_In_2|) (= v_~pos~0_In_10 (+ v_~pos~0_Out_28 1))))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_In_2|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_In_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_2|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_In_2|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_In_2|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_In_2|, ~pos~0=v_~pos~0_In_10, ~c1~0=v_~c1~0_In_7, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_2|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_6|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_Out_6|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_6|, ~pos~0=v_~pos~0_Out_28, ~c1~0=v_~c1~0_Out_12, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~nondet1#1, ~pos~0, ~c1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [417] L87-->L83: Formula: (let ((.cse0 (not (= (mod |v_thread2Thread1of1ForFork2_~cond~1#1_In_1| 256) 0))) (.cse1 (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_In_2| 256) 0))) (or (and .cse0 (= (+ v_~pos~0_In_12 1) v_~pos~0_Out_32) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_1|) (not .cse1) (= v_~c2~0_Out_16 (+ v_~c2~0_In_7 1)) (= |v_thread2Thread1of1ForFork2_#t~post9#1_Out_4| |v_thread2Thread1of1ForFork2_#t~post9#1_In_1|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork2_#t~post10#1_In_1| |v_thread2Thread1of1ForFork2_#t~post10#1_Out_4|)) (and .cse0 (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) .cse1 (= (+ v_~c2~0_Out_16 1) v_~c2~0_In_7) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| (ite (< 0 v_~c2~0_In_7) 1 0)) (= |v_thread2Thread1of1ForFork2_#t~post7#1_In_1| |v_thread2Thread1of1ForFork2_#t~post7#1_Out_6|) (= |v_thread2Thread1of1ForFork2_#t~post8#1_In_1| |v_thread2Thread1of1ForFork2_#t~post8#1_Out_6|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= v_~pos~0_In_12 (+ v_~pos~0_Out_32 1))))) InVars {thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_In_1|, thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_In_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_1|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_In_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_1|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_In_1|, ~pos~0=v_~pos~0_In_12, ~c2~0=v_~c2~0_In_7, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_In_1|, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_In_2|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_In_1|, thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_Out_4|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_Out_6|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_Out_6|, ~pos~0=v_~pos~0_Out_32, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_Out_4|, ~c2~0=v_~c2~0_Out_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post10#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post8#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post7#1, ~pos~0, thread2Thread1of1ForFork2_#t~post9#1, ~c2~0, thread2Thread1of1ForFork2_#t~nondet6#1] [2022-12-06 07:29:28,982 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [416] L61-->L57: Formula: (let ((.cse0 (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_In_2| 256) 0)) (.cse1 (not (= 0 (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_3| 256))))) (or (and (= |v_thread1Thread1of1ForFork1_#t~post5#1_In_2| |v_thread1Thread1of1ForFork1_#t~post5#1_Out_6|) (not .cse0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_2|) (= |v_thread1Thread1of1ForFork1_#t~post4#1_In_2| |v_thread1Thread1of1ForFork1_#t~post4#1_Out_6|) (= (+ v_~pos~0_In_10 1) v_~pos~0_Out_28) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_2|) .cse1 (= (+ v_~c1~0_In_7 1) v_~c1~0_Out_12)) (and .cse0 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (< 0 v_~c1~0_In_7) 1 0)) (= v_~c1~0_In_7 (+ v_~c1~0_Out_12 1)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) .cse1 (= |v_thread1Thread1of1ForFork1_#t~post3#1_Out_6| |v_thread1Thread1of1ForFork1_#t~post3#1_In_2|) (= |v_thread1Thread1of1ForFork1_#t~post2#1_Out_6| |v_thread1Thread1of1ForFork1_#t~post2#1_In_2|) (= v_~pos~0_In_10 (+ v_~pos~0_Out_28 1))))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_In_2|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_In_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_2|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_In_2|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_In_2|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_In_2|, ~pos~0=v_~pos~0_In_10, ~c1~0=v_~c1~0_In_7, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_2|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_6|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_Out_6|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_6|, ~pos~0=v_~pos~0_Out_28, ~c1~0=v_~c1~0_Out_12, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~nondet1#1, ~pos~0, ~c1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [428] L87-->L87: Formula: (and (let ((.cse0 (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_38| 256) 0)) (.cse1 (not (= (mod |v_thread2Thread1of1ForFork2_~cond~1#1_40| 256) 0)))) (or (and .cse0 (= v_~c2~0_120 (+ v_~c2~0_119 1)) (= v_~pos~0_232 (+ v_~pos~0_231 1)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15|) .cse1 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15| (ite (< 0 v_~c2~0_120) 1 0)) (= |v_thread2Thread1of1ForFork2_#t~post7#1_18| |v_thread2Thread1of1ForFork2_#t~post7#1_17|) (= |v_thread2Thread1of1ForFork2_#t~post8#1_18| |v_thread2Thread1of1ForFork2_#t~post8#1_17|)) (and (not .cse0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_16| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15|) (= v_~c2~0_119 (+ v_~c2~0_120 1)) (= |v_thread2Thread1of1ForFork2_#t~post10#1_15| |v_thread2Thread1of1ForFork2_#t~post10#1_16|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_16| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|) .cse1 (= |v_thread2Thread1of1ForFork2_#t~post9#1_16| |v_thread2Thread1of1ForFork2_#t~post9#1_15|) (= v_~pos~0_231 (+ v_~pos~0_232 1))))) (= |v_thread2Thread1of1ForFork2_~cond~1#1_39| v_~v_assert~0_119)) InVars {thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_40|, ~v_assert~0=v_~v_assert~0_119, thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_16|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_16|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_18|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_16|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_18|, ~pos~0=v_~pos~0_232, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_16|, ~c2~0=v_~c2~0_120, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_38|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_39|, ~v_assert~0=v_~v_assert~0_119, thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_17|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_17|, ~pos~0=v_~pos~0_231, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_15|, ~c2~0=v_~c2~0_119} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_#t~post10#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post8#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post7#1, ~pos~0, thread2Thread1of1ForFork2_#t~post9#1, ~c2~0, thread2Thread1of1ForFork2_#t~nondet6#1] [2022-12-06 07:29:29,525 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 07:29:29,526 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1746 [2022-12-06 07:29:29,526 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 61 transitions, 600 flow [2022-12-06 07:29:29,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 07:29:29,527 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:29,527 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:29,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 07:29:29,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-06 07:29:29,732 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:29,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:29,732 INFO L85 PathProgramCache]: Analyzing trace with hash -77764311, now seen corresponding path program 1 times [2022-12-06 07:29:29,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:29,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902501605] [2022-12-06 07:29:29,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:29,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:29,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:29,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:29,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902501605] [2022-12-06 07:29:29,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902501605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:29,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:29,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:29:29,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58286421] [2022-12-06 07:29:29,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:29,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:29:29,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:29,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:29:29,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:29:29,998 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 07:29:29,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 61 transitions, 600 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 07:29:29,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:29,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 07:29:29,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:30,216 INFO L130 PetriNetUnfolder]: 395/642 cut-off events. [2022-12-06 07:29:30,217 INFO L131 PetriNetUnfolder]: For 3152/3152 co-relation queries the response was YES. [2022-12-06 07:29:30,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3122 conditions, 642 events. 395/642 cut-off events. For 3152/3152 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2359 event pairs, 31 based on Foata normal form. 24/662 useless extension candidates. Maximal degree in co-relation 2885. Up to 409 conditions per place. [2022-12-06 07:29:30,221 INFO L137 encePairwiseOnDemand]: 15/31 looper letters, 48 selfloop transitions, 8 changer transitions 37/93 dead transitions. [2022-12-06 07:29:30,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 93 transitions, 991 flow [2022-12-06 07:29:30,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:29:30,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:29:30,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 72 transitions. [2022-12-06 07:29:30,223 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2903225806451613 [2022-12-06 07:29:30,223 INFO L175 Difference]: Start difference. First operand has 60 places, 61 transitions, 600 flow. Second operand 8 states and 72 transitions. [2022-12-06 07:29:30,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 93 transitions, 991 flow [2022-12-06 07:29:30,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 93 transitions, 756 flow, removed 93 selfloop flow, removed 10 redundant places. [2022-12-06 07:29:30,232 INFO L231 Difference]: Finished difference. Result has 61 places, 46 transitions, 287 flow [2022-12-06 07:29:30,233 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=287, PETRI_PLACES=61, PETRI_TRANSITIONS=46} [2022-12-06 07:29:30,233 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 31 predicate places. [2022-12-06 07:29:30,233 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:30,233 INFO L89 Accepts]: Start accepts. Operand has 61 places, 46 transitions, 287 flow [2022-12-06 07:29:30,237 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:30,237 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:30,237 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 46 transitions, 287 flow [2022-12-06 07:29:30,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 46 transitions, 287 flow [2022-12-06 07:29:30,251 INFO L130 PetriNetUnfolder]: 41/103 cut-off events. [2022-12-06 07:29:30,251 INFO L131 PetriNetUnfolder]: For 197/200 co-relation queries the response was YES. [2022-12-06 07:29:30,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353 conditions, 103 events. 41/103 cut-off events. For 197/200 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 274 event pairs, 2 based on Foata normal form. 2/103 useless extension candidates. Maximal degree in co-relation 309. Up to 38 conditions per place. [2022-12-06 07:29:30,252 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 46 transitions, 287 flow [2022-12-06 07:29:30,252 INFO L188 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-06 07:29:30,253 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:29:30,256 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-06 07:29:30,256 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 287 flow [2022-12-06 07:29:30,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 07:29:30,256 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:30,256 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:30,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 07:29:30,256 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:30,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:30,257 INFO L85 PathProgramCache]: Analyzing trace with hash -466422737, now seen corresponding path program 2 times [2022-12-06 07:29:30,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:30,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106634909] [2022-12-06 07:29:30,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:30,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:30,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:30,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:30,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106634909] [2022-12-06 07:29:30,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106634909] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:29:30,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038615172] [2022-12-06 07:29:30,530 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:29:30,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:29:30,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:29:30,531 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:29:30,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 07:29:30,625 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:29:30,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:29:30,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 07:29:30,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:29:30,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:30,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:29:31,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:31,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038615172] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:29:31,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:29:31,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-06 07:29:31,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330336956] [2022-12-06 07:29:31,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:29:31,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 07:29:31,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:31,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 07:29:31,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-12-06 07:29:31,052 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 07:29:31,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 287 flow. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 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 07:29:31,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:31,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 07:29:31,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:32,071 INFO L130 PetriNetUnfolder]: 796/1295 cut-off events. [2022-12-06 07:29:32,072 INFO L131 PetriNetUnfolder]: For 2661/2661 co-relation queries the response was YES. [2022-12-06 07:29:32,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5289 conditions, 1295 events. 796/1295 cut-off events. For 2661/2661 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5521 event pairs, 16 based on Foata normal form. 52/1343 useless extension candidates. Maximal degree in co-relation 4726. Up to 439 conditions per place. [2022-12-06 07:29:32,079 INFO L137 encePairwiseOnDemand]: 15/27 looper letters, 120 selfloop transitions, 51 changer transitions 103/274 dead transitions. [2022-12-06 07:29:32,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 274 transitions, 2187 flow [2022-12-06 07:29:32,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-06 07:29:32,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-06 07:29:32,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 248 transitions. [2022-12-06 07:29:32,082 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.328042328042328 [2022-12-06 07:29:32,083 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 287 flow. Second operand 28 states and 248 transitions. [2022-12-06 07:29:32,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 274 transitions, 2187 flow [2022-12-06 07:29:32,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 274 transitions, 2041 flow, removed 64 selfloop flow, removed 7 redundant places. [2022-12-06 07:29:32,111 INFO L231 Difference]: Finished difference. Result has 84 places, 85 transitions, 735 flow [2022-12-06 07:29:32,111 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=735, PETRI_PLACES=84, PETRI_TRANSITIONS=85} [2022-12-06 07:29:32,112 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 54 predicate places. [2022-12-06 07:29:32,112 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:32,113 INFO L89 Accepts]: Start accepts. Operand has 84 places, 85 transitions, 735 flow [2022-12-06 07:29:32,115 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:32,115 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:32,116 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 85 transitions, 735 flow [2022-12-06 07:29:32,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 85 transitions, 735 flow [2022-12-06 07:29:32,140 INFO L130 PetriNetUnfolder]: 73/189 cut-off events. [2022-12-06 07:29:32,140 INFO L131 PetriNetUnfolder]: For 773/781 co-relation queries the response was YES. [2022-12-06 07:29:32,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 800 conditions, 189 events. 73/189 cut-off events. For 773/781 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 684 event pairs, 1 based on Foata normal form. 5/187 useless extension candidates. Maximal degree in co-relation 736. Up to 77 conditions per place. [2022-12-06 07:29:32,142 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 85 transitions, 735 flow [2022-12-06 07:29:32,142 INFO L188 LiptonReduction]: Number of co-enabled transitions 432 [2022-12-06 07:29:32,498 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [317] $Ultimate##0-->L87: Formula: (= v_~v_assert~0_4 |v_thread2Thread1of1ForFork2_~cond~1#1_1|) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_1|, ~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1] and [433] $Ultimate##0-->L57: Formula: (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_74| 256) 0)) (.cse0 (not (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_67| 256) 0)))) (or (and (= v_~pos~0_253 (+ v_~pos~0_254 1)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_43| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_42|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_43| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_42|) (= |v_thread1Thread1of1ForFork1_#t~post5#1_42| |v_thread1Thread1of1ForFork1_#t~post5#1_43|) .cse0 (not .cse1) (= (+ v_~c1~0_140 1) v_~c1~0_139) (= |v_thread1Thread1of1ForFork1_#t~post4#1_43| |v_thread1Thread1of1ForFork1_#t~post4#1_42|)) (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_42| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_42|) .cse1 (= v_~pos~0_254 (+ v_~pos~0_253 1)) .cse0 (= |v_thread1Thread1of1ForFork1_#t~post2#1_47| |v_thread1Thread1of1ForFork1_#t~post2#1_46|) (= (ite (< 0 v_~c1~0_140) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_42|) (= |v_thread1Thread1of1ForFork1_#t~post3#1_47| |v_thread1Thread1of1ForFork1_#t~post3#1_46|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_42| 0)) (= (+ v_~c1~0_139 1) v_~c1~0_140)))) (= v_~v_assert~0_130 |v_thread1Thread1of1ForFork1_~cond~0#1_67|)) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_47|, ~v_assert~0=v_~v_assert~0_130, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_47|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_43|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_43|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_43|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_74|, ~pos~0=v_~pos~0_254, ~c1~0=v_~c1~0_140, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_43|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_46|, ~v_assert~0=v_~v_assert~0_130, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_46|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_42|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_42|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_42|, ~pos~0=v_~pos~0_253, ~c1~0=v_~c1~0_139, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_67|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~nondet1#1, ~pos~0, ~c1~0, thread1Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:29:32,658 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [317] $Ultimate##0-->L87: Formula: (= v_~v_assert~0_4 |v_thread2Thread1of1ForFork2_~cond~1#1_1|) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_1|, ~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1] and [432] $Ultimate##0-->L83: Formula: (and (let ((.cse1 (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_55| 256) 0)) (.cse0 (not (= (mod |v_thread2Thread1of1ForFork2_~cond~1#1_51| 256) 0)))) (or (and (= |v_thread2Thread1of1ForFork2_#t~post9#1_33| |v_thread2Thread1of1ForFork2_#t~post9#1_32|) .cse0 (= |v_thread2Thread1of1ForFork2_#t~post10#1_33| |v_thread2Thread1of1ForFork2_#t~post10#1_32|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_32|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_32|) (= v_~pos~0_249 (+ v_~pos~0_250 1)) (not .cse1) (= v_~c2~0_135 (+ v_~c2~0_136 1))) (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_32| (ite (< 0 v_~c2~0_136) 1 0)) (= |v_thread2Thread1of1ForFork2_#t~post8#1_35| |v_thread2Thread1of1ForFork2_#t~post8#1_34|) (= v_~pos~0_250 (+ v_~pos~0_249 1)) .cse1 .cse0 (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_32| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_32| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_32|) (= |v_thread2Thread1of1ForFork2_#t~post7#1_35| |v_thread2Thread1of1ForFork2_#t~post7#1_34|) (= v_~c2~0_136 (+ v_~c2~0_135 1))))) (= v_~v_assert~0_128 |v_thread1Thread1of1ForFork1_~cond~0#1_65|)) InVars {thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_51|, thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_33|, ~v_assert~0=v_~v_assert~0_128, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_35|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_35|, ~pos~0=v_~pos~0_250, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_33|, ~c2~0=v_~c2~0_136, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_55|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_51|, thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_32|, ~v_assert~0=v_~v_assert~0_128, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_32|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_34|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_32|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_34|, ~pos~0=v_~pos~0_249, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_32|, ~c2~0=v_~c2~0_135, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_65|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post10#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post8#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post7#1, ~pos~0, thread2Thread1of1ForFork2_#t~post9#1, ~c2~0, thread2Thread1of1ForFork2_#t~nondet6#1, thread1Thread1of1ForFork1_~cond~0#1] [2022-12-06 07:29:33,143 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [401] $Ultimate##0-->thread3EXIT: Formula: (and (= 0 |v_thread3Thread1of1ForFork0_#res.base_13|) (= |v_thread3Thread1of1ForFork0_#res.offset_13| 0) (= (ite (= (ite (<= 0 v_~pos~0_145) 1 0) 0) 0 1) v_~v_assert~0_46)) InVars {~pos~0=v_~pos~0_145} OutVars{~v_assert~0=v_~v_assert~0_46, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_13|, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_13|, ~pos~0=v_~pos~0_145} AuxVars[] AssignedVars[~v_assert~0, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [416] L61-->L57: Formula: (let ((.cse0 (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_In_2| 256) 0)) (.cse1 (not (= 0 (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_3| 256))))) (or (and (= |v_thread1Thread1of1ForFork1_#t~post5#1_In_2| |v_thread1Thread1of1ForFork1_#t~post5#1_Out_6|) (not .cse0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_2|) (= |v_thread1Thread1of1ForFork1_#t~post4#1_In_2| |v_thread1Thread1of1ForFork1_#t~post4#1_Out_6|) (= (+ v_~pos~0_In_10 1) v_~pos~0_Out_28) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_2|) .cse1 (= (+ v_~c1~0_In_7 1) v_~c1~0_Out_12)) (and .cse0 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (< 0 v_~c1~0_In_7) 1 0)) (= v_~c1~0_In_7 (+ v_~c1~0_Out_12 1)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) .cse1 (= |v_thread1Thread1of1ForFork1_#t~post3#1_Out_6| |v_thread1Thread1of1ForFork1_#t~post3#1_In_2|) (= |v_thread1Thread1of1ForFork1_#t~post2#1_Out_6| |v_thread1Thread1of1ForFork1_#t~post2#1_In_2|) (= v_~pos~0_In_10 (+ v_~pos~0_Out_28 1))))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_In_2|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_In_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_2|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_In_2|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_In_2|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_In_2|, ~pos~0=v_~pos~0_In_10, ~c1~0=v_~c1~0_In_7, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_2|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_6|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_Out_6|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_6|, ~pos~0=v_~pos~0_Out_28, ~c1~0=v_~c1~0_Out_12, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~nondet1#1, ~pos~0, ~c1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:29:33,299 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [401] $Ultimate##0-->thread3EXIT: Formula: (and (= 0 |v_thread3Thread1of1ForFork0_#res.base_13|) (= |v_thread3Thread1of1ForFork0_#res.offset_13| 0) (= (ite (= (ite (<= 0 v_~pos~0_145) 1 0) 0) 0 1) v_~v_assert~0_46)) InVars {~pos~0=v_~pos~0_145} OutVars{~v_assert~0=v_~v_assert~0_46, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_13|, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_13|, ~pos~0=v_~pos~0_145} AuxVars[] AssignedVars[~v_assert~0, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [437] L83-->L87: Formula: (and (= |v_thread2Thread1of1ForFork2_~cond~1#1_67| v_~v_assert~0_137) (let ((.cse0 (not (= (mod v_~v_assert~0_137 256) 0))) (.cse1 (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_74| 256) 0))) (or (and (= |v_thread2Thread1of1ForFork2_#t~post7#1_56| |v_thread2Thread1of1ForFork2_#t~post7#1_55|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_53|) .cse0 (= (ite (< 0 v_~c2~0_156) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) .cse1 (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_53| 0)) (= |v_thread2Thread1of1ForFork2_#t~post8#1_56| |v_thread2Thread1of1ForFork2_#t~post8#1_55|) (= v_~pos~0_278 (+ v_~pos~0_277 1)) (= v_~c2~0_156 (+ v_~c2~0_155 1))) (and (= |v_thread2Thread1of1ForFork2_#t~post9#1_54| |v_thread2Thread1of1ForFork2_#t~post9#1_53|) (= |v_thread2Thread1of1ForFork2_#t~post10#1_54| |v_thread2Thread1of1ForFork2_#t~post10#1_53|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_54| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= v_~pos~0_277 (+ v_~pos~0_278 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_54| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_53|) .cse0 (not .cse1) (= (+ v_~c2~0_156 1) v_~c2~0_155))))) InVars {~v_assert~0=v_~v_assert~0_137, thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_54|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_54|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_56|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_54|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_56|, ~pos~0=v_~pos~0_278, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_54|, ~c2~0=v_~c2~0_156, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_74|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_67|, ~v_assert~0=v_~v_assert~0_137, thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_53|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_53|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_55|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_55|, ~pos~0=v_~pos~0_277, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_53|, ~c2~0=v_~c2~0_155} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_#t~post10#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post8#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post7#1, ~pos~0, thread2Thread1of1ForFork2_#t~post9#1, ~c2~0, thread2Thread1of1ForFork2_#t~nondet6#1] [2022-12-06 07:29:33,465 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [401] $Ultimate##0-->thread3EXIT: Formula: (and (= 0 |v_thread3Thread1of1ForFork0_#res.base_13|) (= |v_thread3Thread1of1ForFork0_#res.offset_13| 0) (= (ite (= (ite (<= 0 v_~pos~0_145) 1 0) 0) 0 1) v_~v_assert~0_46)) InVars {~pos~0=v_~pos~0_145} OutVars{~v_assert~0=v_~v_assert~0_46, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_13|, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_13|, ~pos~0=v_~pos~0_145} AuxVars[] AssignedVars[~v_assert~0, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [438] L83-->L87: Formula: (and (= |v_thread2Thread1of1ForFork2_~cond~1#1_71| v_~v_assert~0_139) (let ((.cse0 (not (= (mod v_~v_assert~0_139 256) 0))) (.cse1 (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_78| 256) 0))) (or (and .cse0 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_58| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_57|) (= |v_thread2Thread1of1ForFork2_#t~post10#1_58| |v_thread2Thread1of1ForFork2_#t~post10#1_57|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_58| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_57|) (= |v_thread2Thread1of1ForFork2_#t~post9#1_58| |v_thread2Thread1of1ForFork2_#t~post9#1_57|) (not .cse1) (= v_~pos~0_281 (+ v_~pos~0_282 1)) (= v_~c2~0_159 (+ v_~c2~0_160 1))) (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_57| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_57|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_57| (ite (< 0 v_~c2~0_160) 1 0)) .cse0 (= v_~pos~0_282 (+ v_~pos~0_281 1)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_57| 0)) .cse1 (= v_~c2~0_160 (+ v_~c2~0_159 1)) (= |v_thread2Thread1of1ForFork2_#t~post8#1_59| |v_thread2Thread1of1ForFork2_#t~post8#1_60|) (= |v_thread2Thread1of1ForFork2_#t~post7#1_59| |v_thread2Thread1of1ForFork2_#t~post7#1_60|))))) InVars {~v_assert~0=v_~v_assert~0_139, thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_58|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_58|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_60|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_58|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_60|, ~pos~0=v_~pos~0_282, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_58|, ~c2~0=v_~c2~0_160, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_78|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_71|, ~v_assert~0=v_~v_assert~0_139, thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_57|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_57|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_59|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_57|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_59|, ~pos~0=v_~pos~0_281, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_57|, ~c2~0=v_~c2~0_159} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_#t~post10#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post8#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post7#1, ~pos~0, thread2Thread1of1ForFork2_#t~post9#1, ~c2~0, thread2Thread1of1ForFork2_#t~nondet6#1] [2022-12-06 07:29:33,621 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [401] $Ultimate##0-->thread3EXIT: Formula: (and (= 0 |v_thread3Thread1of1ForFork0_#res.base_13|) (= |v_thread3Thread1of1ForFork0_#res.offset_13| 0) (= (ite (= (ite (<= 0 v_~pos~0_145) 1 0) 0) 0 1) v_~v_assert~0_46)) InVars {~pos~0=v_~pos~0_145} OutVars{~v_assert~0=v_~v_assert~0_46, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_13|, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_13|, ~pos~0=v_~pos~0_145} AuxVars[] AssignedVars[~v_assert~0, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [329] L83-->L87: Formula: (= v_~v_assert~0_3 |v_thread2Thread1of1ForFork2_~cond~1#1_7|) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_7|, ~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1] [2022-12-06 07:29:33,641 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [401] $Ultimate##0-->thread3EXIT: Formula: (and (= 0 |v_thread3Thread1of1ForFork0_#res.base_13|) (= |v_thread3Thread1of1ForFork0_#res.offset_13| 0) (= (ite (= (ite (<= 0 v_~pos~0_145) 1 0) 0) 0 1) v_~v_assert~0_46)) InVars {~pos~0=v_~pos~0_145} OutVars{~v_assert~0=v_~v_assert~0_46, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_13|, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_13|, ~pos~0=v_~pos~0_145} AuxVars[] AssignedVars[~v_assert~0, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [417] L87-->L83: Formula: (let ((.cse0 (not (= (mod |v_thread2Thread1of1ForFork2_~cond~1#1_In_1| 256) 0))) (.cse1 (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_In_2| 256) 0))) (or (and .cse0 (= (+ v_~pos~0_In_12 1) v_~pos~0_Out_32) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_1|) (not .cse1) (= v_~c2~0_Out_16 (+ v_~c2~0_In_7 1)) (= |v_thread2Thread1of1ForFork2_#t~post9#1_Out_4| |v_thread2Thread1of1ForFork2_#t~post9#1_In_1|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork2_#t~post10#1_In_1| |v_thread2Thread1of1ForFork2_#t~post10#1_Out_4|)) (and .cse0 (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) .cse1 (= (+ v_~c2~0_Out_16 1) v_~c2~0_In_7) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| (ite (< 0 v_~c2~0_In_7) 1 0)) (= |v_thread2Thread1of1ForFork2_#t~post7#1_In_1| |v_thread2Thread1of1ForFork2_#t~post7#1_Out_6|) (= |v_thread2Thread1of1ForFork2_#t~post8#1_In_1| |v_thread2Thread1of1ForFork2_#t~post8#1_Out_6|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= v_~pos~0_In_12 (+ v_~pos~0_Out_32 1))))) InVars {thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_In_1|, thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_In_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_1|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_In_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_1|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_In_1|, ~pos~0=v_~pos~0_In_12, ~c2~0=v_~c2~0_In_7, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_In_1|, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_In_2|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_In_1|, thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_Out_4|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_Out_6|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_Out_6|, ~pos~0=v_~pos~0_Out_32, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_Out_4|, ~c2~0=v_~c2~0_Out_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post10#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post8#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post7#1, ~pos~0, thread2Thread1of1ForFork2_#t~post9#1, ~c2~0, thread2Thread1of1ForFork2_#t~nondet6#1] [2022-12-06 07:29:33,787 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:29:33,788 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1676 [2022-12-06 07:29:33,788 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 85 transitions, 801 flow [2022-12-06 07:29:33,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 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 07:29:33,789 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:33,789 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:33,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 07:29:33,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-06 07:29:33,992 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:33,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:33,992 INFO L85 PathProgramCache]: Analyzing trace with hash -27986208, now seen corresponding path program 1 times [2022-12-06 07:29:33,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:33,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535724395] [2022-12-06 07:29:33,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:33,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:34,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:34,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:34,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535724395] [2022-12-06 07:29:34,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535724395] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:29:34,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766516740] [2022-12-06 07:29:34,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:34,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:29:34,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:29:34,392 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:29:34,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 07:29:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:34,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 07:29:34,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:29:34,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:34,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:29:35,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:35,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766516740] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:29:35,089 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:29:35,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-12-06 07:29:35,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94098586] [2022-12-06 07:29:35,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:29:35,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 07:29:35,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:35,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 07:29:35,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-12-06 07:29:35,091 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 07:29:35,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 85 transitions, 801 flow. Second operand has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 17 states have internal predecessors, (48), 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 07:29:35,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:35,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 07:29:35,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:37,151 INFO L130 PetriNetUnfolder]: 1356/2233 cut-off events. [2022-12-06 07:29:37,151 INFO L131 PetriNetUnfolder]: For 13112/13112 co-relation queries the response was YES. [2022-12-06 07:29:37,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10761 conditions, 2233 events. 1356/2233 cut-off events. For 13112/13112 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11124 event pairs, 6 based on Foata normal form. 80/2305 useless extension candidates. Maximal degree in co-relation 9642. Up to 857 conditions per place. [2022-12-06 07:29:37,169 INFO L137 encePairwiseOnDemand]: 16/34 looper letters, 205 selfloop transitions, 87 changer transitions 187/479 dead transitions. [2022-12-06 07:29:37,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 479 transitions, 4356 flow [2022-12-06 07:29:37,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-12-06 07:29:37,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2022-12-06 07:29:37,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 426 transitions. [2022-12-06 07:29:37,172 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25570228091236497 [2022-12-06 07:29:37,172 INFO L175 Difference]: Start difference. First operand has 74 places, 85 transitions, 801 flow. Second operand 49 states and 426 transitions. [2022-12-06 07:29:37,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 479 transitions, 4356 flow [2022-12-06 07:29:37,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 479 transitions, 3860 flow, removed 200 selfloop flow, removed 15 redundant places. [2022-12-06 07:29:37,208 INFO L231 Difference]: Finished difference. Result has 119 places, 140 transitions, 1367 flow [2022-12-06 07:29:37,209 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=1367, PETRI_PLACES=119, PETRI_TRANSITIONS=140} [2022-12-06 07:29:37,209 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 89 predicate places. [2022-12-06 07:29:37,209 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:37,209 INFO L89 Accepts]: Start accepts. Operand has 119 places, 140 transitions, 1367 flow [2022-12-06 07:29:37,210 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:37,211 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:37,211 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 140 transitions, 1367 flow [2022-12-06 07:29:37,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 140 transitions, 1367 flow [2022-12-06 07:29:37,262 INFO L130 PetriNetUnfolder]: 126/360 cut-off events. [2022-12-06 07:29:37,262 INFO L131 PetriNetUnfolder]: For 1568/1581 co-relation queries the response was YES. [2022-12-06 07:29:37,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1534 conditions, 360 events. 126/360 cut-off events. For 1568/1581 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1890 event pairs, 4 based on Foata normal form. 9/357 useless extension candidates. Maximal degree in co-relation 1491. Up to 105 conditions per place. [2022-12-06 07:29:37,266 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 140 transitions, 1367 flow [2022-12-06 07:29:37,266 INFO L188 LiptonReduction]: Number of co-enabled transitions 748 [2022-12-06 07:29:37,554 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [401] $Ultimate##0-->thread3EXIT: Formula: (and (= 0 |v_thread3Thread1of1ForFork0_#res.base_13|) (= |v_thread3Thread1of1ForFork0_#res.offset_13| 0) (= (ite (= (ite (<= 0 v_~pos~0_145) 1 0) 0) 0 1) v_~v_assert~0_46)) InVars {~pos~0=v_~pos~0_145} OutVars{~v_assert~0=v_~v_assert~0_46, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_13|, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_13|, ~pos~0=v_~pos~0_145} AuxVars[] AssignedVars[~v_assert~0, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [417] L87-->L83: Formula: (let ((.cse0 (not (= (mod |v_thread2Thread1of1ForFork2_~cond~1#1_In_1| 256) 0))) (.cse1 (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_In_2| 256) 0))) (or (and .cse0 (= (+ v_~pos~0_In_12 1) v_~pos~0_Out_32) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_1|) (not .cse1) (= v_~c2~0_Out_16 (+ v_~c2~0_In_7 1)) (= |v_thread2Thread1of1ForFork2_#t~post9#1_Out_4| |v_thread2Thread1of1ForFork2_#t~post9#1_In_1|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork2_#t~post10#1_In_1| |v_thread2Thread1of1ForFork2_#t~post10#1_Out_4|)) (and .cse0 (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) .cse1 (= (+ v_~c2~0_Out_16 1) v_~c2~0_In_7) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| (ite (< 0 v_~c2~0_In_7) 1 0)) (= |v_thread2Thread1of1ForFork2_#t~post7#1_In_1| |v_thread2Thread1of1ForFork2_#t~post7#1_Out_6|) (= |v_thread2Thread1of1ForFork2_#t~post8#1_In_1| |v_thread2Thread1of1ForFork2_#t~post8#1_Out_6|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= v_~pos~0_In_12 (+ v_~pos~0_Out_32 1))))) InVars {thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_In_1|, thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_In_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_1|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_In_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_1|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_In_1|, ~pos~0=v_~pos~0_In_12, ~c2~0=v_~c2~0_In_7, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_In_1|, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_In_2|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_In_1|, thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_Out_4|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_Out_6|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_Out_6|, ~pos~0=v_~pos~0_Out_32, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_Out_4|, ~c2~0=v_~c2~0_Out_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post10#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post8#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post7#1, ~pos~0, thread2Thread1of1ForFork2_#t~post9#1, ~c2~0, thread2Thread1of1ForFork2_#t~nondet6#1] [2022-12-06 07:29:37,700 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [401] $Ultimate##0-->thread3EXIT: Formula: (and (= 0 |v_thread3Thread1of1ForFork0_#res.base_13|) (= |v_thread3Thread1of1ForFork0_#res.offset_13| 0) (= (ite (= (ite (<= 0 v_~pos~0_145) 1 0) 0) 0 1) v_~v_assert~0_46)) InVars {~pos~0=v_~pos~0_145} OutVars{~v_assert~0=v_~v_assert~0_46, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_13|, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_13|, ~pos~0=v_~pos~0_145} AuxVars[] AssignedVars[~v_assert~0, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [329] L83-->L87: Formula: (= v_~v_assert~0_3 |v_thread2Thread1of1ForFork2_~cond~1#1_7|) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_7|, ~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1] [2022-12-06 07:29:37,717 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [401] $Ultimate##0-->thread3EXIT: Formula: (and (= 0 |v_thread3Thread1of1ForFork0_#res.base_13|) (= |v_thread3Thread1of1ForFork0_#res.offset_13| 0) (= (ite (= (ite (<= 0 v_~pos~0_145) 1 0) 0) 0 1) v_~v_assert~0_46)) InVars {~pos~0=v_~pos~0_145} OutVars{~v_assert~0=v_~v_assert~0_46, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_13|, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_13|, ~pos~0=v_~pos~0_145} AuxVars[] AssignedVars[~v_assert~0, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [416] L61-->L57: Formula: (let ((.cse0 (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_In_2| 256) 0)) (.cse1 (not (= 0 (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_3| 256))))) (or (and (= |v_thread1Thread1of1ForFork1_#t~post5#1_In_2| |v_thread1Thread1of1ForFork1_#t~post5#1_Out_6|) (not .cse0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_2|) (= |v_thread1Thread1of1ForFork1_#t~post4#1_In_2| |v_thread1Thread1of1ForFork1_#t~post4#1_Out_6|) (= (+ v_~pos~0_In_10 1) v_~pos~0_Out_28) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_2|) .cse1 (= (+ v_~c1~0_In_7 1) v_~c1~0_Out_12)) (and .cse0 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (< 0 v_~c1~0_In_7) 1 0)) (= v_~c1~0_In_7 (+ v_~c1~0_Out_12 1)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) .cse1 (= |v_thread1Thread1of1ForFork1_#t~post3#1_Out_6| |v_thread1Thread1of1ForFork1_#t~post3#1_In_2|) (= |v_thread1Thread1of1ForFork1_#t~post2#1_Out_6| |v_thread1Thread1of1ForFork1_#t~post2#1_In_2|) (= v_~pos~0_In_10 (+ v_~pos~0_Out_28 1))))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_In_2|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_In_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_2|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_In_2|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_In_2|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_In_2|, ~pos~0=v_~pos~0_In_10, ~c1~0=v_~c1~0_In_7, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_2|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_6|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_Out_6|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_6|, ~pos~0=v_~pos~0_Out_28, ~c1~0=v_~c1~0_Out_12, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~nondet1#1, ~pos~0, ~c1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:29:37,861 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [401] $Ultimate##0-->thread3EXIT: Formula: (and (= 0 |v_thread3Thread1of1ForFork0_#res.base_13|) (= |v_thread3Thread1of1ForFork0_#res.offset_13| 0) (= (ite (= (ite (<= 0 v_~pos~0_145) 1 0) 0) 0 1) v_~v_assert~0_46)) InVars {~pos~0=v_~pos~0_145} OutVars{~v_assert~0=v_~v_assert~0_46, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_13|, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_13|, ~pos~0=v_~pos~0_145} AuxVars[] AssignedVars[~v_assert~0, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [448] L83-->L87: Formula: (and (let ((.cse0 (not (= (mod v_~v_assert~0_160 256) 0))) (.cse1 (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_107| 256) 0))) (or (and (= v_~pos~0_326 (+ v_~pos~0_325 1)) .cse0 (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_86| 0)) .cse1 (= |v_thread2Thread1of1ForFork2_#t~post7#1_89| |v_thread2Thread1of1ForFork2_#t~post7#1_88|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_86| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_86|) (= |v_thread2Thread1of1ForFork2_#t~post8#1_89| |v_thread2Thread1of1ForFork2_#t~post8#1_88|) (= v_~c2~0_188 (+ v_~c2~0_187 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_86| (ite (< 0 v_~c2~0_188) 1 0))) (and .cse0 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_87| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_86|) (= |v_thread2Thread1of1ForFork2_#t~post9#1_87| |v_thread2Thread1of1ForFork2_#t~post9#1_86|) (not .cse1) (= |v_thread2Thread1of1ForFork2_#t~post10#1_87| |v_thread2Thread1of1ForFork2_#t~post10#1_86|) (= v_~pos~0_325 (+ v_~pos~0_326 1)) (= v_~c2~0_187 (+ v_~c2~0_188 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_87| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_86|)))) (= |v_thread2Thread1of1ForFork2_~cond~1#1_93| v_~v_assert~0_160)) InVars {~v_assert~0=v_~v_assert~0_160, thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_87|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_87|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_89|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_87|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_89|, ~pos~0=v_~pos~0_326, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_87|, ~c2~0=v_~c2~0_188, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_107|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_93|, ~v_assert~0=v_~v_assert~0_160, thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_86|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_86|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_88|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_86|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_88|, ~pos~0=v_~pos~0_325, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_86|, ~c2~0=v_~c2~0_187} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_#t~post10#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post8#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post7#1, ~pos~0, thread2Thread1of1ForFork2_#t~post9#1, ~c2~0, thread2Thread1of1ForFork2_#t~nondet6#1] [2022-12-06 07:29:38,012 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [401] $Ultimate##0-->thread3EXIT: Formula: (and (= 0 |v_thread3Thread1of1ForFork0_#res.base_13|) (= |v_thread3Thread1of1ForFork0_#res.offset_13| 0) (= (ite (= (ite (<= 0 v_~pos~0_145) 1 0) 0) 0 1) v_~v_assert~0_46)) InVars {~pos~0=v_~pos~0_145} OutVars{~v_assert~0=v_~v_assert~0_46, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_13|, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_13|, ~pos~0=v_~pos~0_145} AuxVars[] AssignedVars[~v_assert~0, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [449] L83-->L87: Formula: (and (let ((.cse1 (not (= (mod v_~v_assert~0_162 256) 0))) (.cse0 (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_111| 256) 0))) (or (and (= |v_thread2Thread1of1ForFork2_#t~post9#1_91| |v_thread2Thread1of1ForFork2_#t~post9#1_90|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_91| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_90|) (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~post10#1_91| |v_thread2Thread1of1ForFork2_#t~post10#1_90|) (= v_~pos~0_329 (+ v_~pos~0_330 1)) .cse1 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_91| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_90|) (= v_~c2~0_191 (+ v_~c2~0_192 1))) (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_90| 0)) (= v_~pos~0_330 (+ v_~pos~0_329 1)) (= |v_thread2Thread1of1ForFork2_#t~post7#1_93| |v_thread2Thread1of1ForFork2_#t~post7#1_92|) .cse1 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_90| (ite (< 0 v_~c2~0_192) 1 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_90| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_90|) (= |v_thread2Thread1of1ForFork2_#t~post8#1_93| |v_thread2Thread1of1ForFork2_#t~post8#1_92|) .cse0 (= v_~c2~0_192 (+ v_~c2~0_191 1))))) (= |v_thread2Thread1of1ForFork2_~cond~1#1_97| v_~v_assert~0_162)) InVars {~v_assert~0=v_~v_assert~0_162, thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_91|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_91|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_93|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_91|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_93|, ~pos~0=v_~pos~0_330, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_91|, ~c2~0=v_~c2~0_192, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_111|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_97|, ~v_assert~0=v_~v_assert~0_162, thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_90|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_90|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_92|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_90|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_92|, ~pos~0=v_~pos~0_329, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_90|, ~c2~0=v_~c2~0_191} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_#t~post10#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post8#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post7#1, ~pos~0, thread2Thread1of1ForFork2_#t~post9#1, ~c2~0, thread2Thread1of1ForFork2_#t~nondet6#1] [2022-12-06 07:29:38,439 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:29:38,440 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1231 [2022-12-06 07:29:38,440 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 140 transitions, 1402 flow [2022-12-06 07:29:38,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 17 states have internal predecessors, (48), 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 07:29:38,440 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:38,441 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:38,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 07:29:38,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:29:38,646 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:38,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:38,646 INFO L85 PathProgramCache]: Analyzing trace with hash 499887013, now seen corresponding path program 1 times [2022-12-06 07:29:38,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:38,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614436216] [2022-12-06 07:29:38,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:38,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:38,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:38,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:38,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614436216] [2022-12-06 07:29:38,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614436216] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:29:38,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63039762] [2022-12-06 07:29:38,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:38,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:29:38,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:29:38,987 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:29:38,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 07:29:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:39,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 07:29:39,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:29:39,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:39,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:29:39,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:39,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63039762] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:29:39,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:29:39,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-06 07:29:39,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250045689] [2022-12-06 07:29:39,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:29:39,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 07:29:39,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:39,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 07:29:39,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2022-12-06 07:29:39,661 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 39 [2022-12-06 07:29:39,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 140 transitions, 1402 flow. Second operand has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 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 07:29:39,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:39,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 39 [2022-12-06 07:29:39,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:41,057 INFO L130 PetriNetUnfolder]: 1450/2619 cut-off events. [2022-12-06 07:29:41,057 INFO L131 PetriNetUnfolder]: For 17218/17260 co-relation queries the response was YES. [2022-12-06 07:29:41,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12968 conditions, 2619 events. 1450/2619 cut-off events. For 17218/17260 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 15765 event pairs, 18 based on Foata normal form. 100/2677 useless extension candidates. Maximal degree in co-relation 12868. Up to 799 conditions per place. [2022-12-06 07:29:41,077 INFO L137 encePairwiseOnDemand]: 18/39 looper letters, 247 selfloop transitions, 241 changer transitions 9/501 dead transitions. [2022-12-06 07:29:41,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 501 transitions, 5244 flow [2022-12-06 07:29:41,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-06 07:29:41,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-06 07:29:41,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 343 transitions. [2022-12-06 07:29:41,080 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32573599240265905 [2022-12-06 07:29:41,080 INFO L175 Difference]: Start difference. First operand has 98 places, 140 transitions, 1402 flow. Second operand 27 states and 343 transitions. [2022-12-06 07:29:41,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 501 transitions, 5244 flow [2022-12-06 07:29:41,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 501 transitions, 4260 flow, removed 454 selfloop flow, removed 19 redundant places. [2022-12-06 07:29:41,163 INFO L231 Difference]: Finished difference. Result has 116 places, 321 transitions, 3437 flow [2022-12-06 07:29:41,164 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1002, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=3437, PETRI_PLACES=116, PETRI_TRANSITIONS=321} [2022-12-06 07:29:41,164 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 86 predicate places. [2022-12-06 07:29:41,164 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:41,164 INFO L89 Accepts]: Start accepts. Operand has 116 places, 321 transitions, 3437 flow [2022-12-06 07:29:41,166 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:41,166 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:41,166 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 321 transitions, 3437 flow [2022-12-06 07:29:41,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 321 transitions, 3437 flow [2022-12-06 07:29:41,263 INFO L130 PetriNetUnfolder]: 287/784 cut-off events. [2022-12-06 07:29:41,263 INFO L131 PetriNetUnfolder]: For 3339/3368 co-relation queries the response was YES. [2022-12-06 07:29:41,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3394 conditions, 784 events. 287/784 cut-off events. For 3339/3368 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5305 event pairs, 5 based on Foata normal form. 18/779 useless extension candidates. Maximal degree in co-relation 3200. Up to 198 conditions per place. [2022-12-06 07:29:41,271 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 321 transitions, 3437 flow [2022-12-06 07:29:41,271 INFO L188 LiptonReduction]: Number of co-enabled transitions 1598 [2022-12-06 07:29:41,272 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [451] $Ultimate##0-->L87: Formula: (and (= v_~v_assert~0_166 |v_thread2Thread1of1ForFork2_~cond~1#1_103|) (= |v_thread3Thread1of1ForFork0_#res.offset_68| 0) (= 0 |v_thread3Thread1of1ForFork0_#res.base_68|) (= v_~v_assert~0_166 (ite (= (ite (<= 0 v_~pos~0_337) 1 0) 0) 0 1))) InVars {~pos~0=v_~pos~0_337} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_103|, ~v_assert~0=v_~v_assert~0_166, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_68|, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_68|, ~pos~0=v_~pos~0_337} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1, ~v_assert~0, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [416] L61-->L57: Formula: (let ((.cse0 (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_In_2| 256) 0)) (.cse1 (not (= 0 (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_3| 256))))) (or (and (= |v_thread1Thread1of1ForFork1_#t~post5#1_In_2| |v_thread1Thread1of1ForFork1_#t~post5#1_Out_6|) (not .cse0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_2|) (= |v_thread1Thread1of1ForFork1_#t~post4#1_In_2| |v_thread1Thread1of1ForFork1_#t~post4#1_Out_6|) (= (+ v_~pos~0_In_10 1) v_~pos~0_Out_28) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_2|) .cse1 (= (+ v_~c1~0_In_7 1) v_~c1~0_Out_12)) (and .cse0 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (< 0 v_~c1~0_In_7) 1 0)) (= v_~c1~0_In_7 (+ v_~c1~0_Out_12 1)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) .cse1 (= |v_thread1Thread1of1ForFork1_#t~post3#1_Out_6| |v_thread1Thread1of1ForFork1_#t~post3#1_In_2|) (= |v_thread1Thread1of1ForFork1_#t~post2#1_Out_6| |v_thread1Thread1of1ForFork1_#t~post2#1_In_2|) (= v_~pos~0_In_10 (+ v_~pos~0_Out_28 1))))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_In_2|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_In_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_2|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_In_2|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_In_2|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_In_2|, ~pos~0=v_~pos~0_In_10, ~c1~0=v_~c1~0_In_7, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_2|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_6|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_Out_6|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_6|, ~pos~0=v_~pos~0_Out_28, ~c1~0=v_~c1~0_Out_12, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~nondet1#1, ~pos~0, ~c1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:29:41,741 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [329] L83-->L87: Formula: (= v_~v_assert~0_3 |v_thread2Thread1of1ForFork2_~cond~1#1_7|) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_7|, ~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1] and [416] L61-->L57: Formula: (let ((.cse0 (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_In_2| 256) 0)) (.cse1 (not (= 0 (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_3| 256))))) (or (and (= |v_thread1Thread1of1ForFork1_#t~post5#1_In_2| |v_thread1Thread1of1ForFork1_#t~post5#1_Out_6|) (not .cse0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_2|) (= |v_thread1Thread1of1ForFork1_#t~post4#1_In_2| |v_thread1Thread1of1ForFork1_#t~post4#1_Out_6|) (= (+ v_~pos~0_In_10 1) v_~pos~0_Out_28) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_2|) .cse1 (= (+ v_~c1~0_In_7 1) v_~c1~0_Out_12)) (and .cse0 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (< 0 v_~c1~0_In_7) 1 0)) (= v_~c1~0_In_7 (+ v_~c1~0_Out_12 1)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) .cse1 (= |v_thread1Thread1of1ForFork1_#t~post3#1_Out_6| |v_thread1Thread1of1ForFork1_#t~post3#1_In_2|) (= |v_thread1Thread1of1ForFork1_#t~post2#1_Out_6| |v_thread1Thread1of1ForFork1_#t~post2#1_In_2|) (= v_~pos~0_In_10 (+ v_~pos~0_Out_28 1))))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_In_2|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_In_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_2|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_In_2|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_In_2|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_In_2|, ~pos~0=v_~pos~0_In_10, ~c1~0=v_~c1~0_In_7, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_2|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_6|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_Out_6|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_6|, ~pos~0=v_~pos~0_Out_28, ~c1~0=v_~c1~0_Out_12, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~nondet1#1, ~pos~0, ~c1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:29:42,045 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [329] L83-->L87: Formula: (= v_~v_assert~0_3 |v_thread2Thread1of1ForFork2_~cond~1#1_7|) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_7|, ~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1] and [416] L61-->L57: Formula: (let ((.cse0 (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_In_2| 256) 0)) (.cse1 (not (= 0 (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_3| 256))))) (or (and (= |v_thread1Thread1of1ForFork1_#t~post5#1_In_2| |v_thread1Thread1of1ForFork1_#t~post5#1_Out_6|) (not .cse0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_2|) (= |v_thread1Thread1of1ForFork1_#t~post4#1_In_2| |v_thread1Thread1of1ForFork1_#t~post4#1_Out_6|) (= (+ v_~pos~0_In_10 1) v_~pos~0_Out_28) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_2|) .cse1 (= (+ v_~c1~0_In_7 1) v_~c1~0_Out_12)) (and .cse0 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (< 0 v_~c1~0_In_7) 1 0)) (= v_~c1~0_In_7 (+ v_~c1~0_Out_12 1)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) .cse1 (= |v_thread1Thread1of1ForFork1_#t~post3#1_Out_6| |v_thread1Thread1of1ForFork1_#t~post3#1_In_2|) (= |v_thread1Thread1of1ForFork1_#t~post2#1_Out_6| |v_thread1Thread1of1ForFork1_#t~post2#1_In_2|) (= v_~pos~0_In_10 (+ v_~pos~0_Out_28 1))))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_In_2|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_In_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_2|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_In_2|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_In_2|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_In_2|, ~pos~0=v_~pos~0_In_10, ~c1~0=v_~c1~0_In_7, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_2|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_6|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_Out_6|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_6|, ~pos~0=v_~pos~0_Out_28, ~c1~0=v_~c1~0_Out_12, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~nondet1#1, ~pos~0, ~c1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:29:42,351 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [427] L61-->L61: Formula: (and (let ((.cse1 (not (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_57| 256) 0))) (.cse0 (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_68| 256) 0))) (or (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_36| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (= |v_thread1Thread1of1ForFork1_#t~post4#1_36| |v_thread1Thread1of1ForFork1_#t~post4#1_35|) (= v_~pos~0_227 (+ v_~pos~0_228 1)) (= |v_thread1Thread1of1ForFork1_#t~post5#1_36| |v_thread1Thread1of1ForFork1_#t~post5#1_35|) (not .cse0) .cse1 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_36| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_35|) (= (+ v_~c1~0_134 1) v_~c1~0_133)) (and (= v_~pos~0_228 (+ v_~pos~0_227 1)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_35|) (= (+ v_~c1~0_133 1) v_~c1~0_134) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| 0)) (= |v_thread1Thread1of1ForFork1_#t~post2#1_40| |v_thread1Thread1of1ForFork1_#t~post2#1_39|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35| (ite (< 0 v_~c1~0_134) 1 0)) (= |v_thread1Thread1of1ForFork1_#t~post3#1_39| |v_thread1Thread1of1ForFork1_#t~post3#1_40|) .cse1 .cse0))) (= v_~v_assert~0_117 |v_thread1Thread1of1ForFork1_~cond~0#1_56|)) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_40|, ~v_assert~0=v_~v_assert~0_117, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_40|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_36|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_36|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_36|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_68|, ~pos~0=v_~pos~0_228, ~c1~0=v_~c1~0_134, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_57|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_36|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_39|, ~v_assert~0=v_~v_assert~0_117, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_35|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_35|, ~pos~0=v_~pos~0_227, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_56|, ~c1~0=v_~c1~0_133, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_35|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~nondet1#1, ~pos~0, thread1Thread1of1ForFork1_~cond~0#1, ~c1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [428] L87-->L87: Formula: (and (let ((.cse0 (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_38| 256) 0)) (.cse1 (not (= (mod |v_thread2Thread1of1ForFork2_~cond~1#1_40| 256) 0)))) (or (and .cse0 (= v_~c2~0_120 (+ v_~c2~0_119 1)) (= v_~pos~0_232 (+ v_~pos~0_231 1)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15|) .cse1 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15| (ite (< 0 v_~c2~0_120) 1 0)) (= |v_thread2Thread1of1ForFork2_#t~post7#1_18| |v_thread2Thread1of1ForFork2_#t~post7#1_17|) (= |v_thread2Thread1of1ForFork2_#t~post8#1_18| |v_thread2Thread1of1ForFork2_#t~post8#1_17|)) (and (not .cse0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_16| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15|) (= v_~c2~0_119 (+ v_~c2~0_120 1)) (= |v_thread2Thread1of1ForFork2_#t~post10#1_15| |v_thread2Thread1of1ForFork2_#t~post10#1_16|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_16| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|) .cse1 (= |v_thread2Thread1of1ForFork2_#t~post9#1_16| |v_thread2Thread1of1ForFork2_#t~post9#1_15|) (= v_~pos~0_231 (+ v_~pos~0_232 1))))) (= |v_thread2Thread1of1ForFork2_~cond~1#1_39| v_~v_assert~0_119)) InVars {thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_40|, ~v_assert~0=v_~v_assert~0_119, thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_16|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_16|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_18|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_16|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_18|, ~pos~0=v_~pos~0_232, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_16|, ~c2~0=v_~c2~0_120, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_38|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_39|, ~v_assert~0=v_~v_assert~0_119, thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_17|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_17|, ~pos~0=v_~pos~0_231, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_15|, ~c2~0=v_~c2~0_119} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_#t~post10#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post8#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post7#1, ~pos~0, thread2Thread1of1ForFork2_#t~post9#1, ~c2~0, thread2Thread1of1ForFork2_#t~nondet6#1] [2022-12-06 07:29:42,671 WARN L322 ript$VariableManager]: TermVariable LBE31 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:29:42,671 WARN L322 ript$VariableManager]: TermVariable LBE173 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:29:43,006 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [416] L61-->L57: Formula: (let ((.cse0 (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_In_2| 256) 0)) (.cse1 (not (= 0 (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_3| 256))))) (or (and (= |v_thread1Thread1of1ForFork1_#t~post5#1_In_2| |v_thread1Thread1of1ForFork1_#t~post5#1_Out_6|) (not .cse0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_2|) (= |v_thread1Thread1of1ForFork1_#t~post4#1_In_2| |v_thread1Thread1of1ForFork1_#t~post4#1_Out_6|) (= (+ v_~pos~0_In_10 1) v_~pos~0_Out_28) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_2|) .cse1 (= (+ v_~c1~0_In_7 1) v_~c1~0_Out_12)) (and .cse0 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (< 0 v_~c1~0_In_7) 1 0)) (= v_~c1~0_In_7 (+ v_~c1~0_Out_12 1)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) .cse1 (= |v_thread1Thread1of1ForFork1_#t~post3#1_Out_6| |v_thread1Thread1of1ForFork1_#t~post3#1_In_2|) (= |v_thread1Thread1of1ForFork1_#t~post2#1_Out_6| |v_thread1Thread1of1ForFork1_#t~post2#1_In_2|) (= v_~pos~0_In_10 (+ v_~pos~0_Out_28 1))))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_In_2|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_In_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_2|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_In_2|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_In_2|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_In_2|, ~pos~0=v_~pos~0_In_10, ~c1~0=v_~c1~0_In_7, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_2|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_6|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_Out_6|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_6|, ~pos~0=v_~pos~0_Out_28, ~c1~0=v_~c1~0_Out_12, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~nondet1#1, ~pos~0, ~c1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [329] L83-->L87: Formula: (= v_~v_assert~0_3 |v_thread2Thread1of1ForFork2_~cond~1#1_7|) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_7|, ~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1] [2022-12-06 07:29:43,132 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [446] $Ultimate##0-->L87: Formula: (and (= v_~v_assert~0_155 (ite (= (ite (<= 0 v_~pos~0_313) 1 0) 0) 0 1)) (= 0 |v_thread3Thread1of1ForFork0_#res.base_60|) (= |v_thread3Thread1of1ForFork0_#res.offset_60| 0) (= |v_thread2Thread1of1ForFork2_~cond~1#1_87| v_~v_assert~0_155)) InVars {~pos~0=v_~pos~0_313} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_87|, ~v_assert~0=v_~v_assert~0_155, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_60|, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_60|, ~pos~0=v_~pos~0_313} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1, ~v_assert~0, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [416] L61-->L57: Formula: (let ((.cse0 (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_In_2| 256) 0)) (.cse1 (not (= 0 (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_3| 256))))) (or (and (= |v_thread1Thread1of1ForFork1_#t~post5#1_In_2| |v_thread1Thread1of1ForFork1_#t~post5#1_Out_6|) (not .cse0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_2|) (= |v_thread1Thread1of1ForFork1_#t~post4#1_In_2| |v_thread1Thread1of1ForFork1_#t~post4#1_Out_6|) (= (+ v_~pos~0_In_10 1) v_~pos~0_Out_28) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_2|) .cse1 (= (+ v_~c1~0_In_7 1) v_~c1~0_Out_12)) (and .cse0 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (< 0 v_~c1~0_In_7) 1 0)) (= v_~c1~0_In_7 (+ v_~c1~0_Out_12 1)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) .cse1 (= |v_thread1Thread1of1ForFork1_#t~post3#1_Out_6| |v_thread1Thread1of1ForFork1_#t~post3#1_In_2|) (= |v_thread1Thread1of1ForFork1_#t~post2#1_Out_6| |v_thread1Thread1of1ForFork1_#t~post2#1_In_2|) (= v_~pos~0_In_10 (+ v_~pos~0_Out_28 1))))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_In_2|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_In_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_2|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_In_2|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_In_2|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_In_2|, ~pos~0=v_~pos~0_In_10, ~c1~0=v_~c1~0_In_7, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_2|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_6|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_Out_6|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_6|, ~pos~0=v_~pos~0_Out_28, ~c1~0=v_~c1~0_Out_12, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~nondet1#1, ~pos~0, ~c1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:29:43,279 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [416] L61-->L57: Formula: (let ((.cse0 (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_In_2| 256) 0)) (.cse1 (not (= 0 (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_3| 256))))) (or (and (= |v_thread1Thread1of1ForFork1_#t~post5#1_In_2| |v_thread1Thread1of1ForFork1_#t~post5#1_Out_6|) (not .cse0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_2|) (= |v_thread1Thread1of1ForFork1_#t~post4#1_In_2| |v_thread1Thread1of1ForFork1_#t~post4#1_Out_6|) (= (+ v_~pos~0_In_10 1) v_~pos~0_Out_28) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_2|) .cse1 (= (+ v_~c1~0_In_7 1) v_~c1~0_Out_12)) (and .cse0 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (< 0 v_~c1~0_In_7) 1 0)) (= v_~c1~0_In_7 (+ v_~c1~0_Out_12 1)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) .cse1 (= |v_thread1Thread1of1ForFork1_#t~post3#1_Out_6| |v_thread1Thread1of1ForFork1_#t~post3#1_In_2|) (= |v_thread1Thread1of1ForFork1_#t~post2#1_Out_6| |v_thread1Thread1of1ForFork1_#t~post2#1_In_2|) (= v_~pos~0_In_10 (+ v_~pos~0_Out_28 1))))) InVars {thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_In_2|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_In_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_2|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_In_2|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_In_2|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_In_2|, ~pos~0=v_~pos~0_In_10, ~c1~0=v_~c1~0_In_7, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_2|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_6|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, thread1Thread1of1ForFork1_#t~post4#1=|v_thread1Thread1of1ForFork1_#t~post4#1_Out_6|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_6|, ~pos~0=v_~pos~0_Out_28, ~c1~0=v_~c1~0_Out_12, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~nondet1#1, ~pos~0, ~c1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [329] L83-->L87: Formula: (= v_~v_assert~0_3 |v_thread2Thread1of1ForFork2_~cond~1#1_7|) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_7|, ~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1] [2022-12-06 07:29:43,417 WARN L322 ript$VariableManager]: TermVariable LBE77 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:29:43,417 WARN L322 ript$VariableManager]: TermVariable LBE185 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:29:43,827 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 07:29:43,828 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2664 [2022-12-06 07:29:43,828 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 320 transitions, 3482 flow [2022-12-06 07:29:43,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 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 07:29:43,828 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:43,828 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:43,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 07:29:44,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:29:44,031 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:44,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:44,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1533460556, now seen corresponding path program 1 times [2022-12-06 07:29:44,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:44,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67573951] [2022-12-06 07:29:44,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:44,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:44,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:44,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:44,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67573951] [2022-12-06 07:29:44,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67573951] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:29:44,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304758010] [2022-12-06 07:29:44,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:44,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:29:44,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:29:44,348 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:29:44,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 07:29:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:44,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 07:29:44,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:29:44,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:44,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:29:45,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:45,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304758010] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:29:45,046 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:29:45,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2022-12-06 07:29:45,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798336097] [2022-12-06 07:29:45,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:29:45,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 07:29:45,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:45,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 07:29:45,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-12-06 07:29:45,050 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 07:29:45,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 320 transitions, 3482 flow. Second operand has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 18 states have internal predecessors, (46), 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 07:29:45,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:45,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 07:29:45,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:47,372 INFO L130 PetriNetUnfolder]: 2322/3813 cut-off events. [2022-12-06 07:29:47,372 INFO L131 PetriNetUnfolder]: For 17988/17988 co-relation queries the response was YES. [2022-12-06 07:29:47,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19031 conditions, 3813 events. 2322/3813 cut-off events. For 17988/17988 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 21252 event pairs, 50 based on Foata normal form. 160/3961 useless extension candidates. Maximal degree in co-relation 17982. Up to 906 conditions per place. [2022-12-06 07:29:47,401 INFO L137 encePairwiseOnDemand]: 13/50 looper letters, 278 selfloop transitions, 157 changer transitions 198/633 dead transitions. [2022-12-06 07:29:47,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 633 transitions, 7413 flow [2022-12-06 07:29:47,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-12-06 07:29:47,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2022-12-06 07:29:47,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 327 transitions. [2022-12-06 07:29:47,404 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14217391304347826 [2022-12-06 07:29:47,404 INFO L175 Difference]: Start difference. First operand has 115 places, 320 transitions, 3482 flow. Second operand 46 states and 327 transitions. [2022-12-06 07:29:47,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 633 transitions, 7413 flow [2022-12-06 07:29:47,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 633 transitions, 7035 flow, removed 178 selfloop flow, removed 5 redundant places. [2022-12-06 07:29:47,571 INFO L231 Difference]: Finished difference. Result has 177 places, 300 transitions, 3624 flow [2022-12-06 07:29:47,571 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=3252, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=3624, PETRI_PLACES=177, PETRI_TRANSITIONS=300} [2022-12-06 07:29:47,572 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 147 predicate places. [2022-12-06 07:29:47,572 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:47,572 INFO L89 Accepts]: Start accepts. Operand has 177 places, 300 transitions, 3624 flow [2022-12-06 07:29:47,574 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:47,574 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:47,574 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 300 transitions, 3624 flow [2022-12-06 07:29:47,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 300 transitions, 3624 flow [2022-12-06 07:29:47,678 INFO L130 PetriNetUnfolder]: 280/766 cut-off events. [2022-12-06 07:29:47,678 INFO L131 PetriNetUnfolder]: For 10316/10335 co-relation queries the response was YES. [2022-12-06 07:29:47,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4705 conditions, 766 events. 280/766 cut-off events. For 10316/10335 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5061 event pairs, 23 based on Foata normal form. 11/758 useless extension candidates. Maximal degree in co-relation 4549. Up to 198 conditions per place. [2022-12-06 07:29:47,690 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 300 transitions, 3624 flow [2022-12-06 07:29:47,691 INFO L188 LiptonReduction]: Number of co-enabled transitions 1540 [2022-12-06 07:29:47,692 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] L83-->L83: Formula: (and (let ((.cse0 (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_142| 256) 0)) (.cse1 (not (= (mod |v_thread2Thread1of1ForFork2_~cond~1#1_125| 256) 0)))) (or (and (= |v_thread2Thread1of1ForFork2_#t~post10#1_124| |v_thread2Thread1of1ForFork2_#t~post10#1_123|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_124| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_123|) (= v_~pos~0_373 (+ v_~pos~0_374 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_123| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_124|) (= v_~c2~0_223 (+ v_~c2~0_224 1)) (not .cse0) .cse1 (= |v_thread2Thread1of1ForFork2_#t~post9#1_124| |v_thread2Thread1of1ForFork2_#t~post9#1_123|)) (and (= |v_thread2Thread1of1ForFork2_#t~post7#1_126| |v_thread2Thread1of1ForFork2_#t~post7#1_125|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_123| 0)) (= v_~c2~0_224 (+ v_~c2~0_223 1)) (= v_~pos~0_374 (+ v_~pos~0_373 1)) .cse0 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_123| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_123|) (= |v_thread2Thread1of1ForFork2_#t~post8#1_126| |v_thread2Thread1of1ForFork2_#t~post8#1_125|) (= (ite (< 0 v_~c2~0_224) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_123|) .cse1))) (= v_~v_assert~0_183 |v_thread2Thread1of1ForFork2_~cond~1#1_125|)) InVars {thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_124|, ~v_assert~0=v_~v_assert~0_183, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_124|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_126|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_124|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_126|, ~pos~0=v_~pos~0_374, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_124|, ~c2~0=v_~c2~0_224, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_142|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_125|, thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_123|, ~v_assert~0=v_~v_assert~0_183, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_123|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_125|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_123|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_125|, ~pos~0=v_~pos~0_373, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_123|, ~c2~0=v_~c2~0_223} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_#t~post10#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post8#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post7#1, ~pos~0, thread2Thread1of1ForFork2_#t~post9#1, ~c2~0, thread2Thread1of1ForFork2_#t~nondet6#1] and [304] $Ultimate##0-->L61: Formula: (= v_~v_assert~0_1 |v_thread1Thread1of1ForFork1_~cond~0#1_1|) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~cond~0#1] [2022-12-06 07:29:48,310 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [316] L57-->L61: Formula: (= v_~v_assert~0_2 |v_thread1Thread1of1ForFork1_~cond~0#1_7|) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~cond~0#1] and [417] L87-->L83: Formula: (let ((.cse0 (not (= (mod |v_thread2Thread1of1ForFork2_~cond~1#1_In_1| 256) 0))) (.cse1 (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_In_2| 256) 0))) (or (and .cse0 (= (+ v_~pos~0_In_12 1) v_~pos~0_Out_32) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_1|) (not .cse1) (= v_~c2~0_Out_16 (+ v_~c2~0_In_7 1)) (= |v_thread2Thread1of1ForFork2_#t~post9#1_Out_4| |v_thread2Thread1of1ForFork2_#t~post9#1_In_1|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork2_#t~post10#1_In_1| |v_thread2Thread1of1ForFork2_#t~post10#1_Out_4|)) (and .cse0 (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) .cse1 (= (+ v_~c2~0_Out_16 1) v_~c2~0_In_7) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| (ite (< 0 v_~c2~0_In_7) 1 0)) (= |v_thread2Thread1of1ForFork2_#t~post7#1_In_1| |v_thread2Thread1of1ForFork2_#t~post7#1_Out_6|) (= |v_thread2Thread1of1ForFork2_#t~post8#1_In_1| |v_thread2Thread1of1ForFork2_#t~post8#1_Out_6|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= v_~pos~0_In_12 (+ v_~pos~0_Out_32 1))))) InVars {thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_In_1|, thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_In_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_1|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_In_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_1|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_In_1|, ~pos~0=v_~pos~0_In_12, ~c2~0=v_~c2~0_In_7, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_In_1|, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_In_2|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_In_1|, thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_Out_4|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_Out_6|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_Out_6|, ~pos~0=v_~pos~0_Out_32, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_Out_4|, ~c2~0=v_~c2~0_Out_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post10#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post8#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post7#1, ~pos~0, thread2Thread1of1ForFork2_#t~post9#1, ~c2~0, thread2Thread1of1ForFork2_#t~nondet6#1] [2022-12-06 07:29:48,454 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [471] $Ultimate##0-->L83: Formula: (let ((.cse0 (+ v_~pos~0_418 1)) (.cse1 (+ v_~c2~0_240 1))) (and (let ((.cse2 (not (= (mod |v_thread2Thread1of1ForFork2_~cond~1#1_145| 256) 0))) (.cse3 (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_158| 256) 0))) (or (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_140| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_139|) (= v_~pos~0_417 .cse0) (= v_~c2~0_239 .cse1) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_139| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_140|) (= |v_thread2Thread1of1ForFork2_#t~post9#1_139| |v_thread2Thread1of1ForFork2_#t~post9#1_140|) .cse2 (= |v_thread2Thread1of1ForFork2_#t~post10#1_140| |v_thread2Thread1of1ForFork2_#t~post10#1_139|) (not .cse3)) (and (= |v_thread2Thread1of1ForFork2_#t~post7#1_142| |v_thread2Thread1of1ForFork2_#t~post7#1_141|) (= (ite (< 0 v_~c2~0_240) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_139|) (= (+ v_~pos~0_417 1) v_~pos~0_418) (= v_~c2~0_240 (+ v_~c2~0_239 1)) .cse2 (= |v_thread2Thread1of1ForFork2_#t~post8#1_142| |v_thread2Thread1of1ForFork2_#t~post8#1_141|) .cse3 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_139| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_139|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_139| 0))))) (= v_~v_assert~0_203 |v_thread2Thread1of1ForFork2_~cond~1#1_145|) (let ((.cse4 (= (mod |v_thread2Thread1of1ForFork2_#t~nondet6#1_159| 256) 0))) (or (and (= |v_thread2Thread1of1ForFork2_#t~post7#1_143| |v_thread2Thread1of1ForFork2_#t~post7#1_142|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_140| (ite (< 0 v_~c2~0_241) 1 0)) (= |v_thread2Thread1of1ForFork2_#t~post8#1_142| |v_thread2Thread1of1ForFork2_#t~post8#1_143|) (= v_~pos~0_419 .cse0) (= v_~c2~0_241 .cse1) .cse4 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_140| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_140|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_140| 0))) (and (= |v_thread2Thread1of1ForFork2_#t~post10#1_141| |v_thread2Thread1of1ForFork2_#t~post10#1_140|) (= v_~pos~0_418 (+ v_~pos~0_419 1)) (not .cse4) (= |v_thread2Thread1of1ForFork2_#t~post9#1_141| |v_thread2Thread1of1ForFork2_#t~post9#1_140|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_141| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_140|) (= (+ v_~c2~0_241 1) v_~c2~0_240) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_141| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_140|)))))) InVars {thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_141|, ~v_assert~0=v_~v_assert~0_203, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_141|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_143|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_141|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_143|, ~pos~0=v_~pos~0_419, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_141|, ~c2~0=v_~c2~0_241, thread2Thread1of1ForFork2_#t~nondet6#1=|v_thread2Thread1of1ForFork2_#t~nondet6#1_159|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_145|, thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_139|, ~v_assert~0=v_~v_assert~0_203, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_139|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_141|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_139|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_141|, ~pos~0=v_~pos~0_417, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_139|, ~c2~0=v_~c2~0_239} AuxVars[|v_thread2Thread1of1ForFork2_#t~nondet6#1_158|, v_~c2~0_240, |v_thread2Thread1of1ForFork2_#t~post9#1_140|, |v_thread2Thread1of1ForFork2_#t~post10#1_140|, |v_thread2Thread1of1ForFork2_#t~post7#1_142|, |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_140|, v_~pos~0_418, |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_140|, |v_thread2Thread1of1ForFork2_#t~post8#1_142|] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_#t~post10#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post8#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post7#1, ~pos~0, thread2Thread1of1ForFork2_#t~post9#1, ~c2~0, thread2Thread1of1ForFork2_#t~nondet6#1] and [304] $Ultimate##0-->L61: Formula: (= v_~v_assert~0_1 |v_thread1Thread1of1ForFork1_~cond~0#1_1|) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~cond~0#1] [2022-12-06 07:29:48,741 WARN L322 ript$VariableManager]: TermVariable LBE77 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:29:48,741 WARN L322 ript$VariableManager]: TermVariable LBE185 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:29:48,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 07:29:48,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-06 07:29:48,943 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Function c_aux_v_thread2Thread1of1ForFork2_#t~post10#1_143 is already defined. at de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.declareFun(Scriptor.java:115) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.declareFun(HistoryRecordingScript.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.declareFun(ManagedScript.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:117) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToTransFormula(BranchEncoderRenaming.java:114) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToIcfgEdge(BranchEncoderRenaming.java:134) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:119) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:1) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:67) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.executeComposition(SequenceRule.java:724) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.applyInternal(SequenceRule.java:150) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.sequenceRuleWrapper(LiptonReduction.java:252) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:199) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 07:29:48,945 INFO L158 Benchmark]: Toolchain (without parser) took 32855.93ms. Allocated memory was 186.6MB in the beginning and 389.0MB in the end (delta: 202.4MB). Free memory was 162.6MB in the beginning and 240.5MB in the end (delta: -77.9MB). Peak memory consumption was 125.7MB. Max. memory is 8.0GB. [2022-12-06 07:29:48,945 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 186.6MB. Free memory was 163.9MB in the beginning and 163.9MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:29:48,946 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.87ms. Allocated memory is still 186.6MB. Free memory was 162.6MB in the beginning and 149.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 07:29:48,946 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.36ms. Allocated memory is still 186.6MB. Free memory was 149.5MB in the beginning and 147.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:29:48,946 INFO L158 Benchmark]: Boogie Preprocessor took 31.98ms. Allocated memory is still 186.6MB. Free memory was 147.4MB in the beginning and 145.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:29:48,946 INFO L158 Benchmark]: RCFGBuilder took 502.66ms. Allocated memory is still 186.6MB. Free memory was 145.8MB in the beginning and 126.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-06 07:29:48,947 INFO L158 Benchmark]: TraceAbstraction took 31986.88ms. Allocated memory was 186.6MB in the beginning and 389.0MB in the end (delta: 202.4MB). Free memory was 126.4MB in the beginning and 240.5MB in the end (delta: -114.1MB). Peak memory consumption was 90.0MB. Max. memory is 8.0GB. [2022-12-06 07:29:48,948 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.15ms. Allocated memory is still 186.6MB. Free memory was 163.9MB in the beginning and 163.9MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 278.87ms. Allocated memory is still 186.6MB. Free memory was 162.6MB in the beginning and 149.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.36ms. Allocated memory is still 186.6MB. Free memory was 149.5MB in the beginning and 147.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.98ms. Allocated memory is still 186.6MB. Free memory was 147.4MB in the beginning and 145.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 502.66ms. Allocated memory is still 186.6MB. Free memory was 145.8MB in the beginning and 126.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 31986.88ms. Allocated memory was 186.6MB in the beginning and 389.0MB in the end (delta: 202.4MB). Free memory was 126.4MB in the beginning and 240.5MB in the end (delta: -114.1MB). Peak memory consumption was 90.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 93 PlacesBefore, 30 PlacesAfterwards, 90 TransitionsBefore, 22 TransitionsAfterwards, 1250 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 35 TrivialYvCompositions, 28 ConcurrentYvCompositions, 5 ChoiceCompositions, 68 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 706, independent: 692, independent conditional: 692, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 706, independent: 692, independent conditional: 0, independent unconditional: 692, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 706, independent: 692, independent conditional: 0, independent unconditional: 692, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 706, independent: 692, independent conditional: 0, independent unconditional: 692, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 637, independent: 626, independent conditional: 0, independent unconditional: 626, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 637, independent: 624, independent conditional: 0, independent unconditional: 624, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2049, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 2011, unknown conditional: 0, unknown unconditional: 2011] ], Cache Queries: [ total: 706, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 637, unknown conditional: 0, unknown unconditional: 637] , Statistics on independence cache: Total cache size (in pairs): 1036, Positive cache size: 1026, Positive conditional cache size: 0, Positive unconditional cache size: 1026, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 176 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 1, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 35 PlacesBefore, 36 PlacesAfterwards, 29 TransitionsBefore, 30 TransitionsAfterwards, 156 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21, independent: 18, independent conditional: 12, independent unconditional: 6, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, independent: 18, independent conditional: 12, independent unconditional: 6, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, independent: 18, independent conditional: 12, independent unconditional: 6, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 14, independent conditional: 12, independent unconditional: 2, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 15, unknown conditional: 13, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 17, Positive cache size: 14, Positive conditional cache size: 12, Positive unconditional cache size: 2, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 40 PlacesBefore, 40 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 42, independent: 36, independent conditional: 18, independent unconditional: 18, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 36, independent conditional: 18, independent unconditional: 18, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 36, independent conditional: 18, independent unconditional: 18, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 6, independent unconditional: 2, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, independent: 28, independent conditional: 12, independent unconditional: 16, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 9, unknown conditional: 7, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 22, Positive conditional cache size: 18, Positive unconditional cache size: 4, Negative cache size: 4, Negative conditional cache size: 3, Negative unconditional cache size: 1, 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.5s, 44 PlacesBefore, 44 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 152 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 15, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 27, Positive conditional cache size: 20, Positive unconditional cache size: 7, Negative cache size: 4, Negative conditional cache size: 3, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 46 PlacesBefore, 46 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 156 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 37, Positive conditional cache size: 21, Positive unconditional cache size: 16, Negative cache size: 4, Negative conditional cache size: 3, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 60 PlacesBefore, 60 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 306 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 38, independent conditional: 38, 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: 38, independent: 38, independent conditional: 38, 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: 38, independent: 38, independent conditional: 28, independent unconditional: 10, 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: 38, independent: 38, independent conditional: 28, independent unconditional: 10, 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: 17, independent: 17, independent conditional: 16, independent unconditional: 1, 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: 17, independent: 17, independent conditional: 0, independent unconditional: 17, 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: 38, independent: 21, independent conditional: 12, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 17, unknown conditional: 16, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 56, Positive conditional cache size: 38, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 3, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 226 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): 60, Positive cache size: 56, Positive conditional cache size: 38, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 3, Negative unconditional cache size: 1, 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: 1.6s, 74 PlacesBefore, 74 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 432 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 15, independent unconditional: 19, 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: 34, independent: 34, independent conditional: 15, independent unconditional: 19, 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: 11, independent: 11, independent conditional: 3, independent unconditional: 8, 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: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 34, independent: 23, independent conditional: 12, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 3, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 74, Positive conditional cache size: 44, Positive unconditional cache size: 30, Negative cache size: 4, Negative conditional cache size: 3, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 98 PlacesBefore, 98 PlacesAfterwards, 140 TransitionsBefore, 140 TransitionsAfterwards, 748 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 32, independent conditional: 32, 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: 32, independent: 32, independent conditional: 32, 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: 32, independent: 32, independent conditional: 0, independent unconditional: 32, 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: 32, independent: 32, independent conditional: 0, independent unconditional: 32, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 32, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 87, Positive conditional cache size: 48, Positive unconditional cache size: 39, Negative cache size: 4, Negative conditional cache size: 3, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 116 PlacesBefore, 115 PlacesAfterwards, 321 TransitionsBefore, 320 TransitionsAfterwards, 1598 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, independent: 39, independent conditional: 39, 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: 39, independent: 39, independent conditional: 39, 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: 39, independent: 39, independent conditional: 10, independent unconditional: 29, 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: 39, independent: 39, independent conditional: 10, independent unconditional: 29, 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: 13, independent: 13, independent conditional: 8, independent unconditional: 5, 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: 13, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 39, independent: 26, independent conditional: 2, independent unconditional: 24, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 13, unknown conditional: 8, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 113, Positive conditional cache size: 63, Positive unconditional cache size: 50, Negative cache size: 4, Negative conditional cache size: 3, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 29, Maximal queried relation: 0 - ExceptionOrErrorResult: SMTLIBException: Function c_aux_v_thread2Thread1of1ForFork2_#t~post10#1_143 is already defined. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Function c_aux_v_thread2Thread1of1ForFork2_#t~post10#1_143 is already defined.: de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 07:29:48,970 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...