/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-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 12:57:41,001 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:57:41,003 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:57:41,049 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:57:41,050 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:57:41,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:57:41,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:57:41,059 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:57:41,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:57:41,067 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:57:41,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:57:41,070 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:57:41,070 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:57:41,072 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:57:41,073 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:57:41,075 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:57:41,076 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:57:41,077 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:57:41,079 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:57:41,085 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:57:41,086 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:57:41,087 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:57:41,088 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:57:41,089 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:57:41,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:57:41,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:57:41,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:57:41,096 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:57:41,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:57:41,097 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:57:41,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:57:41,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:57:41,100 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:57:41,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:57:41,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:57:41,102 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:57:41,102 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:57:41,102 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:57:41,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:57:41,103 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:57:41,104 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:57:41,108 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-13 12:57:41,137 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:57:41,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:57:41,140 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:57:41,140 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:57:41,140 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:57:41,141 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:57:41,141 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:57:41,141 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:57:41,141 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:57:41,141 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:57:41,142 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:57:41,142 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:57:41,142 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:57:41,143 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:57:41,143 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:57:41,143 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:57:41,143 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:57:41,143 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:57:41,143 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:57:41,144 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 12:57:41,144 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:57:41,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:57:41,149 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:57:41,150 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:57:41,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:57:41,150 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:57:41,151 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:57:41,151 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 12:57:41,151 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 12:57:41,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:57:41,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:57:41,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:57:41,487 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:57:41,489 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:57:41,490 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-3.wvr.c [2022-12-13 12:57:42,535 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:57:42,739 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:57:42,741 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-3.wvr.c [2022-12-13 12:57:42,748 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a4d64387/c8dd36bbc357478fa08add0ffc5ef36d/FLAG382ab2f9b [2022-12-13 12:57:42,768 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a4d64387/c8dd36bbc357478fa08add0ffc5ef36d [2022-12-13 12:57:42,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:57:42,771 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 12:57:42,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:57:42,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:57:42,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:57:42,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:57:42" (1/1) ... [2022-12-13 12:57:42,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@790174a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:57:42, skipping insertion in model container [2022-12-13 12:57:42,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:57:42" (1/1) ... [2022-12-13 12:57:42,781 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:57:42,802 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:57:42,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:57:42,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:57:42,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:57:42,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:57:42,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:57:42,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:57:42,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:57:42,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:57:42,944 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-3.wvr.c[2410,2423] [2022-12-13 12:57:42,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:57:42,957 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:57:42,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:57:42,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:57:42,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:57:42,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:57:42,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:57:42,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:57:42,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:57:42,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:57:42,989 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-3.wvr.c[2410,2423] [2022-12-13 12:57:42,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:57:43,001 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:57:43,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:57:43 WrapperNode [2022-12-13 12:57:43,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:57:43,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:57:43,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:57:43,003 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:57:43,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:57:43" (1/1) ... [2022-12-13 12:57:43,016 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:57:43" (1/1) ... [2022-12-13 12:57:43,030 INFO L138 Inliner]: procedures = 21, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2022-12-13 12:57:43,030 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:57:43,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:57:43,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:57:43,031 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:57:43,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:57:43" (1/1) ... [2022-12-13 12:57:43,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:57:43" (1/1) ... [2022-12-13 12:57:43,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:57:43" (1/1) ... [2022-12-13 12:57:43,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:57:43" (1/1) ... [2022-12-13 12:57:43,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:57:43" (1/1) ... [2022-12-13 12:57:43,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:57:43" (1/1) ... [2022-12-13 12:57:43,049 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:57:43" (1/1) ... [2022-12-13 12:57:43,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:57:43" (1/1) ... [2022-12-13 12:57:43,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:57:43,052 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:57:43,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:57:43,052 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:57:43,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:57:43" (1/1) ... [2022-12-13 12:57:43,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:57:43,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:57:43,080 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:57:43,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:57:43,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:57:43,121 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 12:57:43,122 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 12:57:43,122 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 12:57:43,122 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 12:57:43,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:57:43,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:57:43,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:57:43,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 12:57:43,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 12:57:43,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:57:43,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:57:43,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 12:57:43,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:57:43,124 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 12:57:43,230 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 12:57:43,244 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:57:43,441 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 12:57:43,460 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:57:43,460 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 12:57:43,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:57:43 BoogieIcfgContainer [2022-12-13 12:57:43,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:57:43,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:57:43,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:57:43,470 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:57:43,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:57:42" (1/3) ... [2022-12-13 12:57:43,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c42534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:57:43, skipping insertion in model container [2022-12-13 12:57:43,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:57:43" (2/3) ... [2022-12-13 12:57:43,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c42534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:57:43, skipping insertion in model container [2022-12-13 12:57:43,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:57:43" (3/3) ... [2022-12-13 12:57:43,476 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-3.wvr.c [2022-12-13 12:57:43,492 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:57:43,492 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 12:57:43,493 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:57:43,584 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 12:57:43,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 90 transitions, 196 flow [2022-12-13 12:57:43,695 INFO L130 PetriNetUnfolder]: 11/88 cut-off events. [2022-12-13 12:57:43,696 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 12:57:43,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 88 events. 11/88 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 91 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 48. Up to 4 conditions per place. [2022-12-13 12:57:43,702 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 90 transitions, 196 flow [2022-12-13 12:57:43,706 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 80 transitions, 172 flow [2022-12-13 12:57:43,707 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:57:43,734 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 80 transitions, 172 flow [2022-12-13 12:57:43,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 80 transitions, 172 flow [2022-12-13 12:57:43,773 INFO L130 PetriNetUnfolder]: 11/80 cut-off events. [2022-12-13 12:57:43,773 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 12:57:43,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 80 events. 11/80 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 90 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 48. Up to 4 conditions per place. [2022-12-13 12:57:43,778 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 80 transitions, 172 flow [2022-12-13 12:57:43,778 INFO L226 LiptonReduction]: Number of co-enabled transitions 1088 [2022-12-13 12:57:46,333 INFO L241 LiptonReduction]: Total number of compositions: 65 [2022-12-13 12:57:46,345 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:57:46,350 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;@6a546be2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 12:57:46,350 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 12:57:46,353 INFO L130 PetriNetUnfolder]: 2/12 cut-off events. [2022-12-13 12:57:46,354 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 12:57:46,354 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:57:46,354 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:57:46,355 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:57:46,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:57:46,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1161558226, now seen corresponding path program 1 times [2022-12-13 12:57:46,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:57:46,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453786826] [2022-12-13 12:57:46,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:57:46,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:57:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:57:46,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:57:46,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:57:46,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453786826] [2022-12-13 12:57:46,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453786826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:57:46,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:57:46,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:57:46,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596715000] [2022-12-13 12:57:46,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:57:46,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:57:46,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:57:46,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:57:46,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:57:46,668 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-13 12:57:46,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 13 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:57:46,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:57:46,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-13 12:57:46,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:57:46,715 INFO L130 PetriNetUnfolder]: 29/54 cut-off events. [2022-12-13 12:57:46,715 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-13 12:57:46,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 54 events. 29/54 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 93 event pairs, 1 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 90. Up to 45 conditions per place. [2022-12-13 12:57:46,718 INFO L137 encePairwiseOnDemand]: 10/13 looper letters, 17 selfloop transitions, 2 changer transitions 0/19 dead transitions. [2022-12-13 12:57:46,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 19 transitions, 91 flow [2022-12-13 12:57:46,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:57:46,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:57:46,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2022-12-13 12:57:46,728 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2022-12-13 12:57:46,729 INFO L175 Difference]: Start difference. First operand has 18 places, 13 transitions, 38 flow. Second operand 3 states and 20 transitions. [2022-12-13 12:57:46,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 19 transitions, 91 flow [2022-12-13 12:57:46,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 19 transitions, 81 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 12:57:46,734 INFO L231 Difference]: Finished difference. Result has 17 places, 14 transitions, 42 flow [2022-12-13 12:57:46,736 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=30, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=17, PETRI_TRANSITIONS=14} [2022-12-13 12:57:46,739 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, -1 predicate places. [2022-12-13 12:57:46,739 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:57:46,740 INFO L89 Accepts]: Start accepts. Operand has 17 places, 14 transitions, 42 flow [2022-12-13 12:57:46,742 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:57:46,742 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:57:46,743 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 17 places, 14 transitions, 42 flow [2022-12-13 12:57:46,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 17 places, 14 transitions, 42 flow [2022-12-13 12:57:46,753 INFO L130 PetriNetUnfolder]: 2/14 cut-off events. [2022-12-13 12:57:46,753 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:57:46,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 14 events. 2/14 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 6 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 14. Up to 4 conditions per place. [2022-12-13 12:57:46,755 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 17 places, 14 transitions, 42 flow [2022-12-13 12:57:46,756 INFO L226 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-13 12:57:46,756 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:57:46,759 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-13 12:57:46,759 INFO L495 AbstractCegarLoop]: Abstraction has has 17 places, 14 transitions, 42 flow [2022-12-13 12:57:46,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:57:46,760 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:57:46,762 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:57:46,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:57:46,770 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:57:46,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:57:46,771 INFO L85 PathProgramCache]: Analyzing trace with hash -824867760, now seen corresponding path program 1 times [2022-12-13 12:57:46,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:57:46,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482400786] [2022-12-13 12:57:46,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:57:46,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:57:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:57:46,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 12:57:46,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:57:46,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482400786] [2022-12-13 12:57:46,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482400786] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:57:46,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:57:46,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:57:46,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214846007] [2022-12-13 12:57:46,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:57:46,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:57:46,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:57:46,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:57:46,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:57:46,938 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-13 12:57:46,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 17 places, 14 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:57:46,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:57:46,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-13 12:57:46,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:57:46,982 INFO L130 PetriNetUnfolder]: 40/73 cut-off events. [2022-12-13 12:57:46,982 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-13 12:57:46,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 73 events. 40/73 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 140 event pairs, 6 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 112. Up to 49 conditions per place. [2022-12-13 12:57:46,984 INFO L137 encePairwiseOnDemand]: 10/13 looper letters, 19 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2022-12-13 12:57:46,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 21 transitions, 106 flow [2022-12-13 12:57:46,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:57:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:57:46,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2022-12-13 12:57:46,986 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2022-12-13 12:57:46,986 INFO L175 Difference]: Start difference. First operand has 17 places, 14 transitions, 42 flow. Second operand 3 states and 20 transitions. [2022-12-13 12:57:46,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 21 transitions, 106 flow [2022-12-13 12:57:46,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 21 transitions, 103 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:57:46,987 INFO L231 Difference]: Finished difference. Result has 19 places, 15 transitions, 52 flow [2022-12-13 12:57:46,987 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=19, PETRI_TRANSITIONS=15} [2022-12-13 12:57:46,988 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 1 predicate places. [2022-12-13 12:57:46,988 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:57:46,988 INFO L89 Accepts]: Start accepts. Operand has 19 places, 15 transitions, 52 flow [2022-12-13 12:57:46,990 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:57:46,990 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:57:46,990 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 15 transitions, 52 flow [2022-12-13 12:57:46,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 15 transitions, 52 flow [2022-12-13 12:57:46,996 INFO L130 PetriNetUnfolder]: 2/15 cut-off events. [2022-12-13 12:57:46,996 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:57:46,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 15 events. 2/15 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 10 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 15. Up to 4 conditions per place. [2022-12-13 12:57:46,997 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 19 places, 15 transitions, 52 flow [2022-12-13 12:57:46,997 INFO L226 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-13 12:57:46,998 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:57:46,999 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 12:57:46,999 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 15 transitions, 52 flow [2022-12-13 12:57:47,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:57:47,000 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:57:47,000 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:57:47,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:57:47,001 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:57:47,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:57:47,002 INFO L85 PathProgramCache]: Analyzing trace with hash 596881523, now seen corresponding path program 1 times [2022-12-13 12:57:47,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:57:47,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223676746] [2022-12-13 12:57:47,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:57:47,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:57:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:57:47,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 12:57:47,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:57:47,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223676746] [2022-12-13 12:57:47,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223676746] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:57:47,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636330537] [2022-12-13 12:57:47,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:57:47,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:57:47,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:57:47,207 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-13 12:57:47,262 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-13 12:57:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:57:47,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 12:57:47,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:57:47,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:57:47,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:57:47,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 12:57:47,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636330537] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:57:47,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:57:47,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 3] total 8 [2022-12-13 12:57:47,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119724401] [2022-12-13 12:57:47,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:57:47,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 12:57:47,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:57:47,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 12:57:47,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-13 12:57:47,807 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-13 12:57:47,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 15 transitions, 52 flow. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:57:47,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:57:47,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-13 12:57:47,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:57:47,999 INFO L130 PetriNetUnfolder]: 65/116 cut-off events. [2022-12-13 12:57:47,999 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-12-13 12:57:48,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 116 events. 65/116 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 264 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 100. Up to 41 conditions per place. [2022-12-13 12:57:48,001 INFO L137 encePairwiseOnDemand]: 8/13 looper letters, 40 selfloop transitions, 18 changer transitions 0/58 dead transitions. [2022-12-13 12:57:48,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 58 transitions, 305 flow [2022-12-13 12:57:48,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 12:57:48,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 12:57:48,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 65 transitions. [2022-12-13 12:57:48,003 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2022-12-13 12:57:48,003 INFO L175 Difference]: Start difference. First operand has 19 places, 15 transitions, 52 flow. Second operand 13 states and 65 transitions. [2022-12-13 12:57:48,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 58 transitions, 305 flow [2022-12-13 12:57:48,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 58 transitions, 301 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:57:48,005 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 184 flow [2022-12-13 12:57:48,006 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=184, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2022-12-13 12:57:48,006 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 18 predicate places. [2022-12-13 12:57:48,006 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:57:48,006 INFO L89 Accepts]: Start accepts. Operand has 36 places, 29 transitions, 184 flow [2022-12-13 12:57:48,008 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:57:48,008 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:57:48,008 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 184 flow [2022-12-13 12:57:48,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 184 flow [2022-12-13 12:57:48,014 INFO L130 PetriNetUnfolder]: 14/42 cut-off events. [2022-12-13 12:57:48,014 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-12-13 12:57:48,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 42 events. 14/42 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 88 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 125. Up to 16 conditions per place. [2022-12-13 12:57:48,015 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 184 flow [2022-12-13 12:57:48,016 INFO L226 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-13 12:57:48,786 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_3 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_3} OutVars{~g2~0=v_~g2~0_In_3, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 12:57:49,801 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_3 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_3} OutVars{~g2~0=v_~g2~0_In_3, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [347] L53-1-->L53-1: Formula: (let ((.cse7 (= (mod v_~d1~0_71 256) 0)) (.cse8 (+ v_~pos~0_85 1)) (.cse4 (= (mod v_~d1~0_70 256) 0))) (and (let ((.cse1 (= v_~g1~0_47 v_~g1~0_46)) (.cse0 (= (ite (= 0 (ite .cse4 1 0)) 0 1) v_~d1~0_69)) (.cse2 (= (mod v_~d1~0_69 256) 0)) (.cse3 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse3) (and (= v_~g1~0_46 0) .cse0 (not .cse2) (not .cse3)))) (let ((.cse5 (= v_~g1~0_48 v_~g1~0_47)) (.cse6 (= v_~d1~0_70 (ite (= (ite .cse7 1 0) 0) 0 1)))) (or (and (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_39| 256) 0) .cse5 .cse6) (and .cse4 .cse5 .cse6))) (or (and (= (+ v_~pos~0_86 1) v_~pos~0_85) (not .cse7) (= |v_thread1Thread1of1ForFork0_#t~post2_25| |v_thread1Thread1of1ForFork0_#t~post2_24|)) (and (= .cse8 v_~pos~0_86) (= |v_thread1Thread1of1ForFork0_#t~post1_25| |v_thread1Thread1of1ForFork0_#t~post1_24|) .cse7)) (let ((.cse9 (not (= (mod v_~g1~0_47 256) 0)))) (or (and (= .cse8 v_~pos~0_84) .cse9 (= |v_thread1Thread1of1ForFork0_#t~post2_24| |v_thread1Thread1of1ForFork0_#t~post2_23|) (not .cse4)) (and .cse9 .cse4 (= (+ v_~pos~0_84 1) v_~pos~0_85) (= |v_thread1Thread1of1ForFork0_#t~post1_24| |v_thread1Thread1of1ForFork0_#t~post1_23|)))))) InVars {~g1~0=v_~g1~0_48, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_39|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_25|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_25|, ~pos~0=v_~pos~0_86, ~d1~0=v_~d1~0_71} OutVars{~g1~0=v_~g1~0_46, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_23|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_23|, ~pos~0=v_~pos~0_84, ~d1~0=v_~d1~0_69} AuxVars[v_~pos~0_85, v_~g1~0_47, |v_thread1Thread1of1ForFork0_#t~post1_24|, v_~d1~0_70, |v_thread1Thread1of1ForFork0_#t~nondet3_38|, |v_thread1Thread1of1ForFork0_#t~post2_24|] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 12:57:51,008 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [345] L75-1-->L75-1: Formula: (let ((.cse0 (= (mod v_~d2~0_58 256) 0))) (and (let ((.cse1 (not (= (mod v_~g2~0_47 256) 0)))) (or (and .cse0 (= (+ 2 v_~pos~0_77) v_~pos~0_78) .cse1) (and (= (+ 2 v_~pos~0_78) v_~pos~0_77) .cse1 (not .cse0)))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0)) (.cse3 (= v_~d2~0_57 (ite (= 0 (ite .cse0 1 0)) 0 1))) (.cse4 (= v_~g2~0_46 v_~g2~0_47)) (.cse5 (= (mod v_~d2~0_57 256) 0))) (or (and .cse2 .cse3 .cse4) (and (= v_~g2~0_46 0) .cse3 (not .cse2) (not .cse5)) (and .cse3 .cse4 .cse5))))) InVars {~g2~0=v_~g2~0_47, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_78, ~d2~0=v_~d2~0_58} OutVars{~g2~0=v_~g2~0_46, ~pos~0=v_~pos~0_77, ~d2~0=v_~d2~0_57} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] and [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 12:57:51,559 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [345] L75-1-->L75-1: Formula: (let ((.cse0 (= (mod v_~d2~0_58 256) 0))) (and (let ((.cse1 (not (= (mod v_~g2~0_47 256) 0)))) (or (and .cse0 (= (+ 2 v_~pos~0_77) v_~pos~0_78) .cse1) (and (= (+ 2 v_~pos~0_78) v_~pos~0_77) .cse1 (not .cse0)))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0)) (.cse3 (= v_~d2~0_57 (ite (= 0 (ite .cse0 1 0)) 0 1))) (.cse4 (= v_~g2~0_46 v_~g2~0_47)) (.cse5 (= (mod v_~d2~0_57 256) 0))) (or (and .cse2 .cse3 .cse4) (and (= v_~g2~0_46 0) .cse3 (not .cse2) (not .cse5)) (and .cse3 .cse4 .cse5))))) InVars {~g2~0=v_~g2~0_47, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_78, ~d2~0=v_~d2~0_58} OutVars{~g2~0=v_~g2~0_46, ~pos~0=v_~pos~0_77, ~d2~0=v_~d2~0_57} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 12:57:52,672 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 12:57:52,673 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4667 [2022-12-13 12:57:52,673 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 187 flow [2022-12-13 12:57:52,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:57:52,674 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:57:52,674 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:57:52,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 12:57:52,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:57:52,875 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:57:52,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:57:52,875 INFO L85 PathProgramCache]: Analyzing trace with hash -124370473, now seen corresponding path program 1 times [2022-12-13 12:57:52,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:57:52,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417353331] [2022-12-13 12:57:52,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:57:52,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:57:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:57:53,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:57:53,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:57:53,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417353331] [2022-12-13 12:57:53,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417353331] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:57:53,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271791489] [2022-12-13 12:57:53,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:57:53,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:57:53,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:57:53,505 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-13 12:57:53,531 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-13 12:57:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:57:53,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 12:57:53,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:57:53,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:57:53,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:57:54,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 12:57:54,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271791489] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:57:54,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:57:54,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 10 [2022-12-13 12:57:54,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715722507] [2022-12-13 12:57:54,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:57:54,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 12:57:54,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:57:54,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 12:57:54,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2022-12-13 12:57:54,206 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 12:57:54,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 187 flow. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:57:54,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:57:54,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 12:57:54,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:57:54,506 INFO L130 PetriNetUnfolder]: 138/243 cut-off events. [2022-12-13 12:57:54,506 INFO L131 PetriNetUnfolder]: For 461/461 co-relation queries the response was YES. [2022-12-13 12:57:54,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1166 conditions, 243 events. 138/243 cut-off events. For 461/461 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 803 event pairs, 0 based on Foata normal form. 2/215 useless extension candidates. Maximal degree in co-relation 515. Up to 111 conditions per place. [2022-12-13 12:57:54,509 INFO L137 encePairwiseOnDemand]: 8/20 looper letters, 48 selfloop transitions, 31 changer transitions 6/85 dead transitions. [2022-12-13 12:57:54,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 85 transitions, 721 flow [2022-12-13 12:57:54,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 12:57:54,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 12:57:54,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2022-12-13 12:57:54,511 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2022-12-13 12:57:54,512 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 187 flow. Second operand 11 states and 80 transitions. [2022-12-13 12:57:54,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 85 transitions, 721 flow [2022-12-13 12:57:54,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 85 transitions, 573 flow, removed 65 selfloop flow, removed 4 redundant places. [2022-12-13 12:57:54,517 INFO L231 Difference]: Finished difference. Result has 41 places, 47 transitions, 360 flow [2022-12-13 12:57:54,517 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=360, PETRI_PLACES=41, PETRI_TRANSITIONS=47} [2022-12-13 12:57:54,518 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 23 predicate places. [2022-12-13 12:57:54,518 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:57:54,518 INFO L89 Accepts]: Start accepts. Operand has 41 places, 47 transitions, 360 flow [2022-12-13 12:57:54,519 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:57:54,519 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:57:54,519 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 47 transitions, 360 flow [2022-12-13 12:57:54,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 47 transitions, 360 flow [2022-12-13 12:57:54,530 INFO L130 PetriNetUnfolder]: 30/89 cut-off events. [2022-12-13 12:57:54,530 INFO L131 PetriNetUnfolder]: For 112/116 co-relation queries the response was YES. [2022-12-13 12:57:54,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 89 events. 30/89 cut-off events. For 112/116 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 316 event pairs, 1 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 283. Up to 36 conditions per place. [2022-12-13 12:57:54,531 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 47 transitions, 360 flow [2022-12-13 12:57:54,531 INFO L226 LiptonReduction]: Number of co-enabled transitions 152 [2022-12-13 12:57:55,237 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [345] L75-1-->L75-1: Formula: (let ((.cse0 (= (mod v_~d2~0_58 256) 0))) (and (let ((.cse1 (not (= (mod v_~g2~0_47 256) 0)))) (or (and .cse0 (= (+ 2 v_~pos~0_77) v_~pos~0_78) .cse1) (and (= (+ 2 v_~pos~0_78) v_~pos~0_77) .cse1 (not .cse0)))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0)) (.cse3 (= v_~d2~0_57 (ite (= 0 (ite .cse0 1 0)) 0 1))) (.cse4 (= v_~g2~0_46 v_~g2~0_47)) (.cse5 (= (mod v_~d2~0_57 256) 0))) (or (and .cse2 .cse3 .cse4) (and (= v_~g2~0_46 0) .cse3 (not .cse2) (not .cse5)) (and .cse3 .cse4 .cse5))))) InVars {~g2~0=v_~g2~0_47, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_78, ~d2~0=v_~d2~0_58} OutVars{~g2~0=v_~g2~0_46, ~pos~0=v_~pos~0_77, ~d2~0=v_~d2~0_57} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 12:57:55,718 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [348] L75-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_76 256) 0))) (and (= |v_thread2Thread1of1ForFork1_#res.offset_13| 0) (let ((.cse0 (= v_~g1~0_53 v_~g1~0_52)) (.cse3 (= (mod v_~d1~0_75 256) 0)) (.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_44| 256) 0)) (.cse2 (= v_~d1~0_75 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse3) (and (not .cse3) (not .cse1) (= v_~g1~0_52 0) .cse2))) (= (mod v_~g2~0_52 256) 0) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (not .cse4) (= (+ v_~pos~0_91 1) v_~pos~0_90) (= |v_thread1Thread1of1ForFork0_#t~post2_30| |v_thread1Thread1of1ForFork0_#t~post2_29|) .cse5) (and (= (+ v_~pos~0_90 1) v_~pos~0_91) (= |v_thread1Thread1of1ForFork0_#t~post1_29| |v_thread1Thread1of1ForFork0_#t~post1_30|) .cse4 .cse5))) (= |v_thread2Thread1of1ForFork1_#res.base_13| 0))) InVars {~g2~0=v_~g2~0_52, ~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_44|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_30|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_30|, ~pos~0=v_~pos~0_91, ~d1~0=v_~d1~0_76} OutVars{~g2~0=v_~g2~0_52, ~g1~0=v_~g1~0_52, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_13|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_29|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_29|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_13|, ~pos~0=v_~pos~0_90, ~d1~0=v_~d1~0_75} AuxVars[] AssignedVars[~g1~0, thread2Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread2Thread1of1ForFork1_#res.base, ~pos~0, ~d1~0] [2022-12-13 12:57:56,376 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_3 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_3} OutVars{~g2~0=v_~g2~0_In_3, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 12:58:00,171 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [353] L75-1-->L75-1: Formula: (let ((.cse2 (+ v_~pos~0_117 2)) (.cse1 (= (mod v_~d2~0_77 256) 0)) (.cse3 (= (mod v_~d2~0_78 256) 0))) (and (let ((.cse0 (not (= (mod v_~g2~0_70 256) 0)))) (or (and (= v_~pos~0_117 (+ v_~pos~0_116 2)) .cse0 .cse1) (and (not .cse1) (= v_~pos~0_116 .cse2) .cse0))) (or (and (not .cse3) (= v_~pos~0_117 (+ v_~pos~0_118 2))) (and .cse3 (= v_~pos~0_118 .cse2))) (let ((.cse5 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_50| 256) 0)) (.cse7 (= (mod v_~d2~0_76 256) 0)) (.cse4 (= (ite (= (ite .cse1 1 0) 0) 0 1) v_~d2~0_76)) (.cse6 (= v_~g2~0_69 v_~g2~0_70))) (or (and .cse4 .cse5 .cse6) (and (not .cse5) .cse4 (= v_~g2~0_69 0) (not .cse7)) (and .cse7 .cse4 .cse6))) (let ((.cse8 (= v_~g2~0_71 v_~g2~0_70)) (.cse9 (= v_~d2~0_77 (ite (= (ite .cse3 1 0) 0) 0 1)))) (or (and .cse8 .cse1 .cse9) (and .cse8 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_51| 256) 0) .cse9))))) InVars {~g2~0=v_~g2~0_71, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_51|, ~pos~0=v_~pos~0_118, ~d2~0=v_~d2~0_78} OutVars{~g2~0=v_~g2~0_69, ~pos~0=v_~pos~0_116, ~d2~0=v_~d2~0_76} AuxVars[|v_thread2Thread1of1ForFork1_#t~nondet4_50|, v_~g2~0_70, v_~pos~0_117, v_~d2~0_77] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] and [359] L53-1-->L53-1: Formula: (let ((.cse2 (= (mod v_~d1~0_111 256) 0)) (.cse3 (= (mod v_~d1~0_112 256) 0)) (.cse8 (+ v_~pos~0_151 1))) (and (let ((.cse0 (= v_~g1~0_89 v_~g1~0_88)) (.cse1 (= v_~d1~0_111 (ite (= (ite .cse3 1 0) 0) 0 1)))) (or (and .cse0 .cse1 .cse2) (and (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_80| 256) 0) .cse0 .cse1))) (let ((.cse5 (= (mod v_~d1~0_110 256) 0)) (.cse6 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_79| 256) 0)) (.cse7 (= v_~g1~0_88 v_~g1~0_87)) (.cse4 (= v_~d1~0_110 (ite (= (ite .cse2 1 0) 0) 0 1)))) (or (and .cse4 (not .cse5) (not .cse6) (= v_~g1~0_87 0)) (and .cse7 .cse4 .cse5) (and .cse6 .cse7 .cse4))) (or (and (not (= (mod v_~g1~0_88 256) 0)) (not .cse2) (= v_~pos~0_150 .cse8) (= |v_thread1Thread1of1ForFork0_#t~post2_67| |v_thread1Thread1of1ForFork0_#t~post2_66|)) (and (= |v_thread1Thread1of1ForFork0_#t~post1_67| |v_thread1Thread1of1ForFork0_#t~post1_66|) (= v_~pos~0_151 (+ v_~pos~0_150 1)) .cse2)) (or (and (not .cse3) (not (= (mod v_~g1~0_89 256) 0)) (= v_~pos~0_151 (+ v_~pos~0_152 1)) (= |v_thread1Thread1of1ForFork0_#t~post2_68| |v_thread1Thread1of1ForFork0_#t~post2_67|)) (and .cse3 (= v_~pos~0_152 .cse8) (= |v_thread1Thread1of1ForFork0_#t~post1_68| |v_thread1Thread1of1ForFork0_#t~post1_67|))))) InVars {~g1~0=v_~g1~0_89, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_80|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_68|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_68|, ~pos~0=v_~pos~0_152, ~d1~0=v_~d1~0_112} OutVars{~g1~0=v_~g1~0_87, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_66|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_66|, ~pos~0=v_~pos~0_150, ~d1~0=v_~d1~0_110} AuxVars[v_~g1~0_88, v_~pos~0_151, v_~d1~0_111, |v_thread1Thread1of1ForFork0_#t~nondet3_79|, |v_thread1Thread1of1ForFork0_#t~post1_67|, |v_thread1Thread1of1ForFork0_#t~post2_67|] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 12:58:01,254 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [353] L75-1-->L75-1: Formula: (let ((.cse2 (+ v_~pos~0_117 2)) (.cse1 (= (mod v_~d2~0_77 256) 0)) (.cse3 (= (mod v_~d2~0_78 256) 0))) (and (let ((.cse0 (not (= (mod v_~g2~0_70 256) 0)))) (or (and (= v_~pos~0_117 (+ v_~pos~0_116 2)) .cse0 .cse1) (and (not .cse1) (= v_~pos~0_116 .cse2) .cse0))) (or (and (not .cse3) (= v_~pos~0_117 (+ v_~pos~0_118 2))) (and .cse3 (= v_~pos~0_118 .cse2))) (let ((.cse5 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_50| 256) 0)) (.cse7 (= (mod v_~d2~0_76 256) 0)) (.cse4 (= (ite (= (ite .cse1 1 0) 0) 0 1) v_~d2~0_76)) (.cse6 (= v_~g2~0_69 v_~g2~0_70))) (or (and .cse4 .cse5 .cse6) (and (not .cse5) .cse4 (= v_~g2~0_69 0) (not .cse7)) (and .cse7 .cse4 .cse6))) (let ((.cse8 (= v_~g2~0_71 v_~g2~0_70)) (.cse9 (= v_~d2~0_77 (ite (= (ite .cse3 1 0) 0) 0 1)))) (or (and .cse8 .cse1 .cse9) (and .cse8 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_51| 256) 0) .cse9))))) InVars {~g2~0=v_~g2~0_71, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_51|, ~pos~0=v_~pos~0_118, ~d2~0=v_~d2~0_78} OutVars{~g2~0=v_~g2~0_69, ~pos~0=v_~pos~0_116, ~d2~0=v_~d2~0_76} AuxVars[|v_thread2Thread1of1ForFork1_#t~nondet4_50|, v_~g2~0_70, v_~pos~0_117, v_~d2~0_77] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] and [360] L53-1-->L75-1: Formula: (let ((.cse4 (= (mod v_~d2~0_96 256) 0)) (.cse6 (= (mod v_~d1~0_117 256) 0))) (and (let ((.cse1 (= (mod v_~d2~0_95 256) 0)) (.cse3 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_69| 256) 0)) (.cse0 (= v_~d2~0_95 (ite (= (ite .cse4 1 0) 0) 0 1))) (.cse2 (= v_~g2~0_89 v_~g2~0_88))) (or (and .cse0 .cse1 .cse2) (and (not .cse1) .cse0 (not .cse3) (= v_~g2~0_88 0)) (and .cse3 .cse0 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_94 256) 0)))) (or (and .cse5 .cse6 (= v_~pos~0_158 (+ v_~pos~0_157 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_73| |v_thread1Thread1of1ForFork0_#t~post1_72|)) (and .cse5 (= v_~pos~0_157 (+ v_~pos~0_158 1)) (not .cse6) (= |v_thread1Thread1of1ForFork0_#t~post2_73| |v_thread1Thread1of1ForFork0_#t~post2_72|)))) (let ((.cse7 (not (= (mod v_~g2~0_89 256) 0)))) (or (and (not .cse4) (= v_~pos~0_156 (+ v_~pos~0_157 2)) .cse7) (and (= v_~pos~0_157 (+ v_~pos~0_156 2)) .cse4 .cse7))) (let ((.cse10 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_85| 256) 0)) (.cse8 (= (ite (= (ite .cse6 1 0) 0) 0 1) v_~d1~0_116)) (.cse11 (= (mod v_~d1~0_116 256) 0)) (.cse9 (= v_~g1~0_94 v_~g1~0_93))) (or (and .cse8 .cse9 .cse10) (and .cse8 (= v_~g1~0_93 0) (not .cse11) (not .cse10)) (and .cse8 .cse11 .cse9))))) InVars {~g2~0=v_~g2~0_89, ~g1~0=v_~g1~0_94, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_85|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_73|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_73|, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_69|, ~pos~0=v_~pos~0_158, ~d2~0=v_~d2~0_96, ~d1~0=v_~d1~0_117} OutVars{~g2~0=v_~g2~0_88, ~g1~0=v_~g1~0_93, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_72|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_72|, ~pos~0=v_~pos~0_156, ~d2~0=v_~d2~0_95, ~d1~0=v_~d1~0_116} AuxVars[v_~pos~0_157] AssignedVars[~g2~0, ~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0, ~d1~0] [2022-12-13 12:58:02,926 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [353] L75-1-->L75-1: Formula: (let ((.cse2 (+ v_~pos~0_117 2)) (.cse1 (= (mod v_~d2~0_77 256) 0)) (.cse3 (= (mod v_~d2~0_78 256) 0))) (and (let ((.cse0 (not (= (mod v_~g2~0_70 256) 0)))) (or (and (= v_~pos~0_117 (+ v_~pos~0_116 2)) .cse0 .cse1) (and (not .cse1) (= v_~pos~0_116 .cse2) .cse0))) (or (and (not .cse3) (= v_~pos~0_117 (+ v_~pos~0_118 2))) (and .cse3 (= v_~pos~0_118 .cse2))) (let ((.cse5 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_50| 256) 0)) (.cse7 (= (mod v_~d2~0_76 256) 0)) (.cse4 (= (ite (= (ite .cse1 1 0) 0) 0 1) v_~d2~0_76)) (.cse6 (= v_~g2~0_69 v_~g2~0_70))) (or (and .cse4 .cse5 .cse6) (and (not .cse5) .cse4 (= v_~g2~0_69 0) (not .cse7)) (and .cse7 .cse4 .cse6))) (let ((.cse8 (= v_~g2~0_71 v_~g2~0_70)) (.cse9 (= v_~d2~0_77 (ite (= (ite .cse3 1 0) 0) 0 1)))) (or (and .cse8 .cse1 .cse9) (and .cse8 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_51| 256) 0) .cse9))))) InVars {~g2~0=v_~g2~0_71, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_51|, ~pos~0=v_~pos~0_118, ~d2~0=v_~d2~0_78} OutVars{~g2~0=v_~g2~0_69, ~pos~0=v_~pos~0_116, ~d2~0=v_~d2~0_76} AuxVars[|v_thread2Thread1of1ForFork1_#t~nondet4_50|, v_~g2~0_70, v_~pos~0_117, v_~d2~0_77] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] and [362] L53-1-->L53-1: Formula: (let ((.cse6 (+ v_~pos~0_163 1)) (.cse4 (= (mod v_~d1~0_121 256) 0)) (.cse5 (= (mod v_~d1~0_122 256) 0))) (and (let ((.cse0 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_89| 256) 0)) (.cse3 (= (mod v_~d1~0_120 256) 0)) (.cse1 (= v_~g1~0_98 v_~g1~0_97)) (.cse2 (= (ite (= (ite .cse4 1 0) 0) 0 1) v_~d1~0_120))) (or (and .cse0 .cse1 .cse2) (and (not .cse0) .cse2 (not .cse3) (= v_~g1~0_97 0)) (and .cse3 .cse1 .cse2))) (= (mod v_~g2~0_92 256) 0) (or (and .cse5 (= v_~pos~0_164 .cse6) (= |v_thread1Thread1of1ForFork0_#t~post1_78| |v_thread1Thread1of1ForFork0_#t~post1_77|)) (and (not .cse5) (= v_~pos~0_163 (+ v_~pos~0_164 1)) (= |v_thread1Thread1of1ForFork0_#t~post2_78| |v_thread1Thread1of1ForFork0_#t~post2_77|))) (let ((.cse7 (not (= (mod v_~g1~0_98 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_77| |v_thread1Thread1of1ForFork0_#t~post1_76|) .cse7 .cse4 (= v_~pos~0_163 (+ v_~pos~0_162 1))) (and (not .cse4) .cse7 (= v_~pos~0_162 .cse6) (= |v_thread1Thread1of1ForFork0_#t~post2_77| |v_thread1Thread1of1ForFork0_#t~post2_76|)))) (= |v_thread2Thread1of1ForFork1_#res.base_19| 0) (let ((.cse8 (= v_~g1~0_99 v_~g1~0_98)) (.cse9 (= v_~d1~0_121 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse8 .cse9 .cse4) (and .cse8 .cse9 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_90| 256) 0)))) (= |v_thread2Thread1of1ForFork1_#res.offset_19| 0))) InVars {~g2~0=v_~g2~0_92, ~g1~0=v_~g1~0_99, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_90|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_78|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_78|, ~pos~0=v_~pos~0_164, ~d1~0=v_~d1~0_122} OutVars{~g2~0=v_~g2~0_92, ~g1~0=v_~g1~0_97, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_19|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_76|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_76|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_19|, ~pos~0=v_~pos~0_162, ~d1~0=v_~d1~0_120} AuxVars[|v_thread1Thread1of1ForFork0_#t~nondet3_89|, v_~pos~0_163, v_~d1~0_121, v_~g1~0_98, |v_thread1Thread1of1ForFork0_#t~post2_77|, |v_thread1Thread1of1ForFork0_#t~post1_77|] AssignedVars[~g1~0, thread2Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread2Thread1of1ForFork1_#res.base, ~pos~0, ~d1~0] [2022-12-13 12:58:04,116 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [353] L75-1-->L75-1: Formula: (let ((.cse2 (+ v_~pos~0_117 2)) (.cse1 (= (mod v_~d2~0_77 256) 0)) (.cse3 (= (mod v_~d2~0_78 256) 0))) (and (let ((.cse0 (not (= (mod v_~g2~0_70 256) 0)))) (or (and (= v_~pos~0_117 (+ v_~pos~0_116 2)) .cse0 .cse1) (and (not .cse1) (= v_~pos~0_116 .cse2) .cse0))) (or (and (not .cse3) (= v_~pos~0_117 (+ v_~pos~0_118 2))) (and .cse3 (= v_~pos~0_118 .cse2))) (let ((.cse5 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_50| 256) 0)) (.cse7 (= (mod v_~d2~0_76 256) 0)) (.cse4 (= (ite (= (ite .cse1 1 0) 0) 0 1) v_~d2~0_76)) (.cse6 (= v_~g2~0_69 v_~g2~0_70))) (or (and .cse4 .cse5 .cse6) (and (not .cse5) .cse4 (= v_~g2~0_69 0) (not .cse7)) (and .cse7 .cse4 .cse6))) (let ((.cse8 (= v_~g2~0_71 v_~g2~0_70)) (.cse9 (= v_~d2~0_77 (ite (= (ite .cse3 1 0) 0) 0 1)))) (or (and .cse8 .cse1 .cse9) (and .cse8 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_51| 256) 0) .cse9))))) InVars {~g2~0=v_~g2~0_71, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_51|, ~pos~0=v_~pos~0_118, ~d2~0=v_~d2~0_78} OutVars{~g2~0=v_~g2~0_69, ~pos~0=v_~pos~0_116, ~d2~0=v_~d2~0_76} AuxVars[|v_thread2Thread1of1ForFork1_#t~nondet4_50|, v_~g2~0_70, v_~pos~0_117, v_~d2~0_77] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] and [365] L53-1-->L53-1: Formula: (let ((.cse5 (+ v_~pos~0_176 1)) (.cse3 (= (mod v_~d1~0_133 256) 0)) (.cse1 (= (mod v_~d1~0_134 256) 0)) (.cse4 (+ v_~pos~0_174 1)) (.cse8 (= (mod v_~d1~0_132 256) 0))) (and (let ((.cse0 (= (ite (= (ite .cse3 1 0) 0) 0 1) v_~d1~0_134)) (.cse2 (= v_~g1~0_111 v_~g1~0_110))) (or (and .cse0 .cse1 .cse2) (and .cse0 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_102| 256) 0) .cse2))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_88| |v_thread1Thread1of1ForFork0_#t~post1_90|) (= v_~pos~0_176 .cse4) .cse1) (and (= v_~pos~0_174 .cse5) (not .cse1) (= |v_thread1Thread1of1ForFork0_#t~post2_90| |v_thread1Thread1of1ForFork0_#t~post2_88|) (not (= (mod v_~g1~0_111 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_90| |v_thread1Thread1of1ForFork0_#t~post2_89|) (not .cse3) (= v_~pos~0_176 (+ v_~pos~0_175 1))) (and (= v_~pos~0_175 .cse5) .cse3 (= |v_thread1Thread1of1ForFork0_#t~post1_89| |v_thread1Thread1of1ForFork0_#t~post1_90|))) (= (mod v_~g2~0_96 256) 0) (let ((.cse6 (= v_~d1~0_132 (ite (= (ite .cse1 1 0) 0) 0 1))) (.cse7 (= v_~g1~0_109 v_~g1~0_111))) (or (and .cse6 .cse7 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_101| 256) 0)) (and .cse8 .cse6 .cse7))) (= |v_thread2Thread1of1ForFork1_#res.offset_23| 0) (= |v_thread2Thread1of1ForFork1_#res.base_23| 0) (or (and (= v_~pos~0_174 (+ v_~pos~0_173 1)) .cse8 (= |v_thread1Thread1of1ForFork0_#t~post1_88| |v_thread1Thread1of1ForFork0_#t~post1_87|)) (and (not (= (mod v_~g1~0_109 256) 0)) (= |v_thread1Thread1of1ForFork0_#t~post2_88| |v_thread1Thread1of1ForFork0_#t~post2_87|) (not .cse8) (= v_~pos~0_173 .cse4))) (let ((.cse10 (= v_~g1~0_109 v_~g1~0_108)) (.cse12 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_100| 256) 0)) (.cse9 (= (mod v_~d1~0_131 256) 0)) (.cse11 (= v_~d1~0_131 (ite (= (ite .cse8 1 0) 0) 0 1)))) (or (and .cse9 .cse10 .cse11) (and .cse12 .cse10 .cse11) (and (= v_~g1~0_108 0) (not .cse12) (not .cse9) .cse11))))) InVars {~g2~0=v_~g2~0_96, ~g1~0=v_~g1~0_110, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_102|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_89|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_89|, ~pos~0=v_~pos~0_175, ~d1~0=v_~d1~0_133} OutVars{~g2~0=v_~g2~0_96, ~g1~0=v_~g1~0_108, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_23|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_87|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_87|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_23|, ~pos~0=v_~pos~0_173, ~d1~0=v_~d1~0_131} AuxVars[|v_thread1Thread1of1ForFork0_#t~nondet3_100|, v_~pos~0_176, v_~g1~0_109, |v_thread1Thread1of1ForFork0_#t~nondet3_101|, |v_thread1Thread1of1ForFork0_#t~post2_90|, |v_thread1Thread1of1ForFork0_#t~post1_90|, v_~pos~0_174, v_~d1~0_132, v_~d1~0_134, v_~g1~0_111, |v_thread1Thread1of1ForFork0_#t~post2_88|, |v_thread1Thread1of1ForFork0_#t~post1_88|] AssignedVars[~g1~0, thread2Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread2Thread1of1ForFork1_#res.base, ~pos~0, ~d1~0] [2022-12-13 12:58:07,214 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [353] L75-1-->L75-1: Formula: (let ((.cse2 (+ v_~pos~0_117 2)) (.cse1 (= (mod v_~d2~0_77 256) 0)) (.cse3 (= (mod v_~d2~0_78 256) 0))) (and (let ((.cse0 (not (= (mod v_~g2~0_70 256) 0)))) (or (and (= v_~pos~0_117 (+ v_~pos~0_116 2)) .cse0 .cse1) (and (not .cse1) (= v_~pos~0_116 .cse2) .cse0))) (or (and (not .cse3) (= v_~pos~0_117 (+ v_~pos~0_118 2))) (and .cse3 (= v_~pos~0_118 .cse2))) (let ((.cse5 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_50| 256) 0)) (.cse7 (= (mod v_~d2~0_76 256) 0)) (.cse4 (= (ite (= (ite .cse1 1 0) 0) 0 1) v_~d2~0_76)) (.cse6 (= v_~g2~0_69 v_~g2~0_70))) (or (and .cse4 .cse5 .cse6) (and (not .cse5) .cse4 (= v_~g2~0_69 0) (not .cse7)) (and .cse7 .cse4 .cse6))) (let ((.cse8 (= v_~g2~0_71 v_~g2~0_70)) (.cse9 (= v_~d2~0_77 (ite (= (ite .cse3 1 0) 0) 0 1)))) (or (and .cse8 .cse1 .cse9) (and .cse8 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_51| 256) 0) .cse9))))) InVars {~g2~0=v_~g2~0_71, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_51|, ~pos~0=v_~pos~0_118, ~d2~0=v_~d2~0_78} OutVars{~g2~0=v_~g2~0_69, ~pos~0=v_~pos~0_116, ~d2~0=v_~d2~0_76} AuxVars[|v_thread2Thread1of1ForFork1_#t~nondet4_50|, v_~g2~0_70, v_~pos~0_117, v_~d2~0_77] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] and [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 12:58:09,570 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_3 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_3} OutVars{~g2~0=v_~g2~0_In_3, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 12:58:13,495 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 12:58:13,496 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18978 [2022-12-13 12:58:13,496 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 46 transitions, 409 flow [2022-12-13 12:58:13,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:58:13,497 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:58:13,497 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:58:13,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 12:58:13,702 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,SelfDestructingSolverStorable3 [2022-12-13 12:58:13,703 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:58:13,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:58:13,703 INFO L85 PathProgramCache]: Analyzing trace with hash 640332303, now seen corresponding path program 1 times [2022-12-13 12:58:13,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:58:13,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87561072] [2022-12-13 12:58:13,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:58:13,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:58:13,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:58:13,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:58:13,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:58:13,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87561072] [2022-12-13 12:58:13,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87561072] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:58:13,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:58:13,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:58:13,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586475415] [2022-12-13 12:58:13,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:58:13,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:58:13,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:58:13,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:58:13,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:58:13,940 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 12:58:13,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 46 transitions, 409 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:58:13,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:58:13,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 12:58:13,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:58:14,072 INFO L130 PetriNetUnfolder]: 149/260 cut-off events. [2022-12-13 12:58:14,072 INFO L131 PetriNetUnfolder]: For 608/608 co-relation queries the response was YES. [2022-12-13 12:58:14,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1276 conditions, 260 events. 149/260 cut-off events. For 608/608 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 912 event pairs, 29 based on Foata normal form. 1/251 useless extension candidates. Maximal degree in co-relation 1220. Up to 171 conditions per place. [2022-12-13 12:58:14,074 INFO L137 encePairwiseOnDemand]: 21/33 looper letters, 38 selfloop transitions, 12 changer transitions 7/57 dead transitions. [2022-12-13 12:58:14,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 57 transitions, 591 flow [2022-12-13 12:58:14,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:58:14,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:58:14,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-13 12:58:14,075 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2022-12-13 12:58:14,076 INFO L175 Difference]: Start difference. First operand has 39 places, 46 transitions, 409 flow. Second operand 3 states and 45 transitions. [2022-12-13 12:58:14,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 57 transitions, 591 flow [2022-12-13 12:58:14,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 57 transitions, 501 flow, removed 38 selfloop flow, removed 3 redundant places. [2022-12-13 12:58:14,080 INFO L231 Difference]: Finished difference. Result has 39 places, 46 transitions, 380 flow [2022-12-13 12:58:14,080 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=380, PETRI_PLACES=39, PETRI_TRANSITIONS=46} [2022-12-13 12:58:14,081 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 21 predicate places. [2022-12-13 12:58:14,081 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:58:14,081 INFO L89 Accepts]: Start accepts. Operand has 39 places, 46 transitions, 380 flow [2022-12-13 12:58:14,082 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:58:14,082 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:58:14,082 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 46 transitions, 380 flow [2022-12-13 12:58:14,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 46 transitions, 380 flow [2022-12-13 12:58:14,093 INFO L130 PetriNetUnfolder]: 34/86 cut-off events. [2022-12-13 12:58:14,093 INFO L131 PetriNetUnfolder]: For 159/192 co-relation queries the response was YES. [2022-12-13 12:58:14,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 86 events. 34/86 cut-off events. For 159/192 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 273 event pairs, 1 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 307. Up to 41 conditions per place. [2022-12-13 12:58:14,095 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 46 transitions, 380 flow [2022-12-13 12:58:14,095 INFO L226 LiptonReduction]: Number of co-enabled transitions 146 [2022-12-13 12:58:16,464 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [380] L75-1-->L75-1: Formula: (let ((.cse5 (= (mod v_~d2~0_141 256) 0)) (.cse11 (+ v_~pos~0_265 2)) (.cse6 (+ v_~pos~0_267 2)) (.cse4 (= (mod v_~d2~0_140 256) 0)) (.cse7 (= (mod v_~d2~0_142 256) 0))) (and (let ((.cse1 (= v_~g2~0_145 v_~g2~0_144)) (.cse0 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_113| 256) 0)) (.cse3 (= (mod v_~d2~0_139 256) 0)) (.cse2 (= v_~d2~0_139 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse2) (and (not .cse0) (= v_~g2~0_144 0) (not .cse3) .cse2))) (or (and (= v_~pos~0_267 (+ v_~pos~0_266 2)) (not .cse5)) (and (= v_~pos~0_266 .cse6) .cse5)) (let ((.cse8 (= (ite (= (ite .cse5 1 0) 0) 0 1) v_~d2~0_142)) (.cse9 (= v_~g2~0_147 v_~g2~0_146))) (or (and .cse7 .cse8 .cse9) (and (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_115| 256) 0) .cse8 .cse9))) (let ((.cse10 (not (= (mod v_~g2~0_145 256) 0)))) (or (and .cse4 (= v_~pos~0_265 (+ v_~pos~0_264 2)) .cse10) (and (not .cse4) (= v_~pos~0_264 .cse11) .cse10))) (or (and .cse7 (= v_~pos~0_267 .cse11)) (and (= v_~pos~0_265 .cse6) (not .cse7))) (let ((.cse12 (= v_~g2~0_147 v_~g2~0_145)) (.cse13 (= v_~d2~0_140 (ite (= (ite .cse7 1 0) 0) 0 1)))) (or (and .cse12 .cse13 .cse4) (and (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_114| 256) 0) .cse12 .cse13))))) InVars {~g2~0=v_~g2~0_146, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_115|, ~pos~0=v_~pos~0_266, ~d2~0=v_~d2~0_141} OutVars{~g2~0=v_~g2~0_144, ~pos~0=v_~pos~0_264, ~d2~0=v_~d2~0_139} AuxVars[v_~d2~0_142, v_~pos~0_267, |v_thread2Thread1of1ForFork1_#t~nondet4_113|, v_~g2~0_147, v_~pos~0_265, |v_thread2Thread1of1ForFork1_#t~nondet4_114|, v_~g2~0_145, v_~d2~0_140] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] and [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 12:58:17,578 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:58:17,579 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3498 [2022-12-13 12:58:17,579 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 46 transitions, 388 flow [2022-12-13 12:58:17,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:58:17,580 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:58:17,580 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:58:17,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:58:17,580 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:58:17,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:58:17,580 INFO L85 PathProgramCache]: Analyzing trace with hash 668961454, now seen corresponding path program 1 times [2022-12-13 12:58:17,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:58:17,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572027933] [2022-12-13 12:58:17,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:58:17,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:58:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:58:17,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:58:17,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:58:17,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572027933] [2022-12-13 12:58:17,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572027933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:58:17,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:58:17,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:58:17,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363024880] [2022-12-13 12:58:17,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:58:17,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:58:17,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:58:17,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:58:17,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:58:17,866 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 12:58:17,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 46 transitions, 388 flow. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:58:17,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:58:17,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 12:58:17,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:58:17,987 INFO L130 PetriNetUnfolder]: 144/242 cut-off events. [2022-12-13 12:58:17,987 INFO L131 PetriNetUnfolder]: For 492/492 co-relation queries the response was YES. [2022-12-13 12:58:17,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1203 conditions, 242 events. 144/242 cut-off events. For 492/492 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 793 event pairs, 10 based on Foata normal form. 8/242 useless extension candidates. Maximal degree in co-relation 1001. Up to 192 conditions per place. [2022-12-13 12:58:17,989 INFO L137 encePairwiseOnDemand]: 13/31 looper letters, 37 selfloop transitions, 21 changer transitions 0/58 dead transitions. [2022-12-13 12:58:17,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 58 transitions, 580 flow [2022-12-13 12:58:17,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:58:17,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:58:17,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-13 12:58:17,990 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2022-12-13 12:58:17,990 INFO L175 Difference]: Start difference. First operand has 36 places, 46 transitions, 388 flow. Second operand 4 states and 44 transitions. [2022-12-13 12:58:17,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 58 transitions, 580 flow [2022-12-13 12:58:17,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 58 transitions, 556 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 12:58:17,994 INFO L231 Difference]: Finished difference. Result has 38 places, 48 transitions, 458 flow [2022-12-13 12:58:17,994 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=458, PETRI_PLACES=38, PETRI_TRANSITIONS=48} [2022-12-13 12:58:17,994 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 20 predicate places. [2022-12-13 12:58:17,994 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:58:17,995 INFO L89 Accepts]: Start accepts. Operand has 38 places, 48 transitions, 458 flow [2022-12-13 12:58:17,995 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:58:17,995 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:58:17,995 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 48 transitions, 458 flow [2022-12-13 12:58:17,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 48 transitions, 458 flow [2022-12-13 12:58:18,016 INFO L130 PetriNetUnfolder]: 36/89 cut-off events. [2022-12-13 12:58:18,016 INFO L131 PetriNetUnfolder]: For 223/238 co-relation queries the response was YES. [2022-12-13 12:58:18,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 89 events. 36/89 cut-off events. For 223/238 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 294 event pairs, 1 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 354. Up to 43 conditions per place. [2022-12-13 12:58:18,017 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 48 transitions, 458 flow [2022-12-13 12:58:18,017 INFO L226 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-13 12:58:18,053 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] L53-1-->L53-1: Formula: (let ((.cse5 (= (mod v_~d1~0_227 256) 0)) (.cse4 (= (mod v_~d1~0_226 256) 0)) (.cse12 (+ v_~pos~0_304 1)) (.cse6 (+ v_~pos~0_306 1)) (.cse9 (= (mod v_~d1~0_228 256) 0))) (and (let ((.cse1 (= v_~g1~0_203 v_~g1~0_202)) (.cse0 (= (mod v_~d1~0_225 256) 0)) (.cse2 (= (ite (= (ite .cse4 1 0) 0) 0 1) v_~d1~0_225)) (.cse3 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_194| 256) 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse2) (and (= v_~g1~0_202 0) (not .cse0) .cse2 (not .cse3)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_184| |v_thread1Thread1of1ForFork0_#t~post1_183|) .cse5 (= v_~pos~0_305 .cse6)) (and (not .cse5) (= v_~pos~0_306 (+ v_~pos~0_305 1)) (= |v_thread1Thread1of1ForFork0_#t~post2_184| |v_thread1Thread1of1ForFork0_#t~post2_183|))) (let ((.cse7 (= v_~g1~0_205 v_~g1~0_203)) (.cse8 (= v_~d1~0_226 (ite (= (ite .cse9 1 0) 0) 0 1)))) (or (and .cse7 .cse8 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_195| 256) 0)) (and .cse7 .cse8 .cse4))) (let ((.cse10 (= v_~g1~0_205 v_~g1~0_204)) (.cse11 (= v_~d1~0_228 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse10 .cse11 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_196| 256) 0)) (and .cse9 .cse10 .cse11))) (or (and (not (= 0 (mod v_~g1~0_203 256))) (not .cse4) (= v_~pos~0_303 .cse12) (= |v_thread1Thread1of1ForFork0_#t~post2_182| |v_thread1Thread1of1ForFork0_#t~post2_181|)) (and (= v_~pos~0_304 (+ v_~pos~0_303 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_182| |v_thread1Thread1of1ForFork0_#t~post1_181|) .cse4)) (or (and .cse9 (= v_~pos~0_306 .cse12) (= |v_thread1Thread1of1ForFork0_#t~post1_184| |v_thread1Thread1of1ForFork0_#t~post1_182|)) (and (= v_~pos~0_304 .cse6) (= |v_thread1Thread1of1ForFork0_#t~post2_184| |v_thread1Thread1of1ForFork0_#t~post2_182|) (not .cse9) (not (= (mod v_~g1~0_205 256) 0)))))) InVars {~g1~0=v_~g1~0_204, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_196|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_183|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_183|, ~pos~0=v_~pos~0_305, ~d1~0=v_~d1~0_227} OutVars{~g1~0=v_~g1~0_202, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_181|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_181|, ~pos~0=v_~pos~0_303, ~d1~0=v_~d1~0_225} AuxVars[v_~g1~0_205, v_~d1~0_228, v_~d1~0_226, |v_thread1Thread1of1ForFork0_#t~post2_184|, |v_thread1Thread1of1ForFork0_#t~post1_182|, |v_thread1Thread1of1ForFork0_#t~post2_182|, v_~pos~0_306, v_~g1~0_203, |v_thread1Thread1of1ForFork0_#t~nondet3_195|, |v_thread1Thread1of1ForFork0_#t~post1_184|, |v_thread1Thread1of1ForFork0_#t~nondet3_194|, v_~pos~0_304] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [350] L75-1-->L75-1: Formula: (let ((.cse4 (= (mod v_~d2~0_71 256) 0)) (.cse8 (= (mod v_~d2~0_72 256) 0)) (.cse5 (+ v_~pos~0_104 2))) (and (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_44| 256) 0)) (.cse0 (= (mod v_~d2~0_70 256) 0)) (.cse3 (= v_~g2~0_62 v_~g2~0_61)) (.cse1 (= v_~d2~0_70 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) .cse1 (not .cse2) (= v_~g2~0_61 0)) (and .cse3 .cse1 .cse2) (and .cse0 .cse3 .cse1))) (or (and .cse4 (= v_~pos~0_104 (+ v_~pos~0_103 2))) (and (not .cse4) (= v_~pos~0_103 .cse5))) (let ((.cse6 (= v_~g2~0_63 v_~g2~0_62)) (.cse7 (= v_~d2~0_71 (ite (= (ite .cse8 1 0) 0) 0 1)))) (or (and .cse6 .cse7 .cse4) (and .cse6 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_45| 256) 0) .cse7))) (let ((.cse9 (not (= (mod v_~g2~0_63 256) 0)))) (or (and (= v_~pos~0_104 (+ v_~pos~0_105 2)) .cse9 (not .cse8)) (and .cse8 (= v_~pos~0_105 .cse5) .cse9))))) InVars {~g2~0=v_~g2~0_63, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_45|, ~pos~0=v_~pos~0_105, ~d2~0=v_~d2~0_72} OutVars{~g2~0=v_~g2~0_61, ~pos~0=v_~pos~0_103, ~d2~0=v_~d2~0_70} AuxVars[v_~pos~0_104, v_~d2~0_71, |v_thread2Thread1of1ForFork1_#t~nondet4_44|, v_~g2~0_62] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 12:58:19,587 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:58:19,588 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1594 [2022-12-13 12:58:19,588 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 47 transitions, 454 flow [2022-12-13 12:58:19,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:58:19,588 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:58:19,588 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:58:19,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:58:19,589 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:58:19,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:58:19,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1073101926, now seen corresponding path program 1 times [2022-12-13 12:58:19,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:58:19,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200939487] [2022-12-13 12:58:19,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:58:19,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:58:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:58:19,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 12:58:19,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:58:19,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200939487] [2022-12-13 12:58:19,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200939487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:58:19,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:58:19,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:58:19,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890606271] [2022-12-13 12:58:19,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:58:19,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:58:19,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:58:19,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:58:19,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:58:19,797 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 12:58:19,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 47 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:58:19,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:58:19,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 12:58:19,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:58:19,925 INFO L130 PetriNetUnfolder]: 157/269 cut-off events. [2022-12-13 12:58:19,925 INFO L131 PetriNetUnfolder]: For 706/706 co-relation queries the response was YES. [2022-12-13 12:58:19,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1421 conditions, 269 events. 157/269 cut-off events. For 706/706 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 913 event pairs, 34 based on Foata normal form. 2/259 useless extension candidates. Maximal degree in co-relation 1159. Up to 144 conditions per place. [2022-12-13 12:58:19,928 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 48 selfloop transitions, 9 changer transitions 0/57 dead transitions. [2022-12-13 12:58:19,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 57 transitions, 662 flow [2022-12-13 12:58:19,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:58:19,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:58:19,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-13 12:58:19,929 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43010752688172044 [2022-12-13 12:58:19,929 INFO L175 Difference]: Start difference. First operand has 37 places, 47 transitions, 454 flow. Second operand 3 states and 40 transitions. [2022-12-13 12:58:19,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 57 transitions, 662 flow [2022-12-13 12:58:19,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 57 transitions, 619 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-13 12:58:19,932 INFO L231 Difference]: Finished difference. Result has 38 places, 47 transitions, 450 flow [2022-12-13 12:58:19,932 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=38, PETRI_TRANSITIONS=47} [2022-12-13 12:58:19,933 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 20 predicate places. [2022-12-13 12:58:19,933 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:58:19,933 INFO L89 Accepts]: Start accepts. Operand has 38 places, 47 transitions, 450 flow [2022-12-13 12:58:19,934 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:58:19,934 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:58:19,934 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 47 transitions, 450 flow [2022-12-13 12:58:19,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 47 transitions, 450 flow [2022-12-13 12:58:19,949 INFO L130 PetriNetUnfolder]: 40/102 cut-off events. [2022-12-13 12:58:19,949 INFO L131 PetriNetUnfolder]: For 233/242 co-relation queries the response was YES. [2022-12-13 12:58:19,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 102 events. 40/102 cut-off events. For 233/242 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 356 event pairs, 2 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 426. Up to 54 conditions per place. [2022-12-13 12:58:19,950 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 47 transitions, 450 flow [2022-12-13 12:58:19,951 INFO L226 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-13 12:58:19,953 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:58:19,954 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-13 12:58:19,954 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 47 transitions, 450 flow [2022-12-13 12:58:19,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:58:19,954 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:58:19,954 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:58:19,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:58:19,955 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:58:19,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:58:19,955 INFO L85 PathProgramCache]: Analyzing trace with hash 675654869, now seen corresponding path program 1 times [2022-12-13 12:58:19,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:58:19,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661008044] [2022-12-13 12:58:19,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:58:19,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:58:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:58:20,315 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-13 12:58:20,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:58:20,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661008044] [2022-12-13 12:58:20,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661008044] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:58:20,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066073528] [2022-12-13 12:58:20,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:58:20,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:58:20,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:58:20,320 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-13 12:58:20,323 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-13 12:58:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:58:20,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 12:58:20,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:58:20,562 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-13 12:58:20,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:58:20,793 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-13 12:58:20,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066073528] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:58:20,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:58:20,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 12:58:20,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760736907] [2022-12-13 12:58:20,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:58:20,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 12:58:20,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:58:20,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 12:58:20,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:58:20,795 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 12:58:20,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 47 transitions, 450 flow. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:58:20,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:58:20,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 12:58:20,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:58:21,053 INFO L130 PetriNetUnfolder]: 189/337 cut-off events. [2022-12-13 12:58:21,053 INFO L131 PetriNetUnfolder]: For 884/884 co-relation queries the response was YES. [2022-12-13 12:58:21,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1841 conditions, 337 events. 189/337 cut-off events. For 884/884 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1298 event pairs, 4 based on Foata normal form. 14/339 useless extension candidates. Maximal degree in co-relation 1482. Up to 171 conditions per place. [2022-12-13 12:58:21,056 INFO L137 encePairwiseOnDemand]: 10/30 looper letters, 44 selfloop transitions, 39 changer transitions 13/96 dead transitions. [2022-12-13 12:58:21,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 96 transitions, 971 flow [2022-12-13 12:58:21,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 12:58:21,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 12:58:21,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 76 transitions. [2022-12-13 12:58:21,058 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23030303030303031 [2022-12-13 12:58:21,058 INFO L175 Difference]: Start difference. First operand has 38 places, 47 transitions, 450 flow. Second operand 11 states and 76 transitions. [2022-12-13 12:58:21,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 96 transitions, 971 flow [2022-12-13 12:58:21,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 96 transitions, 954 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-13 12:58:21,064 INFO L231 Difference]: Finished difference. Result has 48 places, 57 transitions, 661 flow [2022-12-13 12:58:21,064 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=661, PETRI_PLACES=48, PETRI_TRANSITIONS=57} [2022-12-13 12:58:21,067 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 30 predicate places. [2022-12-13 12:58:21,067 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:58:21,067 INFO L89 Accepts]: Start accepts. Operand has 48 places, 57 transitions, 661 flow [2022-12-13 12:58:21,068 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:58:21,068 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:58:21,068 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 57 transitions, 661 flow [2022-12-13 12:58:21,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 57 transitions, 661 flow [2022-12-13 12:58:21,084 INFO L130 PetriNetUnfolder]: 44/111 cut-off events. [2022-12-13 12:58:21,084 INFO L131 PetriNetUnfolder]: For 325/334 co-relation queries the response was YES. [2022-12-13 12:58:21,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 618 conditions, 111 events. 44/111 cut-off events. For 325/334 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 388 event pairs, 0 based on Foata normal form. 1/107 useless extension candidates. Maximal degree in co-relation 566. Up to 65 conditions per place. [2022-12-13 12:58:21,086 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 57 transitions, 661 flow [2022-12-13 12:58:21,086 INFO L226 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-13 12:58:21,116 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L53-1-->L53-1: Formula: (let ((.cse0 (= (mod v_~d1~0_102 256) 0)) (.cse3 (= (mod v_~d1~0_101 256) 0)) (.cse1 (+ v_~pos~0_135 1))) (and (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_56| |v_thread1Thread1of1ForFork0_#t~post1_55|) .cse0 (= v_~pos~0_136 .cse1)) (and (= |v_thread1Thread1of1ForFork0_#t~post2_56| |v_thread1Thread1of1ForFork0_#t~post2_55|) (not (= (mod v_~g1~0_79 256) 0)) (= v_~pos~0_135 (+ v_~pos~0_136 1)) (not .cse0))) (let ((.cse2 (= v_~g1~0_78 v_~g1~0_79)) (.cse4 (= v_~d1~0_101 (ite (= (ite .cse0 1 0) 0) 0 1)))) (or (and .cse2 .cse3 .cse4) (and .cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_70| 256) 0) .cse4))) (let ((.cse6 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_69| 256) 0)) (.cse8 (= v_~g1~0_78 v_~g1~0_77)) (.cse5 (= (mod v_~d1~0_100 256) 0)) (.cse7 (= (ite (= (ite .cse3 1 0) 0) 0 1) v_~d1~0_100))) (or (and (not .cse5) (= v_~g1~0_77 0) (not .cse6) .cse7) (and .cse8 .cse6 .cse7) (and .cse8 .cse5 .cse7))) (or (and (= v_~pos~0_135 (+ v_~pos~0_134 1)) .cse3 (= |v_thread1Thread1of1ForFork0_#t~post1_55| |v_thread1Thread1of1ForFork0_#t~post1_54|)) (and (not .cse3) (= |v_thread1Thread1of1ForFork0_#t~post2_55| |v_thread1Thread1of1ForFork0_#t~post2_54|) (not (= (mod v_~g1~0_78 256) 0)) (= v_~pos~0_134 .cse1))))) InVars {~g1~0=v_~g1~0_79, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_70|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_56|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_56|, ~pos~0=v_~pos~0_136, ~d1~0=v_~d1~0_102} OutVars{~g1~0=v_~g1~0_77, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_54|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_54|, ~pos~0=v_~pos~0_134, ~d1~0=v_~d1~0_100} AuxVars[v_~pos~0_135, v_~g1~0_78, v_~d1~0_101, |v_thread1Thread1of1ForFork0_#t~nondet3_69|, |v_thread1Thread1of1ForFork0_#t~post2_55|, |v_thread1Thread1of1ForFork0_#t~post1_55|] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [350] L75-1-->L75-1: Formula: (let ((.cse4 (= (mod v_~d2~0_71 256) 0)) (.cse8 (= (mod v_~d2~0_72 256) 0)) (.cse5 (+ v_~pos~0_104 2))) (and (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_44| 256) 0)) (.cse0 (= (mod v_~d2~0_70 256) 0)) (.cse3 (= v_~g2~0_62 v_~g2~0_61)) (.cse1 (= v_~d2~0_70 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) .cse1 (not .cse2) (= v_~g2~0_61 0)) (and .cse3 .cse1 .cse2) (and .cse0 .cse3 .cse1))) (or (and .cse4 (= v_~pos~0_104 (+ v_~pos~0_103 2))) (and (not .cse4) (= v_~pos~0_103 .cse5))) (let ((.cse6 (= v_~g2~0_63 v_~g2~0_62)) (.cse7 (= v_~d2~0_71 (ite (= (ite .cse8 1 0) 0) 0 1)))) (or (and .cse6 .cse7 .cse4) (and .cse6 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_45| 256) 0) .cse7))) (let ((.cse9 (not (= (mod v_~g2~0_63 256) 0)))) (or (and (= v_~pos~0_104 (+ v_~pos~0_105 2)) .cse9 (not .cse8)) (and .cse8 (= v_~pos~0_105 .cse5) .cse9))))) InVars {~g2~0=v_~g2~0_63, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_45|, ~pos~0=v_~pos~0_105, ~d2~0=v_~d2~0_72} OutVars{~g2~0=v_~g2~0_61, ~pos~0=v_~pos~0_103, ~d2~0=v_~d2~0_70} AuxVars[v_~pos~0_104, v_~d2~0_71, |v_thread2Thread1of1ForFork1_#t~nondet4_44|, v_~g2~0_62] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 12:58:22,257 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [387] L53-1-->L53-1: Formula: (let ((.cse2 (+ v_~pos~0_293 1)) (.cse1 (+ v_~pos~0_296 1)) (.cse0 (= (mod v_~d1~0_218 256) 0)) (.cse12 (= (mod v_~d1~0_217 256) 0)) (.cse5 (= (mod v_~d1~0_215 256) 0)) (.cse11 (+ v_~pos~0_294 1)) (.cse10 (= (mod v_~d1~0_216 256) 0))) (and (or (and (not .cse0) (= .cse1 v_~pos~0_293) (= |v_thread1Thread1of1ForFork0_#t~post2_174| |v_thread1Thread1of1ForFork0_#t~post2_171|)) (and (= v_~pos~0_296 .cse2) .cse0 (= |v_thread1Thread1of1ForFork0_#t~post1_174| |v_thread1Thread1of1ForFork0_#t~post1_171|))) (let ((.cse3 (= v_~g1~0_195 v_~g1~0_192)) (.cse4 (= v_~d1~0_215 (ite (= (ite .cse0 1 0) 0) 0 1)))) (or (and (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_185| 256) 0) .cse3 .cse4) (and .cse5 .cse3 .cse4))) (let ((.cse8 (= v_~g1~0_193 v_~g1~0_191)) (.cse6 (= (ite (= (ite .cse10 1 0) 0) 0 1) v_~d1~0_214)) (.cse7 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_182| 256) 0)) (.cse9 (= (mod v_~d1~0_214 256) 0))) (or (and .cse6 .cse7 .cse8) (and .cse6 .cse9 .cse8) (and .cse6 (not .cse7) (not .cse9) (= v_~g1~0_191 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_172| |v_thread1Thread1of1ForFork0_#t~post2_171|) (not .cse5) (= v_~pos~0_294 .cse2)) (and (= v_~pos~0_293 .cse11) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post1_172| |v_thread1Thread1of1ForFork0_#t~post1_171|))) (or (and (= v_~pos~0_296 (+ v_~pos~0_295 1)) (= |v_thread1Thread1of1ForFork0_#t~post2_174| |v_thread1Thread1of1ForFork0_#t~post2_173|) (not .cse12)) (and (= |v_thread1Thread1of1ForFork0_#t~post1_174| |v_thread1Thread1of1ForFork0_#t~post1_173|) (= .cse1 v_~pos~0_295) .cse12)) (let ((.cse13 (= (ite (= (ite .cse12 1 0) 0) 0 1) v_~d1~0_218)) (.cse14 (= v_~g1~0_195 v_~g1~0_194))) (or (and .cse13 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_186| 256) 0) .cse14) (and .cse13 .cse0 .cse14))) (let ((.cse15 (= v_~g1~0_193 v_~g1~0_192)) (.cse16 (= (ite (= (ite .cse5 1 0) 0) 0 1) v_~d1~0_216))) (or (and .cse15 .cse10 .cse16) (and .cse15 .cse16 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_184| 256) 0)))) (let ((.cse17 (not (= 0 (mod v_~g1~0_193 256))))) (or (and .cse10 .cse17 (= |v_thread1Thread1of1ForFork0_#t~post1_172| |v_thread1Thread1of1ForFork0_#t~post1_170|) (= v_~pos~0_294 (+ v_~pos~0_292 1))) (and (= |v_thread1Thread1of1ForFork0_#t~post2_172| |v_thread1Thread1of1ForFork0_#t~post2_170|) .cse17 (= v_~pos~0_292 .cse11) (not .cse10)))))) InVars {~g1~0=v_~g1~0_194, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_186|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_173|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_173|, ~pos~0=v_~pos~0_295, ~d1~0=v_~d1~0_217} OutVars{~g1~0=v_~g1~0_191, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_170|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_170|, ~pos~0=v_~pos~0_292, ~d1~0=v_~d1~0_214} AuxVars[v_~g1~0_193, v_~g1~0_192, v_~g1~0_195, v_~pos~0_293, v_~pos~0_294, |v_thread1Thread1of1ForFork0_#t~post1_174|, |v_thread1Thread1of1ForFork0_#t~post1_171|, |v_thread1Thread1of1ForFork0_#t~post1_172|, v_~d1~0_216, |v_thread1Thread1of1ForFork0_#t~nondet3_185|, v_~d1~0_218, v_~d1~0_215, v_~pos~0_296, |v_thread1Thread1of1ForFork0_#t~post2_174|, |v_thread1Thread1of1ForFork0_#t~nondet3_182|, |v_thread1Thread1of1ForFork0_#t~post2_172|, |v_thread1Thread1of1ForFork0_#t~post2_171|, |v_thread1Thread1of1ForFork0_#t~nondet3_184|] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [350] L75-1-->L75-1: Formula: (let ((.cse4 (= (mod v_~d2~0_71 256) 0)) (.cse8 (= (mod v_~d2~0_72 256) 0)) (.cse5 (+ v_~pos~0_104 2))) (and (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_44| 256) 0)) (.cse0 (= (mod v_~d2~0_70 256) 0)) (.cse3 (= v_~g2~0_62 v_~g2~0_61)) (.cse1 (= v_~d2~0_70 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) .cse1 (not .cse2) (= v_~g2~0_61 0)) (and .cse3 .cse1 .cse2) (and .cse0 .cse3 .cse1))) (or (and .cse4 (= v_~pos~0_104 (+ v_~pos~0_103 2))) (and (not .cse4) (= v_~pos~0_103 .cse5))) (let ((.cse6 (= v_~g2~0_63 v_~g2~0_62)) (.cse7 (= v_~d2~0_71 (ite (= (ite .cse8 1 0) 0) 0 1)))) (or (and .cse6 .cse7 .cse4) (and .cse6 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_45| 256) 0) .cse7))) (let ((.cse9 (not (= (mod v_~g2~0_63 256) 0)))) (or (and (= v_~pos~0_104 (+ v_~pos~0_105 2)) .cse9 (not .cse8)) (and .cse8 (= v_~pos~0_105 .cse5) .cse9))))) InVars {~g2~0=v_~g2~0_63, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_45|, ~pos~0=v_~pos~0_105, ~d2~0=v_~d2~0_72} OutVars{~g2~0=v_~g2~0_61, ~pos~0=v_~pos~0_103, ~d2~0=v_~d2~0_70} AuxVars[v_~pos~0_104, v_~d2~0_71, |v_thread2Thread1of1ForFork1_#t~nondet4_44|, v_~g2~0_62] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 12:58:26,566 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 12:58:26,567 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5500 [2022-12-13 12:58:26,567 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 55 transitions, 650 flow [2022-12-13 12:58:26,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:58:26,567 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:58:26,567 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:58:26,572 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-13 12:58:26,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:58:26,772 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:58:26,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:58:26,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1729788461, now seen corresponding path program 1 times [2022-12-13 12:58:26,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:58:26,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143183356] [2022-12-13 12:58:26,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:58:26,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:58:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:58:27,134 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-13 12:58:27,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:58:27,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143183356] [2022-12-13 12:58:27,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143183356] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:58:27,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677293650] [2022-12-13 12:58:27,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:58:27,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:58:27,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:58:27,136 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-13 12:58:27,138 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-13 12:58:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:58:27,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 12:58:27,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:58:27,393 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-13 12:58:27,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:58:27,769 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-13 12:58:27,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677293650] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:58:27,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:58:27,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 12:58:27,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849670240] [2022-12-13 12:58:27,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:58:27,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 12:58:27,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:58:27,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 12:58:27,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-12-13 12:58:27,770 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 12:58:27,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 55 transitions, 650 flow. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:58:27,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:58:27,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 12:58:27,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:58:28,052 INFO L130 PetriNetUnfolder]: 159/288 cut-off events. [2022-12-13 12:58:28,052 INFO L131 PetriNetUnfolder]: For 938/938 co-relation queries the response was YES. [2022-12-13 12:58:28,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1815 conditions, 288 events. 159/288 cut-off events. For 938/938 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1056 event pairs, 0 based on Foata normal form. 2/280 useless extension candidates. Maximal degree in co-relation 1587. Up to 159 conditions per place. [2022-12-13 12:58:28,055 INFO L137 encePairwiseOnDemand]: 10/31 looper letters, 44 selfloop transitions, 36 changer transitions 0/80 dead transitions. [2022-12-13 12:58:28,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 80 transitions, 995 flow [2022-12-13 12:58:28,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:58:28,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 12:58:28,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-12-13 12:58:28,056 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2488479262672811 [2022-12-13 12:58:28,056 INFO L175 Difference]: Start difference. First operand has 46 places, 55 transitions, 650 flow. Second operand 7 states and 54 transitions. [2022-12-13 12:58:28,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 80 transitions, 995 flow [2022-12-13 12:58:28,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 80 transitions, 794 flow, removed 92 selfloop flow, removed 3 redundant places. [2022-12-13 12:58:28,061 INFO L231 Difference]: Finished difference. Result has 52 places, 60 transitions, 660 flow [2022-12-13 12:58:28,061 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=660, PETRI_PLACES=52, PETRI_TRANSITIONS=60} [2022-12-13 12:58:28,062 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 34 predicate places. [2022-12-13 12:58:28,062 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:58:28,062 INFO L89 Accepts]: Start accepts. Operand has 52 places, 60 transitions, 660 flow [2022-12-13 12:58:28,063 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:58:28,063 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:58:28,063 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 60 transitions, 660 flow [2022-12-13 12:58:28,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 60 transitions, 660 flow [2022-12-13 12:58:28,081 INFO L130 PetriNetUnfolder]: 48/128 cut-off events. [2022-12-13 12:58:28,081 INFO L131 PetriNetUnfolder]: For 460/473 co-relation queries the response was YES. [2022-12-13 12:58:28,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 128 events. 48/128 cut-off events. For 460/473 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 490 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 554. Up to 66 conditions per place. [2022-12-13 12:58:28,083 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 60 transitions, 660 flow [2022-12-13 12:58:28,083 INFO L226 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-13 12:58:28,083 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:58:28,084 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 12:58:28,084 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 60 transitions, 660 flow [2022-12-13 12:58:28,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:58:28,084 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:58:28,084 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:58:28,093 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-13 12:58:28,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:58:28,290 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:58:28,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:58:28,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1245859305, now seen corresponding path program 1 times [2022-12-13 12:58:28,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:58:28,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840152880] [2022-12-13 12:58:28,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:58:28,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:58:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:58:28,853 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-13 12:58:28,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:58:28,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840152880] [2022-12-13 12:58:28,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840152880] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:58:28,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187548525] [2022-12-13 12:58:28,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:58:28,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:58:28,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:58:28,855 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-13 12:58:28,880 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-13 12:58:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:58:28,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 12:58:28,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:58:29,208 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-13 12:58:29,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:58:29,808 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-13 12:58:29,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187548525] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:58:29,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:58:29,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2022-12-13 12:58:29,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827566637] [2022-12-13 12:58:29,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:58:29,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 12:58:29,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:58:29,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 12:58:29,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-12-13 12:58:29,809 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 12:58:29,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 60 transitions, 660 flow. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:58:29,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:58:29,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 12:58:29,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:58:30,201 INFO L130 PetriNetUnfolder]: 219/386 cut-off events. [2022-12-13 12:58:30,201 INFO L131 PetriNetUnfolder]: For 1523/1523 co-relation queries the response was YES. [2022-12-13 12:58:30,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2231 conditions, 386 events. 219/386 cut-off events. For 1523/1523 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1503 event pairs, 0 based on Foata normal form. 14/394 useless extension candidates. Maximal degree in co-relation 1943. Up to 209 conditions per place. [2022-12-13 12:58:30,205 INFO L137 encePairwiseOnDemand]: 9/31 looper letters, 36 selfloop transitions, 61 changer transitions 31/128 dead transitions. [2022-12-13 12:58:30,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 128 transitions, 1521 flow [2022-12-13 12:58:30,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 12:58:30,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 12:58:30,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2022-12-13 12:58:30,206 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2404692082111437 [2022-12-13 12:58:30,206 INFO L175 Difference]: Start difference. First operand has 52 places, 60 transitions, 660 flow. Second operand 11 states and 82 transitions. [2022-12-13 12:58:30,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 128 transitions, 1521 flow [2022-12-13 12:58:30,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 128 transitions, 1462 flow, removed 15 selfloop flow, removed 3 redundant places. [2022-12-13 12:58:30,214 INFO L231 Difference]: Finished difference. Result has 63 places, 80 transitions, 1093 flow [2022-12-13 12:58:30,214 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1093, PETRI_PLACES=63, PETRI_TRANSITIONS=80} [2022-12-13 12:58:30,214 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 45 predicate places. [2022-12-13 12:58:30,214 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:58:30,214 INFO L89 Accepts]: Start accepts. Operand has 63 places, 80 transitions, 1093 flow [2022-12-13 12:58:30,215 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:58:30,216 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:58:30,216 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 80 transitions, 1093 flow [2022-12-13 12:58:30,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 80 transitions, 1093 flow [2022-12-13 12:58:30,240 INFO L130 PetriNetUnfolder]: 55/119 cut-off events. [2022-12-13 12:58:30,241 INFO L131 PetriNetUnfolder]: For 496/506 co-relation queries the response was YES. [2022-12-13 12:58:30,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 119 events. 55/119 cut-off events. For 496/506 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 357 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 769. Up to 81 conditions per place. [2022-12-13 12:58:30,242 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 80 transitions, 1093 flow [2022-12-13 12:58:30,242 INFO L226 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-13 12:58:32,691 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [393] L53-1-->L75-1: Formula: (let ((.cse6 (= (mod v_~d1~0_267 256) 0)) (.cse1 (+ v_~pos~0_367 2)) (.cse14 (+ v_~pos~0_369 1)) (.cse13 (= (mod v_~d1~0_266 256) 0)) (.cse0 (= (mod v_~d2~0_177 256) 0)) (.cse15 (= (mod v_~d2~0_176 256) 0))) (and (or (and .cse0 (= v_~pos~0_367 (+ v_~pos~0_365 2))) (and (= .cse1 v_~pos~0_365) (not .cse0))) (let ((.cse4 (= (mod v_~d1~0_265 256) 0)) (.cse2 (= v_~g1~0_244 v_~g1~0_242)) (.cse5 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_232| 256) 0)) (.cse3 (= (ite (= (ite .cse6 1 0) 0) 0 1) v_~d1~0_265))) (or (and .cse2 .cse3 .cse4) (and (= v_~g1~0_242 0) (not .cse5) .cse3 (not .cse4)) (and .cse2 .cse5 .cse3))) (let ((.cse8 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_151| 256) 0)) (.cse10 (= v_~g2~0_186 v_~g2~0_184)) (.cse7 (= 0 (mod v_~d2~0_175 256))) (.cse9 (= (ite (= (ite .cse0 1 0) 0) 0 1) v_~d2~0_175))) (or (and (= v_~g2~0_184 0) (not .cse7) (not .cse8) .cse9) (and .cse10 .cse9 .cse8) (and .cse10 .cse7 .cse9))) (let ((.cse11 (= (ite (= 0 (ite .cse13 1 0)) 0 1) v_~d1~0_267)) (.cse12 (= v_~g1~0_244 v_~g1~0_243))) (or (and .cse11 .cse12 .cse6) (and .cse11 .cse12 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_234| 256) 0)))) (or (and (= v_~pos~0_366 .cse14) (= |v_thread1Thread1of1ForFork0_#t~post2_220| |v_thread1Thread1of1ForFork0_#t~post2_222|) (not .cse6) (not (= (mod v_~g1~0_244 256) 0))) (and (= |v_thread1Thread1of1ForFork0_#t~post1_220| |v_thread1Thread1of1ForFork0_#t~post1_222|) (= v_~pos~0_369 (+ v_~pos~0_366 1)) .cse6)) (let ((.cse16 (not (= (mod v_~g2~0_185 256) 0)))) (or (and (= v_~pos~0_367 (+ v_~pos~0_366 2)) (not .cse15) .cse16) (and .cse15 (= .cse1 v_~pos~0_366) .cse16))) (or (and (not (= (mod v_~g1~0_243 256) 0)) (not .cse13) (= v_~pos~0_369 (+ v_~pos~0_368 1)) (= |v_thread1Thread1of1ForFork0_#t~post2_222| |v_thread1Thread1of1ForFork0_#t~post2_221|)) (and (= v_~pos~0_368 .cse14) .cse13 (= |v_thread1Thread1of1ForFork0_#t~post1_221| |v_thread1Thread1of1ForFork0_#t~post1_222|))) (let ((.cse17 (= v_~d2~0_177 (ite (= (ite .cse15 1 0) 0) 0 1))) (.cse18 (= v_~g2~0_186 v_~g2~0_185))) (or (and .cse0 .cse17 .cse18) (and (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_153| 256) 0) .cse17 .cse18))))) InVars {~g2~0=v_~g2~0_185, ~g1~0=v_~g1~0_243, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_234|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_221|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_221|, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_153|, ~pos~0=v_~pos~0_368, ~d2~0=v_~d2~0_176, ~d1~0=v_~d1~0_266} OutVars{~g2~0=v_~g2~0_184, ~g1~0=v_~g1~0_242, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_220|, ~pos~0=v_~pos~0_365, ~d2~0=v_~d2~0_175, ~d1~0=v_~d1~0_265} AuxVars[v_~pos~0_367, v_~g2~0_186, |v_thread1Thread1of1ForFork0_#t~nondet3_232|, v_~d2~0_177, v_~pos~0_366, v_~d1~0_267, |v_thread1Thread1of1ForFork0_#t~post1_222|, |v_thread1Thread1of1ForFork0_#t~post2_222|, v_~g1~0_244, |v_thread2Thread1of1ForFork1_#t~nondet4_151|, v_~pos~0_369] AssignedVars[~g2~0, ~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0, ~d1~0] and [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 12:58:34,969 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:58:34,969 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4755 [2022-12-13 12:58:34,969 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 80 transitions, 1105 flow [2022-12-13 12:58:34,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:58:34,970 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:58:34,970 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:58:34,975 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-13 12:58:35,170 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,SelfDestructingSolverStorable9 [2022-12-13 12:58:35,170 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:58:35,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:58:35,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1839469420, now seen corresponding path program 1 times [2022-12-13 12:58:35,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:58:35,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025735858] [2022-12-13 12:58:35,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:58:35,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:58:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:58:35,483 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-13 12:58:35,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:58:35,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025735858] [2022-12-13 12:58:35,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025735858] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:58:35,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892347062] [2022-12-13 12:58:35,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:58:35,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:58:35,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:58:35,488 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:58:35,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 12:58:35,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:58:35,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 12:58:35,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:58:35,731 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-13 12:58:35,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:58:35,909 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-13 12:58:35,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892347062] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:58:35,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:58:35,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 8 [2022-12-13 12:58:35,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117889914] [2022-12-13 12:58:35,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:58:35,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 12:58:35,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:58:35,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 12:58:35,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-13 12:58:35,911 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 12:58:35,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 80 transitions, 1105 flow. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:58:35,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:58:35,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 12:58:35,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:58:36,097 INFO L130 PetriNetUnfolder]: 153/270 cut-off events. [2022-12-13 12:58:36,097 INFO L131 PetriNetUnfolder]: For 1382/1382 co-relation queries the response was YES. [2022-12-13 12:58:36,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1840 conditions, 270 events. 153/270 cut-off events. For 1382/1382 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 910 event pairs, 0 based on Foata normal form. 20/284 useless extension candidates. Maximal degree in co-relation 1807. Up to 163 conditions per place. [2022-12-13 12:58:36,100 INFO L137 encePairwiseOnDemand]: 10/30 looper letters, 51 selfloop transitions, 30 changer transitions 8/89 dead transitions. [2022-12-13 12:58:36,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 89 transitions, 1222 flow [2022-12-13 12:58:36,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:58:36,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 12:58:36,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-12-13 12:58:36,102 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24285714285714285 [2022-12-13 12:58:36,102 INFO L175 Difference]: Start difference. First operand has 62 places, 80 transitions, 1105 flow. Second operand 7 states and 51 transitions. [2022-12-13 12:58:36,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 89 transitions, 1222 flow [2022-12-13 12:58:36,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 89 transitions, 1017 flow, removed 74 selfloop flow, removed 6 redundant places. [2022-12-13 12:58:36,115 INFO L231 Difference]: Finished difference. Result has 63 places, 69 transitions, 802 flow [2022-12-13 12:58:36,115 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=802, PETRI_PLACES=63, PETRI_TRANSITIONS=69} [2022-12-13 12:58:36,116 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 45 predicate places. [2022-12-13 12:58:36,116 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:58:36,116 INFO L89 Accepts]: Start accepts. Operand has 63 places, 69 transitions, 802 flow [2022-12-13 12:58:36,118 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:58:36,118 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:58:36,118 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 69 transitions, 802 flow [2022-12-13 12:58:36,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 69 transitions, 802 flow [2022-12-13 12:58:36,143 INFO L130 PetriNetUnfolder]: 47/112 cut-off events. [2022-12-13 12:58:36,144 INFO L131 PetriNetUnfolder]: For 440/450 co-relation queries the response was YES. [2022-12-13 12:58:36,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 112 events. 47/112 cut-off events. For 440/450 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 336 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 584. Up to 73 conditions per place. [2022-12-13 12:58:36,145 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 69 transitions, 802 flow [2022-12-13 12:58:36,145 INFO L226 LiptonReduction]: Number of co-enabled transitions 146 [2022-12-13 12:58:36,146 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:58:36,146 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-13 12:58:36,146 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 69 transitions, 802 flow [2022-12-13 12:58:36,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:58:36,146 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:58:36,146 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:58:36,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 12:58:36,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:58:36,353 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:58:36,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:58:36,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1233453495, now seen corresponding path program 2 times [2022-12-13 12:58:36,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:58:36,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756177941] [2022-12-13 12:58:36,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:58:36,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:58:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:58:38,057 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-13 12:58:38,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:58:38,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756177941] [2022-12-13 12:58:38,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756177941] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:58:38,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759555750] [2022-12-13 12:58:38,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 12:58:38,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:58:38,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:58:38,060 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:58:38,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 12:58:38,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 12:58:38,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:58:38,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 12:58:38,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:58:38,550 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-13 12:58:38,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:58:39,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:58:39,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759555750] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:58:39,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:58:39,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2022-12-13 12:58:39,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939159590] [2022-12-13 12:58:39,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:58:39,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 12:58:39,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:58:39,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 12:58:39,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-12-13 12:58:39,334 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 12:58:39,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 69 transitions, 802 flow. Second operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:58:39,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:58:39,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 12:58:39,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:58:40,799 INFO L130 PetriNetUnfolder]: 372/685 cut-off events. [2022-12-13 12:58:40,799 INFO L131 PetriNetUnfolder]: For 2324/2324 co-relation queries the response was YES. [2022-12-13 12:58:40,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4044 conditions, 685 events. 372/685 cut-off events. For 2324/2324 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3200 event pairs, 0 based on Foata normal form. 34/713 useless extension candidates. Maximal degree in co-relation 3739. Up to 383 conditions per place. [2022-12-13 12:58:40,805 INFO L137 encePairwiseOnDemand]: 8/27 looper letters, 53 selfloop transitions, 122 changer transitions 68/243 dead transitions. [2022-12-13 12:58:40,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 243 transitions, 2951 flow [2022-12-13 12:58:40,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-13 12:58:40,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-13 12:58:40,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 176 transitions. [2022-12-13 12:58:40,807 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21728395061728395 [2022-12-13 12:58:40,807 INFO L175 Difference]: Start difference. First operand has 62 places, 69 transitions, 802 flow. Second operand 30 states and 176 transitions. [2022-12-13 12:58:40,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 243 transitions, 2951 flow [2022-12-13 12:58:40,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 243 transitions, 2827 flow, removed 40 selfloop flow, removed 4 redundant places. [2022-12-13 12:58:40,825 INFO L231 Difference]: Finished difference. Result has 93 places, 140 transitions, 1965 flow [2022-12-13 12:58:40,825 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1965, PETRI_PLACES=93, PETRI_TRANSITIONS=140} [2022-12-13 12:58:40,826 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 75 predicate places. [2022-12-13 12:58:40,826 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:58:40,826 INFO L89 Accepts]: Start accepts. Operand has 93 places, 140 transitions, 1965 flow [2022-12-13 12:58:40,827 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:58:40,827 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:58:40,827 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 140 transitions, 1965 flow [2022-12-13 12:58:40,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 140 transitions, 1965 flow [2022-12-13 12:58:40,858 INFO L130 PetriNetUnfolder]: 94/191 cut-off events. [2022-12-13 12:58:40,858 INFO L131 PetriNetUnfolder]: For 696/706 co-relation queries the response was YES. [2022-12-13 12:58:40,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1332 conditions, 191 events. 94/191 cut-off events. For 696/706 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 673 event pairs, 0 based on Foata normal form. 0/187 useless extension candidates. Maximal degree in co-relation 1292. Up to 155 conditions per place. [2022-12-13 12:58:40,860 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 140 transitions, 1965 flow [2022-12-13 12:58:40,860 INFO L226 LiptonReduction]: Number of co-enabled transitions 286 [2022-12-13 12:58:40,861 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [345] L75-1-->L75-1: Formula: (let ((.cse0 (= (mod v_~d2~0_58 256) 0))) (and (let ((.cse1 (not (= (mod v_~g2~0_47 256) 0)))) (or (and .cse0 (= (+ 2 v_~pos~0_77) v_~pos~0_78) .cse1) (and (= (+ 2 v_~pos~0_78) v_~pos~0_77) .cse1 (not .cse0)))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0)) (.cse3 (= v_~d2~0_57 (ite (= 0 (ite .cse0 1 0)) 0 1))) (.cse4 (= v_~g2~0_46 v_~g2~0_47)) (.cse5 (= (mod v_~d2~0_57 256) 0))) (or (and .cse2 .cse3 .cse4) (and (= v_~g2~0_46 0) .cse3 (not .cse2) (not .cse5)) (and .cse3 .cse4 .cse5))))) InVars {~g2~0=v_~g2~0_47, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_78, ~d2~0=v_~d2~0_58} OutVars{~g2~0=v_~g2~0_46, ~pos~0=v_~pos~0_77, ~d2~0=v_~d2~0_57} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 12:58:41,466 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [345] L75-1-->L75-1: Formula: (let ((.cse0 (= (mod v_~d2~0_58 256) 0))) (and (let ((.cse1 (not (= (mod v_~g2~0_47 256) 0)))) (or (and .cse0 (= (+ 2 v_~pos~0_77) v_~pos~0_78) .cse1) (and (= (+ 2 v_~pos~0_78) v_~pos~0_77) .cse1 (not .cse0)))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0)) (.cse3 (= v_~d2~0_57 (ite (= 0 (ite .cse0 1 0)) 0 1))) (.cse4 (= v_~g2~0_46 v_~g2~0_47)) (.cse5 (= (mod v_~d2~0_57 256) 0))) (or (and .cse2 .cse3 .cse4) (and (= v_~g2~0_46 0) .cse3 (not .cse2) (not .cse5)) (and .cse3 .cse4 .cse5))))) InVars {~g2~0=v_~g2~0_47, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_78, ~d2~0=v_~d2~0_58} OutVars{~g2~0=v_~g2~0_46, ~pos~0=v_~pos~0_77, ~d2~0=v_~d2~0_57} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 12:58:41,914 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [363] L75-1-->L53-1: Formula: (let ((.cse1 (= (mod v_~d1~0_127 256) 0))) (and (= |v_thread2Thread1of1ForFork1_#res.offset_21| 0) (= 0 (mod v_~g2~0_94 256)) (let ((.cse0 (not (= (mod v_~g1~0_104 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_83| |v_thread1Thread1of1ForFork0_#t~post2_82|) .cse0 (= v_~pos~0_168 (+ v_~pos~0_169 1)) (not .cse1)) (and (= |v_thread1Thread1of1ForFork0_#t~post1_83| |v_thread1Thread1of1ForFork0_#t~post1_82|) (= v_~pos~0_169 (+ v_~pos~0_168 1)) .cse1 .cse0))) (= |v_thread2Thread1of1ForFork1_#res.base_21| 0) (let ((.cse3 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_95| 256) 0)) (.cse2 (= (mod v_~d1~0_126 256) 0)) (.cse5 (= v_~g1~0_104 v_~g1~0_103)) (.cse4 (= v_~d1~0_126 (ite (= (ite .cse1 1 0) 0) 0 1)))) (or (and (not .cse2) (= v_~g1~0_103 0) (not .cse3) .cse4) (and .cse5 .cse3 .cse4) (and .cse2 .cse5 .cse4))))) InVars {~g2~0=v_~g2~0_94, ~g1~0=v_~g1~0_104, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_95|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_83|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_83|, ~pos~0=v_~pos~0_169, ~d1~0=v_~d1~0_127} OutVars{~g2~0=v_~g2~0_94, ~g1~0=v_~g1~0_103, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_21|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_82|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_82|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_21|, ~pos~0=v_~pos~0_168, ~d1~0=v_~d1~0_126} AuxVars[] AssignedVars[~g1~0, thread2Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread2Thread1of1ForFork1_#res.base, ~pos~0, ~d1~0] [2022-12-13 12:58:42,555 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [345] L75-1-->L75-1: Formula: (let ((.cse0 (= (mod v_~d2~0_58 256) 0))) (and (let ((.cse1 (not (= (mod v_~g2~0_47 256) 0)))) (or (and .cse0 (= (+ 2 v_~pos~0_77) v_~pos~0_78) .cse1) (and (= (+ 2 v_~pos~0_78) v_~pos~0_77) .cse1 (not .cse0)))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0)) (.cse3 (= v_~d2~0_57 (ite (= 0 (ite .cse0 1 0)) 0 1))) (.cse4 (= v_~g2~0_46 v_~g2~0_47)) (.cse5 (= (mod v_~d2~0_57 256) 0))) (or (and .cse2 .cse3 .cse4) (and (= v_~g2~0_46 0) .cse3 (not .cse2) (not .cse5)) (and .cse3 .cse4 .cse5))))) InVars {~g2~0=v_~g2~0_47, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_78, ~d2~0=v_~d2~0_58} OutVars{~g2~0=v_~g2~0_46, ~pos~0=v_~pos~0_77, ~d2~0=v_~d2~0_57} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 12:58:42,990 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [345] L75-1-->L75-1: Formula: (let ((.cse0 (= (mod v_~d2~0_58 256) 0))) (and (let ((.cse1 (not (= (mod v_~g2~0_47 256) 0)))) (or (and .cse0 (= (+ 2 v_~pos~0_77) v_~pos~0_78) .cse1) (and (= (+ 2 v_~pos~0_78) v_~pos~0_77) .cse1 (not .cse0)))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0)) (.cse3 (= v_~d2~0_57 (ite (= 0 (ite .cse0 1 0)) 0 1))) (.cse4 (= v_~g2~0_46 v_~g2~0_47)) (.cse5 (= (mod v_~d2~0_57 256) 0))) (or (and .cse2 .cse3 .cse4) (and (= v_~g2~0_46 0) .cse3 (not .cse2) (not .cse5)) (and .cse3 .cse4 .cse5))))) InVars {~g2~0=v_~g2~0_47, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_78, ~d2~0=v_~d2~0_58} OutVars{~g2~0=v_~g2~0_46, ~pos~0=v_~pos~0_77, ~d2~0=v_~d2~0_57} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 12:58:44,021 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:58:44,022 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3196 [2022-12-13 12:58:44,022 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 139 transitions, 1990 flow [2022-12-13 12:58:44,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:58:44,022 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:58:44,022 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:58:44,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 12:58:44,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:58:44,228 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:58:44,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:58:44,229 INFO L85 PathProgramCache]: Analyzing trace with hash -942035180, now seen corresponding path program 1 times [2022-12-13 12:58:44,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:58:44,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356595245] [2022-12-13 12:58:44,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:58:44,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:58:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:58:45,055 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-13 12:58:45,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:58:45,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356595245] [2022-12-13 12:58:45,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356595245] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:58:45,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499344722] [2022-12-13 12:58:45,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:58:45,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:58:45,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:58:45,057 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:58:45,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 12:58:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:58:45,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 12:58:45,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:58:45,615 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-13 12:58:45,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:58:46,872 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-13 12:58:46,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499344722] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:58:46,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:58:46,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2022-12-13 12:58:46,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029478968] [2022-12-13 12:58:46,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:58:46,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 12:58:46,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:58:46,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 12:58:46,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-12-13 12:58:46,874 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 12:58:46,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 139 transitions, 1990 flow. Second operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:58:46,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:58:46,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 12:58:46,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:58:47,834 INFO L130 PetriNetUnfolder]: 376/631 cut-off events. [2022-12-13 12:58:47,835 INFO L131 PetriNetUnfolder]: For 2045/2045 co-relation queries the response was YES. [2022-12-13 12:58:47,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4417 conditions, 631 events. 376/631 cut-off events. For 2045/2045 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2616 event pairs, 0 based on Foata normal form. 8/629 useless extension candidates. Maximal degree in co-relation 4373. Up to 423 conditions per place. [2022-12-13 12:58:47,841 INFO L137 encePairwiseOnDemand]: 11/33 looper letters, 82 selfloop transitions, 107 changer transitions 32/221 dead transitions. [2022-12-13 12:58:47,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 221 transitions, 3384 flow [2022-12-13 12:58:47,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 12:58:47,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 12:58:47,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 94 transitions. [2022-12-13 12:58:47,843 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17803030303030304 [2022-12-13 12:58:47,843 INFO L175 Difference]: Start difference. First operand has 85 places, 139 transitions, 1990 flow. Second operand 16 states and 94 transitions. [2022-12-13 12:58:47,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 221 transitions, 3384 flow [2022-12-13 12:58:47,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 221 transitions, 2424 flow, removed 449 selfloop flow, removed 7 redundant places. [2022-12-13 12:58:47,871 INFO L231 Difference]: Finished difference. Result has 101 places, 172 transitions, 2020 flow [2022-12-13 12:58:47,872 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1374, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2020, PETRI_PLACES=101, PETRI_TRANSITIONS=172} [2022-12-13 12:58:47,873 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 83 predicate places. [2022-12-13 12:58:47,873 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:58:47,873 INFO L89 Accepts]: Start accepts. Operand has 101 places, 172 transitions, 2020 flow [2022-12-13 12:58:47,875 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:58:47,875 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:58:47,875 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 172 transitions, 2020 flow [2022-12-13 12:58:47,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 172 transitions, 2020 flow [2022-12-13 12:58:47,911 INFO L130 PetriNetUnfolder]: 117/229 cut-off events. [2022-12-13 12:58:47,911 INFO L131 PetriNetUnfolder]: For 779/789 co-relation queries the response was YES. [2022-12-13 12:58:47,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1331 conditions, 229 events. 117/229 cut-off events. For 779/789 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 842 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 1293. Up to 108 conditions per place. [2022-12-13 12:58:47,913 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 172 transitions, 2020 flow [2022-12-13 12:58:47,914 INFO L226 LiptonReduction]: Number of co-enabled transitions 350 [2022-12-13 12:58:47,914 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:58:47,916 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-13 12:58:47,916 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 172 transitions, 2020 flow [2022-12-13 12:58:47,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:58:47,917 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:58:47,917 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:58:47,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 12:58:48,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 12:58:48,122 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:58:48,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:58:48,123 INFO L85 PathProgramCache]: Analyzing trace with hash -936088720, now seen corresponding path program 2 times [2022-12-13 12:58:48,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:58:48,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271048650] [2022-12-13 12:58:48,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:58:48,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:58:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:58:48,963 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-13 12:58:48,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:58:48,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271048650] [2022-12-13 12:58:48,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271048650] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:58:48,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450366088] [2022-12-13 12:58:48,963 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 12:58:48,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:58:48,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:58:48,968 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:58:48,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 12:58:49,087 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 12:58:49,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:58:49,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 12:58:49,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:58:49,563 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-13 12:58:49,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:58:50,568 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-13 12:58:50,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450366088] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:58:50,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:58:50,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-12-13 12:58:50,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378720243] [2022-12-13 12:58:50,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:58:50,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 12:58:50,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:58:50,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 12:58:50,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-12-13 12:58:50,570 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 12:58:50,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 172 transitions, 2020 flow. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:58:50,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:58:50,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 12:58:50,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:58:52,431 INFO L130 PetriNetUnfolder]: 720/1139 cut-off events. [2022-12-13 12:58:52,431 INFO L131 PetriNetUnfolder]: For 4186/4186 co-relation queries the response was YES. [2022-12-13 12:58:52,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6233 conditions, 1139 events. 720/1139 cut-off events. For 4186/4186 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5008 event pairs, 0 based on Foata normal form. 8/1091 useless extension candidates. Maximal degree in co-relation 6191. Up to 365 conditions per place. [2022-12-13 12:58:52,444 INFO L137 encePairwiseOnDemand]: 9/33 looper letters, 80 selfloop transitions, 334 changer transitions 30/444 dead transitions. [2022-12-13 12:58:52,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 444 transitions, 5282 flow [2022-12-13 12:58:52,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 12:58:52,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-13 12:58:52,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 162 transitions. [2022-12-13 12:58:52,446 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15835777126099707 [2022-12-13 12:58:52,446 INFO L175 Difference]: Start difference. First operand has 98 places, 172 transitions, 2020 flow. Second operand 31 states and 162 transitions. [2022-12-13 12:58:52,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 444 transitions, 5282 flow [2022-12-13 12:58:52,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 444 transitions, 5108 flow, removed 75 selfloop flow, removed 5 redundant places. [2022-12-13 12:58:52,486 INFO L231 Difference]: Finished difference. Result has 128 places, 374 transitions, 4664 flow [2022-12-13 12:58:52,487 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1902, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=4664, PETRI_PLACES=128, PETRI_TRANSITIONS=374} [2022-12-13 12:58:52,487 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 110 predicate places. [2022-12-13 12:58:52,487 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:58:52,487 INFO L89 Accepts]: Start accepts. Operand has 128 places, 374 transitions, 4664 flow [2022-12-13 12:58:52,490 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:58:52,490 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:58:52,490 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 374 transitions, 4664 flow [2022-12-13 12:58:52,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 374 transitions, 4664 flow [2022-12-13 12:58:52,582 INFO L130 PetriNetUnfolder]: 247/445 cut-off events. [2022-12-13 12:58:52,582 INFO L131 PetriNetUnfolder]: For 2047/2057 co-relation queries the response was YES. [2022-12-13 12:58:52,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2683 conditions, 445 events. 247/445 cut-off events. For 2047/2057 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1833 event pairs, 0 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 2646. Up to 176 conditions per place. [2022-12-13 12:58:52,587 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 374 transitions, 4664 flow [2022-12-13 12:58:52,587 INFO L226 LiptonReduction]: Number of co-enabled transitions 754 [2022-12-13 12:58:52,638 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [345] L75-1-->L75-1: Formula: (let ((.cse0 (= (mod v_~d2~0_58 256) 0))) (and (let ((.cse1 (not (= (mod v_~g2~0_47 256) 0)))) (or (and .cse0 (= (+ 2 v_~pos~0_77) v_~pos~0_78) .cse1) (and (= (+ 2 v_~pos~0_78) v_~pos~0_77) .cse1 (not .cse0)))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0)) (.cse3 (= v_~d2~0_57 (ite (= 0 (ite .cse0 1 0)) 0 1))) (.cse4 (= v_~g2~0_46 v_~g2~0_47)) (.cse5 (= (mod v_~d2~0_57 256) 0))) (or (and .cse2 .cse3 .cse4) (and (= v_~g2~0_46 0) .cse3 (not .cse2) (not .cse5)) (and .cse3 .cse4 .cse5))))) InVars {~g2~0=v_~g2~0_47, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_78, ~d2~0=v_~d2~0_58} OutVars{~g2~0=v_~g2~0_46, ~pos~0=v_~pos~0_77, ~d2~0=v_~d2~0_57} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] and [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 12:59:01,892 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 12:59:01,892 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9405 [2022-12-13 12:59:01,892 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 369 transitions, 4632 flow [2022-12-13 12:59:01,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:59:01,892 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:59:01,893 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:59:01,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 12:59:02,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 12:59:02,093 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:59:02,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:59:02,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1376409915, now seen corresponding path program 3 times [2022-12-13 12:59:02,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:59:02,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672677314] [2022-12-13 12:59:02,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:59:02,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:59:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:59:02,570 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-13 12:59:02,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:59:02,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672677314] [2022-12-13 12:59:02,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672677314] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:59:02,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528726527] [2022-12-13 12:59:02,571 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 12:59:02,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:59:02,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:59:02,576 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:59:02,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 12:59:02,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 12:59:02,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:59:02,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 12:59:02,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:59:02,929 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-13 12:59:02,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:59:03,228 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-13 12:59:03,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528726527] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:59:03,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:59:03,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 11 [2022-12-13 12:59:03,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804989248] [2022-12-13 12:59:03,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:59:03,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 12:59:03,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:59:03,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 12:59:03,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-13 12:59:03,232 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 12:59:03,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 369 transitions, 4632 flow. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:59:03,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:59:03,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 12:59:03,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:59:03,688 INFO L130 PetriNetUnfolder]: 689/1098 cut-off events. [2022-12-13 12:59:03,688 INFO L131 PetriNetUnfolder]: For 5387/5387 co-relation queries the response was YES. [2022-12-13 12:59:03,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6439 conditions, 1098 events. 689/1098 cut-off events. For 5387/5387 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4749 event pairs, 0 based on Foata normal form. 106/1144 useless extension candidates. Maximal degree in co-relation 6399. Up to 482 conditions per place. [2022-12-13 12:59:03,701 INFO L137 encePairwiseOnDemand]: 12/41 looper letters, 192 selfloop transitions, 199 changer transitions 0/391 dead transitions. [2022-12-13 12:59:03,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 391 transitions, 5224 flow [2022-12-13 12:59:03,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:59:03,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 12:59:03,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-12-13 12:59:03,703 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1916376306620209 [2022-12-13 12:59:03,703 INFO L175 Difference]: Start difference. First operand has 120 places, 369 transitions, 4632 flow. Second operand 7 states and 55 transitions. [2022-12-13 12:59:03,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 391 transitions, 5224 flow [2022-12-13 12:59:03,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 391 transitions, 4137 flow, removed 444 selfloop flow, removed 11 redundant places. [2022-12-13 12:59:03,752 INFO L231 Difference]: Finished difference. Result has 114 places, 359 transitions, 3584 flow [2022-12-13 12:59:03,753 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3068, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3584, PETRI_PLACES=114, PETRI_TRANSITIONS=359} [2022-12-13 12:59:03,753 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 96 predicate places. [2022-12-13 12:59:03,753 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:59:03,753 INFO L89 Accepts]: Start accepts. Operand has 114 places, 359 transitions, 3584 flow [2022-12-13 12:59:03,756 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:59:03,756 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:59:03,756 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 359 transitions, 3584 flow [2022-12-13 12:59:03,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 359 transitions, 3584 flow [2022-12-13 12:59:03,806 INFO L130 PetriNetUnfolder]: 242/448 cut-off events. [2022-12-13 12:59:03,806 INFO L131 PetriNetUnfolder]: For 1328/1338 co-relation queries the response was YES. [2022-12-13 12:59:03,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2153 conditions, 448 events. 242/448 cut-off events. For 1328/1338 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1865 event pairs, 0 based on Foata normal form. 0/430 useless extension candidates. Maximal degree in co-relation 2111. Up to 116 conditions per place. [2022-12-13 12:59:03,810 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 359 transitions, 3584 flow [2022-12-13 12:59:03,810 INFO L226 LiptonReduction]: Number of co-enabled transitions 724 [2022-12-13 12:59:03,811 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:59:03,811 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-13 12:59:03,812 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 359 transitions, 3584 flow [2022-12-13 12:59:03,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:59:03,812 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:59:03,812 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:59:03,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 12:59:04,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 12:59:04,024 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:59:04,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:59:04,024 INFO L85 PathProgramCache]: Analyzing trace with hash -87507347, now seen corresponding path program 1 times [2022-12-13 12:59:04,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:59:04,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354270910] [2022-12-13 12:59:04,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:59:04,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:59:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:59:05,040 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:59:05,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:59:05,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354270910] [2022-12-13 12:59:05,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354270910] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:59:05,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927088006] [2022-12-13 12:59:05,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:59:05,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:59:05,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:59:05,042 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:59:05,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 12:59:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:59:05,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 12:59:05,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:59:05,780 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:59:05,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:59:07,188 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:59:07,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927088006] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:59:07,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:59:07,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2022-12-13 12:59:07,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141762247] [2022-12-13 12:59:07,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:59:07,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 12:59:07,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:59:07,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 12:59:07,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2022-12-13 12:59:07,190 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-13 12:59:07,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 359 transitions, 3584 flow. Second operand has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:59:07,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:59:07,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-13 12:59:07,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:59:08,456 INFO L130 PetriNetUnfolder]: 888/1397 cut-off events. [2022-12-13 12:59:08,456 INFO L131 PetriNetUnfolder]: For 3923/3923 co-relation queries the response was YES. [2022-12-13 12:59:08,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6907 conditions, 1397 events. 888/1397 cut-off events. For 3923/3923 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 6273 event pairs, 0 based on Foata normal form. 6/1357 useless extension candidates. Maximal degree in co-relation 6559. Up to 367 conditions per place. [2022-12-13 12:59:08,463 INFO L137 encePairwiseOnDemand]: 10/35 looper letters, 0 selfloop transitions, 0 changer transitions 522/522 dead transitions. [2022-12-13 12:59:08,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 522 transitions, 5762 flow [2022-12-13 12:59:08,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 12:59:08,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 12:59:08,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 93 transitions. [2022-12-13 12:59:08,465 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.16607142857142856 [2022-12-13 12:59:08,465 INFO L175 Difference]: Start difference. First operand has 114 places, 359 transitions, 3584 flow. Second operand 16 states and 93 transitions. [2022-12-13 12:59:08,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 522 transitions, 5762 flow [2022-12-13 12:59:08,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 522 transitions, 5678 flow, removed 33 selfloop flow, removed 3 redundant places. [2022-12-13 12:59:08,516 INFO L231 Difference]: Finished difference. Result has 125 places, 0 transitions, 0 flow [2022-12-13 12:59:08,516 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3531, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=0, PETRI_PLACES=125, PETRI_TRANSITIONS=0} [2022-12-13 12:59:08,517 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 107 predicate places. [2022-12-13 12:59:08,517 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:59:08,518 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 0 transitions, 0 flow [2022-12-13 12:59:08,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 12:59:08,518 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 12:59:08,518 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:59:08,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-13 12:59:08,518 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 12:59:08,518 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 12:59:08,518 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:59:08,520 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-13 12:59:08,520 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 12:59:08,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:59:08,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 12:59:08,529 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 12:59:08,529 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 12:59:08,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 12:59:08,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 12:59:08,735 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:59:08,738 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 12:59:08,738 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:59:08,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:59:08 BasicIcfg [2022-12-13 12:59:08,741 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:59:08,741 INFO L158 Benchmark]: Toolchain (without parser) took 85970.18ms. Allocated memory was 199.2MB in the beginning and 451.9MB in the end (delta: 252.7MB). Free memory was 176.1MB in the beginning and 206.4MB in the end (delta: -30.3MB). Peak memory consumption was 223.7MB. Max. memory is 8.0GB. [2022-12-13 12:59:08,741 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 199.2MB. Free memory is still 175.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 12:59:08,741 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.80ms. Allocated memory is still 199.2MB. Free memory was 175.6MB in the beginning and 164.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 12:59:08,742 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.65ms. Allocated memory is still 199.2MB. Free memory was 164.1MB in the beginning and 162.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 12:59:08,742 INFO L158 Benchmark]: Boogie Preprocessor took 20.66ms. Allocated memory is still 199.2MB. Free memory was 162.5MB in the beginning and 160.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 12:59:08,742 INFO L158 Benchmark]: RCFGBuilder took 412.89ms. Allocated memory is still 199.2MB. Free memory was 160.9MB in the beginning and 147.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 12:59:08,742 INFO L158 Benchmark]: TraceAbstraction took 85273.94ms. Allocated memory was 199.2MB in the beginning and 451.9MB in the end (delta: 252.7MB). Free memory was 146.2MB in the beginning and 206.4MB in the end (delta: -60.2MB). Peak memory consumption was 193.3MB. Max. memory is 8.0GB. [2022-12-13 12:59:08,744 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.11ms. Allocated memory is still 199.2MB. Free memory is still 175.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 229.80ms. Allocated memory is still 199.2MB. Free memory was 175.6MB in the beginning and 164.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.65ms. Allocated memory is still 199.2MB. Free memory was 164.1MB in the beginning and 162.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.66ms. Allocated memory is still 199.2MB. Free memory was 162.5MB in the beginning and 160.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 412.89ms. Allocated memory is still 199.2MB. Free memory was 160.9MB in the beginning and 147.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 85273.94ms. Allocated memory was 199.2MB in the beginning and 451.9MB in the end (delta: 252.7MB). Free memory was 146.2MB in the beginning and 206.4MB in the end (delta: -60.2MB). Peak memory consumption was 193.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 76 PlacesBefore, 18 PlacesAfterwards, 80 TransitionsBefore, 13 TransitionsAfterwards, 1088 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 29 TrivialYvCompositions, 29 ConcurrentYvCompositions, 7 ChoiceCompositions, 65 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 592, independent: 592, independent conditional: 592, 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: 592, independent: 592, independent conditional: 0, independent unconditional: 592, 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: 592, independent: 592, independent conditional: 0, independent unconditional: 592, 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: 592, independent: 592, independent conditional: 0, independent unconditional: 592, 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: 499, independent: 499, independent conditional: 0, independent unconditional: 499, 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: 499, independent: 497, independent conditional: 0, independent unconditional: 497, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 592, independent: 93, independent conditional: 0, independent unconditional: 93, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 499, unknown conditional: 0, unknown unconditional: 499] , Statistics on independence cache: Total cache size (in pairs): 901, Positive cache size: 901, Positive conditional cache size: 0, Positive unconditional cache size: 901, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 17 PlacesBefore, 17 PlacesAfterwards, 14 TransitionsBefore, 14 TransitionsAfterwards, 42 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 19 PlacesBefore, 19 PlacesAfterwards, 15 TransitionsBefore, 15 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 36 PlacesBefore, 33 PlacesAfterwards, 29 TransitionsBefore, 26 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 14, independent unconditional: 2, 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: 16, independent: 16, independent conditional: 14, independent unconditional: 2, 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: 10, 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: 11, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 10, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 31, Positive conditional cache size: 30, Positive unconditional cache size: 1, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.0s, 40 PlacesBefore, 39 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 152 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 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: 28, independent unconditional: 4, 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: 28, independent unconditional: 4, 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: 28, independent unconditional: 4, 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: 10, independent: 10, independent conditional: 7, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 22, independent conditional: 21, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 7, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 92, Positive conditional cache size: 88, Positive unconditional cache size: 4, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 36 PlacesBefore, 36 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 94, Positive conditional cache size: 90, Positive unconditional cache size: 4, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 38 PlacesBefore, 37 PlacesAfterwards, 48 TransitionsBefore, 47 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 97, Positive conditional cache size: 93, Positive unconditional cache size: 4, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 142 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): 97, Positive cache size: 97, Positive conditional cache size: 93, Positive unconditional cache size: 4, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.5s, 48 PlacesBefore, 46 PlacesAfterwards, 57 TransitionsBefore, 55 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 9, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 111, Positive conditional cache size: 107, Positive unconditional cache size: 4, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 140 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): 111, Positive cache size: 111, Positive conditional cache size: 107, Positive unconditional cache size: 4, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 62 PlacesBefore, 62 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 112, Positive conditional cache size: 108, Positive unconditional cache size: 4, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 146 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): 112, Positive cache size: 112, Positive conditional cache size: 108, Positive unconditional cache size: 4, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 86 PlacesBefore, 85 PlacesAfterwards, 140 TransitionsBefore, 139 TransitionsAfterwards, 286 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 132, Positive conditional cache size: 128, Positive unconditional cache size: 4, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 98 PlacesBefore, 98 PlacesAfterwards, 172 TransitionsBefore, 172 TransitionsAfterwards, 350 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): 132, Positive cache size: 132, Positive conditional cache size: 128, Positive unconditional cache size: 4, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.3s, 125 PlacesBefore, 120 PlacesAfterwards, 374 TransitionsBefore, 369 TransitionsAfterwards, 754 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 10, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 155, Positive conditional cache size: 151, Positive unconditional cache size: 4, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 114 PlacesBefore, 114 PlacesAfterwards, 359 TransitionsBefore, 359 TransitionsAfterwards, 724 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): 155, Positive cache size: 155, Positive conditional cache size: 151, Positive unconditional cache size: 4, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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): 155, Positive cache size: 155, Positive conditional cache size: 151, Positive unconditional cache size: 4, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 101]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 108 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 85.1s, OverallIterations: 16, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 975 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 975 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3010 IncrementalHoareTripleChecker+Invalid, 4112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1102 mSolverCounterUnsat, 0 mSDtfsCounter, 3010 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 419 GetRequests, 187 SyntacticMatches, 20 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4664occurred in iteration=14, InterpolantAutomatonStates: 176, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 17.8s InterpolantComputationTime, 353 NumberOfCodeBlocks, 353 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 463 ConstructedInterpolants, 0 QuantifiedInterpolants, 5485 SizeOfPredicates, 93 NumberOfNonLiveVariables, 1356 ConjunctsInSsa, 227 ConjunctsInUnsatCore, 38 InterpolantComputations, 5 PerfectInterpolantSequences, 15/110 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 12:59:08,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...