/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:18:05,248 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:18:05,250 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:18:05,286 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:18:05,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:18:05,291 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:18:05,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:18:05,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:18:05,303 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:18:05,305 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:18:05,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:18:05,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:18:05,306 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:18:05,307 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:18:05,307 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:18:05,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:18:05,308 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:18:05,309 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:18:05,310 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:18:05,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:18:05,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:18:05,317 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:18:05,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:18:05,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:18:05,326 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:18:05,326 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:18:05,326 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:18:05,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:18:05,328 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:18:05,328 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:18:05,329 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:18:05,330 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:18:05,331 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:18:05,331 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:18:05,332 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:18:05,332 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:18:05,332 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:18:05,332 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:18:05,333 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:18:05,333 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:18:05,334 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:18:05,334 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:18:05,362 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:18:05,362 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:18:05,364 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:18:05,364 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:18:05,364 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:18:05,364 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:18:05,365 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:18:05,365 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:18:05,365 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:18:05,365 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:18:05,366 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:18:05,366 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:18:05,366 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:18:05,366 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:18:05,366 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:18:05,366 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:18:05,366 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:18:05,366 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:18:05,366 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:18:05,367 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:18:05,367 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:18:05,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:18:05,367 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:18:05,367 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:18:05,367 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:18:05,367 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:18:05,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:18:05,367 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:18:05,368 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 05:18:05,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:18:05,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:18:05,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:18:05,647 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:18:05,648 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:18:05,649 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2022-12-06 05:18:06,643 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:18:06,894 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:18:06,896 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2022-12-06 05:18:06,901 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24ffe60d8/058d2fde4a1d4caba0aa2c4eb3dfbd70/FLAG29ad1d525 [2022-12-06 05:18:06,912 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24ffe60d8/058d2fde4a1d4caba0aa2c4eb3dfbd70 [2022-12-06 05:18:06,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:18:06,915 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:18:06,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:18:06,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:18:06,917 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:18:06,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:18:06" (1/1) ... [2022-12-06 05:18:06,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fea0c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:06, skipping insertion in model container [2022-12-06 05:18:06,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:18:06" (1/1) ... [2022-12-06 05:18:06,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:18:06,937 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:18:07,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:07,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:07,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:07,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:07,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:07,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:07,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:07,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:07,092 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-2.wvr.c[2554,2567] [2022-12-06 05:18:07,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:18:07,104 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:18:07,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:07,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:07,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:07,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:07,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:07,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:07,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:07,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:07,135 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-2.wvr.c[2554,2567] [2022-12-06 05:18:07,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:18:07,146 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:18:07,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:07 WrapperNode [2022-12-06 05:18:07,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:18:07,148 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:18:07,148 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:18:07,148 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:18:07,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:07" (1/1) ... [2022-12-06 05:18:07,166 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:07" (1/1) ... [2022-12-06 05:18:07,185 INFO L138 Inliner]: procedures = 21, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66 [2022-12-06 05:18:07,186 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:18:07,186 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:18:07,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:18:07,187 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:18:07,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:07" (1/1) ... [2022-12-06 05:18:07,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:07" (1/1) ... [2022-12-06 05:18:07,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:07" (1/1) ... [2022-12-06 05:18:07,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:07" (1/1) ... [2022-12-06 05:18:07,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:07" (1/1) ... [2022-12-06 05:18:07,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:07" (1/1) ... [2022-12-06 05:18:07,213 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:07" (1/1) ... [2022-12-06 05:18:07,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:07" (1/1) ... [2022-12-06 05:18:07,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:18:07,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:18:07,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:18:07,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:18:07,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:07" (1/1) ... [2022-12-06 05:18:07,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:18:07,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:18:07,239 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:18:07,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:18:07,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:18:07,271 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:18:07,271 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:18:07,271 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:18:07,271 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:18:07,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:18:07,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:18:07,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:18:07,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:18:07,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:18:07,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:18:07,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:18:07,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:18:07,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:18:07,273 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:18:07,368 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:18:07,370 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:18:07,591 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:18:07,606 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:18:07,606 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 05:18:07,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:18:07 BoogieIcfgContainer [2022-12-06 05:18:07,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:18:07,615 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:18:07,615 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:18:07,617 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:18:07,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:18:06" (1/3) ... [2022-12-06 05:18:07,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@551c42b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:18:07, skipping insertion in model container [2022-12-06 05:18:07,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:07" (2/3) ... [2022-12-06 05:18:07,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@551c42b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:18:07, skipping insertion in model container [2022-12-06 05:18:07,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:18:07" (3/3) ... [2022-12-06 05:18:07,619 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2022-12-06 05:18:07,632 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:18:07,633 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:18:07,633 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:18:07,686 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 05:18:07,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 97 transitions, 210 flow [2022-12-06 05:18:07,750 INFO L130 PetriNetUnfolder]: 8/95 cut-off events. [2022-12-06 05:18:07,750 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:18:07,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 95 events. 8/95 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2022-12-06 05:18:07,754 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 97 transitions, 210 flow [2022-12-06 05:18:07,756 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 87 transitions, 186 flow [2022-12-06 05:18:07,757 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:07,768 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 87 transitions, 186 flow [2022-12-06 05:18:07,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 87 transitions, 186 flow [2022-12-06 05:18:07,794 INFO L130 PetriNetUnfolder]: 8/87 cut-off events. [2022-12-06 05:18:07,794 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:18:07,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 87 events. 8/87 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2022-12-06 05:18:07,796 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 87 transitions, 186 flow [2022-12-06 05:18:07,796 INFO L188 LiptonReduction]: Number of co-enabled transitions 728 [2022-12-06 05:18:10,326 INFO L203 LiptonReduction]: Total number of compositions: 74 [2022-12-06 05:18:10,336 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:18:10,341 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;@621e7554, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:18:10,341 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 05:18:10,351 INFO L130 PetriNetUnfolder]: 2/12 cut-off events. [2022-12-06 05:18:10,351 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:18:10,351 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:10,352 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:10,352 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-06 05:18:10,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:10,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1885800598, now seen corresponding path program 1 times [2022-12-06 05:18:10,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:10,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421547102] [2022-12-06 05:18:10,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:10,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:10,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:10,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:10,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421547102] [2022-12-06 05:18:10,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421547102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:10,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:10,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:18:10,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376254389] [2022-12-06 05:18:10,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:10,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:10,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:10,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:10,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:10,729 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 05:18:10,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 13 transitions, 38 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-06 05:18:10,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:10,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 05:18:10,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:10,799 INFO L130 PetriNetUnfolder]: 41/77 cut-off events. [2022-12-06 05:18:10,799 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 05:18:10,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 77 events. 41/77 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 169 event pairs, 9 based on Foata normal form. 1/54 useless extension candidates. Maximal degree in co-relation 120. Up to 51 conditions per place. [2022-12-06 05:18:10,801 INFO L137 encePairwiseOnDemand]: 9/13 looper letters, 19 selfloop transitions, 3 changer transitions 1/23 dead transitions. [2022-12-06 05:18:10,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 23 transitions, 113 flow [2022-12-06 05:18:10,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:18:10,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:18:10,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-12-06 05:18:10,808 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2022-12-06 05:18:10,809 INFO L175 Difference]: Start difference. First operand has 18 places, 13 transitions, 38 flow. Second operand 3 states and 24 transitions. [2022-12-06 05:18:10,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 23 transitions, 113 flow [2022-12-06 05:18:10,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 23 transitions, 99 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 05:18:10,812 INFO L231 Difference]: Finished difference. Result has 17 places, 15 transitions, 49 flow [2022-12-06 05:18:10,813 INFO L276 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=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=49, PETRI_PLACES=17, PETRI_TRANSITIONS=15} [2022-12-06 05:18:10,817 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, -1 predicate places. [2022-12-06 05:18:10,817 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:10,817 INFO L89 Accepts]: Start accepts. Operand has 17 places, 15 transitions, 49 flow [2022-12-06 05:18:10,820 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:10,820 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:10,820 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 17 places, 15 transitions, 49 flow [2022-12-06 05:18:10,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 17 places, 15 transitions, 49 flow [2022-12-06 05:18:10,830 INFO L130 PetriNetUnfolder]: 5/23 cut-off events. [2022-12-06 05:18:10,830 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:18:10,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 23 events. 5/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 18. Up to 8 conditions per place. [2022-12-06 05:18:10,830 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 17 places, 15 transitions, 49 flow [2022-12-06 05:18:10,830 INFO L188 LiptonReduction]: Number of co-enabled transitions 46 [2022-12-06 05:18:10,831 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:18:10,832 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 05:18:10,832 INFO L495 AbstractCegarLoop]: Abstraction has has 17 places, 15 transitions, 49 flow [2022-12-06 05:18:10,832 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-06 05:18:10,832 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:10,832 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:10,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:18:10,832 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-06 05:18:10,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:10,833 INFO L85 PathProgramCache]: Analyzing trace with hash -291346094, now seen corresponding path program 1 times [2022-12-06 05:18:10,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:10,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902323460] [2022-12-06 05:18:10,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:10,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:10,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:10,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:10,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902323460] [2022-12-06 05:18:10,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902323460] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:10,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:10,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:18:10,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781906699] [2022-12-06 05:18:10,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:10,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:10,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:10,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:10,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:10,985 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 05:18:10,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 17 places, 15 transitions, 49 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-06 05:18:10,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:10,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 05:18:10,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:11,070 INFO L130 PetriNetUnfolder]: 53/103 cut-off events. [2022-12-06 05:18:11,070 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-06 05:18:11,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 103 events. 53/103 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 260 event pairs, 9 based on Foata normal form. 4/107 useless extension candidates. Maximal degree in co-relation 76. Up to 43 conditions per place. [2022-12-06 05:18:11,071 INFO L137 encePairwiseOnDemand]: 9/13 looper letters, 24 selfloop transitions, 4 changer transitions 0/28 dead transitions. [2022-12-06 05:18:11,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 28 transitions, 140 flow [2022-12-06 05:18:11,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:11,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:11,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-12-06 05:18:11,073 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5192307692307693 [2022-12-06 05:18:11,073 INFO L175 Difference]: Start difference. First operand has 17 places, 15 transitions, 49 flow. Second operand 4 states and 27 transitions. [2022-12-06 05:18:11,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 28 transitions, 140 flow [2022-12-06 05:18:11,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 28 transitions, 137 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:18:11,074 INFO L231 Difference]: Finished difference. Result has 21 places, 17 transitions, 73 flow [2022-12-06 05:18:11,075 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=73, PETRI_PLACES=21, PETRI_TRANSITIONS=17} [2022-12-06 05:18:11,075 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 3 predicate places. [2022-12-06 05:18:11,075 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:11,075 INFO L89 Accepts]: Start accepts. Operand has 21 places, 17 transitions, 73 flow [2022-12-06 05:18:11,076 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:11,076 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:11,076 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 17 transitions, 73 flow [2022-12-06 05:18:11,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 17 transitions, 73 flow [2022-12-06 05:18:11,081 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-06 05:18:11,081 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 05:18:11,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 25 events. 4/25 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 41 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 30. Up to 9 conditions per place. [2022-12-06 05:18:11,082 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 17 transitions, 73 flow [2022-12-06 05:18:11,083 INFO L188 LiptonReduction]: Number of co-enabled transitions 60 [2022-12-06 05:18:11,083 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:18:11,084 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 05:18:11,085 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 17 transitions, 73 flow [2022-12-06 05:18:11,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-06 05:18:11,085 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:11,085 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:11,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:18:11,085 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-06 05:18:11,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:11,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1441356224, now seen corresponding path program 2 times [2022-12-06 05:18:11,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:11,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245473837] [2022-12-06 05:18:11,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:11,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:11,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:11,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:11,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245473837] [2022-12-06 05:18:11,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245473837] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:18:11,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651826349] [2022-12-06 05:18:11,218 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:18:11,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:18:11,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:18:11,231 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:18:11,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 05:18:11,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:18:11,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:18:11,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:18:11,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:18:11,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:11,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:18:11,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:11,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651826349] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:18:11,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:18:11,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 05:18:11,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140873686] [2022-12-06 05:18:11,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:18:11,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:18:11,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:11,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:18:11,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:18:11,579 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 05:18:11,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 73 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 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-06 05:18:11,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:11,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 05:18:11,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:11,719 INFO L130 PetriNetUnfolder]: 63/117 cut-off events. [2022-12-06 05:18:11,719 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2022-12-06 05:18:11,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 117 events. 63/117 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 308 event pairs, 9 based on Foata normal form. 18/135 useless extension candidates. Maximal degree in co-relation 192. Up to 48 conditions per place. [2022-12-06 05:18:11,720 INFO L137 encePairwiseOnDemand]: 8/13 looper letters, 31 selfloop transitions, 8 changer transitions 2/41 dead transitions. [2022-12-06 05:18:11,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 41 transitions, 229 flow [2022-12-06 05:18:11,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:18:11,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:18:11,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-06 05:18:11,722 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2022-12-06 05:18:11,722 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 73 flow. Second operand 6 states and 44 transitions. [2022-12-06 05:18:11,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 41 transitions, 229 flow [2022-12-06 05:18:11,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 41 transitions, 218 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 05:18:11,723 INFO L231 Difference]: Finished difference. Result has 27 places, 20 transitions, 114 flow [2022-12-06 05:18:11,724 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=114, PETRI_PLACES=27, PETRI_TRANSITIONS=20} [2022-12-06 05:18:11,724 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 9 predicate places. [2022-12-06 05:18:11,724 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:11,724 INFO L89 Accepts]: Start accepts. Operand has 27 places, 20 transitions, 114 flow [2022-12-06 05:18:11,725 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:11,725 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:11,725 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 20 transitions, 114 flow [2022-12-06 05:18:11,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 20 transitions, 114 flow [2022-12-06 05:18:11,729 INFO L130 PetriNetUnfolder]: 13/37 cut-off events. [2022-12-06 05:18:11,729 INFO L131 PetriNetUnfolder]: For 34/35 co-relation queries the response was YES. [2022-12-06 05:18:11,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 37 events. 13/37 cut-off events. For 34/35 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 72 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 85. Up to 18 conditions per place. [2022-12-06 05:18:11,729 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 20 transitions, 114 flow [2022-12-06 05:18:11,729 INFO L188 LiptonReduction]: Number of co-enabled transitions 62 [2022-12-06 05:18:11,756 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [353] L42-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< (mod v_~i1~0_In_8 4294967296) (* (mod v_~N~0_In_1 2147483648) 2))) (= |v_thread1Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {~i1~0=v_~i1~0_In_8, ~N~0=v_~N~0_In_1} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_4|, ~i1~0=v_~i1~0_In_8, ~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [355] L61-1-->L61-1: Formula: (let ((.cse0 (= (mod v_~d2~0_In_4 256) 0))) (let ((.cse1 (< (mod v_~i2~0_In_9 4294967296) (* (mod v_~N~0_In_5 2147483648) 2))) (.cse2 (= v_~d2~0_Out_26 (ite (= (ite .cse0 1 0) 0) 0 1))) (.cse3 (= (+ v_~i2~0_In_9 1) v_~i2~0_Out_20))) (or (and .cse0 .cse1 (= (+ v_~pos~0_Out_28 2) v_~pos~0_In_15) .cse2 .cse3) (and .cse1 (= v_~pos~0_Out_28 (+ v_~pos~0_In_15 2)) .cse2 (not .cse0) .cse3)))) InVars {~i2~0=v_~i2~0_In_9, ~pos~0=v_~pos~0_In_15, ~N~0=v_~N~0_In_5, ~d2~0=v_~d2~0_In_4} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_Out_10|, ~i2~0=v_~i2~0_Out_20, ~pos~0=v_~pos~0_Out_28, ~N~0=v_~N~0_In_5, ~d2~0=v_~d2~0_Out_26} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~i2~0, ~pos~0, ~d2~0] [2022-12-06 05:18:11,919 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:11,920 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 05:18:11,920 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 121 flow [2022-12-06 05:18:11,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 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-06 05:18:11,920 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:11,920 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:11,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 05:18:12,121 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-06 05:18:12,121 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-06 05:18:12,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:12,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1217645108, now seen corresponding path program 1 times [2022-12-06 05:18:12,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:12,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059514062] [2022-12-06 05:18:12,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:12,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:12,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:18:12,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:12,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059514062] [2022-12-06 05:18:12,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059514062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:12,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:12,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:18:12,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62895620] [2022-12-06 05:18:12,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:12,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:12,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:12,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:12,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:12,206 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 05:18:12,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:12,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:12,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 05:18:12,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:12,287 INFO L130 PetriNetUnfolder]: 68/131 cut-off events. [2022-12-06 05:18:12,287 INFO L131 PetriNetUnfolder]: For 254/254 co-relation queries the response was YES. [2022-12-06 05:18:12,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 131 events. 68/131 cut-off events. For 254/254 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 371 event pairs, 6 based on Foata normal form. 10/141 useless extension candidates. Maximal degree in co-relation 260. Up to 73 conditions per place. [2022-12-06 05:18:12,289 INFO L137 encePairwiseOnDemand]: 8/14 looper letters, 34 selfloop transitions, 8 changer transitions 2/44 dead transitions. [2022-12-06 05:18:12,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 44 transitions, 313 flow [2022-12-06 05:18:12,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:18:12,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:18:12,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-12-06 05:18:12,290 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2022-12-06 05:18:12,290 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 121 flow. Second operand 5 states and 38 transitions. [2022-12-06 05:18:12,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 44 transitions, 313 flow [2022-12-06 05:18:12,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 44 transitions, 273 flow, removed 17 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:12,292 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 172 flow [2022-12-06 05:18:12,292 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=30, PETRI_TRANSITIONS=26} [2022-12-06 05:18:12,293 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 12 predicate places. [2022-12-06 05:18:12,293 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:12,293 INFO L89 Accepts]: Start accepts. Operand has 30 places, 26 transitions, 172 flow [2022-12-06 05:18:12,294 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:12,294 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:12,294 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 26 transitions, 172 flow [2022-12-06 05:18:12,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 26 transitions, 172 flow [2022-12-06 05:18:12,298 INFO L130 PetriNetUnfolder]: 15/50 cut-off events. [2022-12-06 05:18:12,298 INFO L131 PetriNetUnfolder]: For 95/97 co-relation queries the response was YES. [2022-12-06 05:18:12,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 50 events. 15/50 cut-off events. For 95/97 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 129. Up to 24 conditions per place. [2022-12-06 05:18:12,299 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 26 transitions, 172 flow [2022-12-06 05:18:12,299 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 05:18:12,314 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [356] L61-1-->thread2EXIT: Formula: (and (not (< (mod v_~i2~0_In_11 4294967296) (* (mod v_~N~0_In_7 2147483648) 2))) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~i2~0=v_~i2~0_In_11, ~N~0=v_~N~0_In_7} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, ~i2~0=v_~i2~0_In_11, ~N~0=v_~N~0_In_7, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [354] L42-1-->L42-1: Formula: (let ((.cse3 (= (mod v_~d1~0_In_4 256) 0))) (let ((.cse0 (= v_~i1~0_Out_24 (+ v_~i1~0_In_10 1))) (.cse1 (= v_~d1~0_Out_24 (ite (= (ite .cse3 1 0) 0) 0 1))) (.cse2 (< (mod v_~i1~0_In_10 4294967296) (* 2 (mod v_~N~0_In_3 2147483648))))) (or (and .cse0 .cse1 (= v_~pos~0_In_13 (+ v_~pos~0_Out_24 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_Out_4| |v_thread1Thread1of1ForFork0_#t~post1_In_1|) .cse2 .cse3) (and (= |v_thread1Thread1of1ForFork0_#t~post2_In_1| |v_thread1Thread1of1ForFork0_#t~post2_Out_4|) .cse0 .cse1 (not .cse3) (= (+ v_~pos~0_In_13 1) v_~pos~0_Out_24) .cse2)))) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_In_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_In_1|, ~i1~0=v_~i1~0_In_10, ~pos~0=v_~pos~0_In_13, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_In_4} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_Out_4|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_Out_4|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_8|, ~i1~0=v_~i1~0_Out_24, ~pos~0=v_~pos~0_Out_24, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_Out_24} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i1~0, ~pos~0, ~d1~0] [2022-12-06 05:18:12,536 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [354] L42-1-->L42-1: Formula: (let ((.cse3 (= (mod v_~d1~0_In_4 256) 0))) (let ((.cse0 (= v_~i1~0_Out_24 (+ v_~i1~0_In_10 1))) (.cse1 (= v_~d1~0_Out_24 (ite (= (ite .cse3 1 0) 0) 0 1))) (.cse2 (< (mod v_~i1~0_In_10 4294967296) (* 2 (mod v_~N~0_In_3 2147483648))))) (or (and .cse0 .cse1 (= v_~pos~0_In_13 (+ v_~pos~0_Out_24 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_Out_4| |v_thread1Thread1of1ForFork0_#t~post1_In_1|) .cse2 .cse3) (and (= |v_thread1Thread1of1ForFork0_#t~post2_In_1| |v_thread1Thread1of1ForFork0_#t~post2_Out_4|) .cse0 .cse1 (not .cse3) (= (+ v_~pos~0_In_13 1) v_~pos~0_Out_24) .cse2)))) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_In_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_In_1|, ~i1~0=v_~i1~0_In_10, ~pos~0=v_~pos~0_In_13, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_In_4} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_Out_4|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_Out_4|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_8|, ~i1~0=v_~i1~0_Out_24, ~pos~0=v_~pos~0_Out_24, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_Out_24} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i1~0, ~pos~0, ~d1~0] and [355] L61-1-->L61-1: Formula: (let ((.cse0 (= (mod v_~d2~0_In_4 256) 0))) (let ((.cse1 (< (mod v_~i2~0_In_9 4294967296) (* (mod v_~N~0_In_5 2147483648) 2))) (.cse2 (= v_~d2~0_Out_26 (ite (= (ite .cse0 1 0) 0) 0 1))) (.cse3 (= (+ v_~i2~0_In_9 1) v_~i2~0_Out_20))) (or (and .cse0 .cse1 (= (+ v_~pos~0_Out_28 2) v_~pos~0_In_15) .cse2 .cse3) (and .cse1 (= v_~pos~0_Out_28 (+ v_~pos~0_In_15 2)) .cse2 (not .cse0) .cse3)))) InVars {~i2~0=v_~i2~0_In_9, ~pos~0=v_~pos~0_In_15, ~N~0=v_~N~0_In_5, ~d2~0=v_~d2~0_In_4} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_Out_10|, ~i2~0=v_~i2~0_Out_20, ~pos~0=v_~pos~0_Out_28, ~N~0=v_~N~0_In_5, ~d2~0=v_~d2~0_Out_26} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~i2~0, ~pos~0, ~d2~0] [2022-12-06 05:18:12,761 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:18:12,762 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 469 [2022-12-06 05:18:12,762 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 182 flow [2022-12-06 05:18:12,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:12,762 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:12,763 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:12,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:18:12,763 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-06 05:18:12,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:12,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1866508376, now seen corresponding path program 2 times [2022-12-06 05:18:12,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:12,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960299723] [2022-12-06 05:18:12,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:12,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:12,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:12,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:12,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:12,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960299723] [2022-12-06 05:18:12,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960299723] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:18:12,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763793421] [2022-12-06 05:18:12,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:18:12,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:18:12,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:18:12,853 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:18:12,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 05:18:12,985 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:18:12,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:18:12,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:18:12,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:18:13,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:13,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:18:13,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:13,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763793421] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:18:13,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:18:13,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 05:18:13,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321589688] [2022-12-06 05:18:13,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:18:13,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:18:13,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:13,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:18:13,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:18:13,140 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 05:18:13,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 182 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 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-06 05:18:13,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:13,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 05:18:13,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:13,319 INFO L130 PetriNetUnfolder]: 113/222 cut-off events. [2022-12-06 05:18:13,319 INFO L131 PetriNetUnfolder]: For 636/636 co-relation queries the response was YES. [2022-12-06 05:18:13,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 973 conditions, 222 events. 113/222 cut-off events. For 636/636 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 734 event pairs, 11 based on Foata normal form. 20/242 useless extension candidates. Maximal degree in co-relation 435. Up to 105 conditions per place. [2022-12-06 05:18:13,321 INFO L137 encePairwiseOnDemand]: 8/16 looper letters, 43 selfloop transitions, 17 changer transitions 4/64 dead transitions. [2022-12-06 05:18:13,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 64 transitions, 545 flow [2022-12-06 05:18:13,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:18:13,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:18:13,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-12-06 05:18:13,323 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5267857142857143 [2022-12-06 05:18:13,323 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 182 flow. Second operand 7 states and 59 transitions. [2022-12-06 05:18:13,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 64 transitions, 545 flow [2022-12-06 05:18:13,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 64 transitions, 535 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-12-06 05:18:13,328 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 373 flow [2022-12-06 05:18:13,328 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=373, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2022-12-06 05:18:13,330 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 22 predicate places. [2022-12-06 05:18:13,330 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:13,330 INFO L89 Accepts]: Start accepts. Operand has 40 places, 36 transitions, 373 flow [2022-12-06 05:18:13,331 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:13,332 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:13,332 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 36 transitions, 373 flow [2022-12-06 05:18:13,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 36 transitions, 373 flow [2022-12-06 05:18:13,341 INFO L130 PetriNetUnfolder]: 26/83 cut-off events. [2022-12-06 05:18:13,341 INFO L131 PetriNetUnfolder]: For 423/424 co-relation queries the response was YES. [2022-12-06 05:18:13,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 389 conditions, 83 events. 26/83 cut-off events. For 423/424 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 262 event pairs, 1 based on Foata normal form. 1/82 useless extension candidates. Maximal degree in co-relation 342. Up to 41 conditions per place. [2022-12-06 05:18:13,346 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 36 transitions, 373 flow [2022-12-06 05:18:13,346 INFO L188 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-06 05:18:13,347 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [354] L42-1-->L42-1: Formula: (let ((.cse3 (= (mod v_~d1~0_In_4 256) 0))) (let ((.cse0 (= v_~i1~0_Out_24 (+ v_~i1~0_In_10 1))) (.cse1 (= v_~d1~0_Out_24 (ite (= (ite .cse3 1 0) 0) 0 1))) (.cse2 (< (mod v_~i1~0_In_10 4294967296) (* 2 (mod v_~N~0_In_3 2147483648))))) (or (and .cse0 .cse1 (= v_~pos~0_In_13 (+ v_~pos~0_Out_24 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_Out_4| |v_thread1Thread1of1ForFork0_#t~post1_In_1|) .cse2 .cse3) (and (= |v_thread1Thread1of1ForFork0_#t~post2_In_1| |v_thread1Thread1of1ForFork0_#t~post2_Out_4|) .cse0 .cse1 (not .cse3) (= (+ v_~pos~0_In_13 1) v_~pos~0_Out_24) .cse2)))) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_In_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_In_1|, ~i1~0=v_~i1~0_In_10, ~pos~0=v_~pos~0_In_13, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_In_4} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_Out_4|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_Out_4|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_8|, ~i1~0=v_~i1~0_Out_24, ~pos~0=v_~pos~0_Out_24, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_Out_24} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i1~0, ~pos~0, ~d1~0] and [355] L61-1-->L61-1: Formula: (let ((.cse0 (= (mod v_~d2~0_In_4 256) 0))) (let ((.cse1 (< (mod v_~i2~0_In_9 4294967296) (* (mod v_~N~0_In_5 2147483648) 2))) (.cse2 (= v_~d2~0_Out_26 (ite (= (ite .cse0 1 0) 0) 0 1))) (.cse3 (= (+ v_~i2~0_In_9 1) v_~i2~0_Out_20))) (or (and .cse0 .cse1 (= (+ v_~pos~0_Out_28 2) v_~pos~0_In_15) .cse2 .cse3) (and .cse1 (= v_~pos~0_Out_28 (+ v_~pos~0_In_15 2)) .cse2 (not .cse0) .cse3)))) InVars {~i2~0=v_~i2~0_In_9, ~pos~0=v_~pos~0_In_15, ~N~0=v_~N~0_In_5, ~d2~0=v_~d2~0_In_4} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_Out_10|, ~i2~0=v_~i2~0_Out_20, ~pos~0=v_~pos~0_Out_28, ~N~0=v_~N~0_In_5, ~d2~0=v_~d2~0_Out_26} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~i2~0, ~pos~0, ~d2~0] [2022-12-06 05:18:13,655 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [355] L61-1-->L61-1: Formula: (let ((.cse0 (= (mod v_~d2~0_In_4 256) 0))) (let ((.cse1 (< (mod v_~i2~0_In_9 4294967296) (* (mod v_~N~0_In_5 2147483648) 2))) (.cse2 (= v_~d2~0_Out_26 (ite (= (ite .cse0 1 0) 0) 0 1))) (.cse3 (= (+ v_~i2~0_In_9 1) v_~i2~0_Out_20))) (or (and .cse0 .cse1 (= (+ v_~pos~0_Out_28 2) v_~pos~0_In_15) .cse2 .cse3) (and .cse1 (= v_~pos~0_Out_28 (+ v_~pos~0_In_15 2)) .cse2 (not .cse0) .cse3)))) InVars {~i2~0=v_~i2~0_In_9, ~pos~0=v_~pos~0_In_15, ~N~0=v_~N~0_In_5, ~d2~0=v_~d2~0_In_4} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_Out_10|, ~i2~0=v_~i2~0_Out_20, ~pos~0=v_~pos~0_Out_28, ~N~0=v_~N~0_In_5, ~d2~0=v_~d2~0_Out_26} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~i2~0, ~pos~0, ~d2~0] and [360] L42-1-->L61-1: Formula: (let ((.cse4 (* 2 (mod v_~N~0_107 2147483648)))) (and (let ((.cse0 (= (mod v_~d1~0_142 256) 0))) (let ((.cse1 (= (ite (= (ite .cse0 1 0) 0) 0 1) v_~d1~0_141)) (.cse2 (= (+ v_~i1~0_141 1) v_~i1~0_140)) (.cse3 (< (mod v_~i1~0_141 4294967296) .cse4))) (or (and (not .cse0) .cse1 .cse2 (= v_~pos~0_273 (+ v_~pos~0_274 1)) (= |v_thread1Thread1of1ForFork0_#t~post2_46| |v_thread1Thread1of1ForFork0_#t~post2_45|) .cse3) (and .cse1 .cse0 (= |v_thread1Thread1of1ForFork0_#t~post1_46| |v_thread1Thread1of1ForFork0_#t~post1_45|) (= v_~pos~0_274 (+ v_~pos~0_273 1)) .cse2 .cse3)))) (let ((.cse7 (= (mod v_~d2~0_149 256) 0))) (let ((.cse5 (= (+ v_~i2~0_128 1) v_~i2~0_127)) (.cse6 (= (ite (= (ite .cse7 1 0) 0) 0 1) v_~d2~0_148)) (.cse8 (< (mod v_~i2~0_128 4294967296) .cse4))) (or (and (= v_~pos~0_273 (+ v_~pos~0_272 2)) .cse5 .cse6 .cse7 .cse8) (and (= v_~pos~0_272 (+ v_~pos~0_273 2)) (not .cse7) .cse5 .cse6 .cse8)))))) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_46|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_46|, ~i2~0=v_~i2~0_128, ~pos~0=v_~pos~0_274, ~N~0=v_~N~0_107, ~i1~0=v_~i1~0_141, ~d2~0=v_~d2~0_149, ~d1~0=v_~d1~0_142} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_69|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_45|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_45|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_48|, ~i2~0=v_~i2~0_127, ~pos~0=v_~pos~0_272, ~N~0=v_~N~0_107, ~i1~0=v_~i1~0_140, ~d2~0=v_~d2~0_148, ~d1~0=v_~d1~0_141} AuxVars[v_~pos~0_273] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~pos~0, ~i1~0, ~d2~0, ~d1~0] [2022-12-06 05:18:14,212 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [355] L61-1-->L61-1: Formula: (let ((.cse0 (= (mod v_~d2~0_In_4 256) 0))) (let ((.cse1 (< (mod v_~i2~0_In_9 4294967296) (* (mod v_~N~0_In_5 2147483648) 2))) (.cse2 (= v_~d2~0_Out_26 (ite (= (ite .cse0 1 0) 0) 0 1))) (.cse3 (= (+ v_~i2~0_In_9 1) v_~i2~0_Out_20))) (or (and .cse0 .cse1 (= (+ v_~pos~0_Out_28 2) v_~pos~0_In_15) .cse2 .cse3) (and .cse1 (= v_~pos~0_Out_28 (+ v_~pos~0_In_15 2)) .cse2 (not .cse0) .cse3)))) InVars {~i2~0=v_~i2~0_In_9, ~pos~0=v_~pos~0_In_15, ~N~0=v_~N~0_In_5, ~d2~0=v_~d2~0_In_4} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_Out_10|, ~i2~0=v_~i2~0_Out_20, ~pos~0=v_~pos~0_Out_28, ~N~0=v_~N~0_In_5, ~d2~0=v_~d2~0_Out_26} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~i2~0, ~pos~0, ~d2~0] and [354] L42-1-->L42-1: Formula: (let ((.cse3 (= (mod v_~d1~0_In_4 256) 0))) (let ((.cse0 (= v_~i1~0_Out_24 (+ v_~i1~0_In_10 1))) (.cse1 (= v_~d1~0_Out_24 (ite (= (ite .cse3 1 0) 0) 0 1))) (.cse2 (< (mod v_~i1~0_In_10 4294967296) (* 2 (mod v_~N~0_In_3 2147483648))))) (or (and .cse0 .cse1 (= v_~pos~0_In_13 (+ v_~pos~0_Out_24 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_Out_4| |v_thread1Thread1of1ForFork0_#t~post1_In_1|) .cse2 .cse3) (and (= |v_thread1Thread1of1ForFork0_#t~post2_In_1| |v_thread1Thread1of1ForFork0_#t~post2_Out_4|) .cse0 .cse1 (not .cse3) (= (+ v_~pos~0_In_13 1) v_~pos~0_Out_24) .cse2)))) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_In_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_In_1|, ~i1~0=v_~i1~0_In_10, ~pos~0=v_~pos~0_In_13, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_In_4} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_Out_4|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_Out_4|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_8|, ~i1~0=v_~i1~0_Out_24, ~pos~0=v_~pos~0_Out_24, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_Out_24} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i1~0, ~pos~0, ~d1~0] [2022-12-06 05:18:14,419 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [354] L42-1-->L42-1: Formula: (let ((.cse3 (= (mod v_~d1~0_In_4 256) 0))) (let ((.cse0 (= v_~i1~0_Out_24 (+ v_~i1~0_In_10 1))) (.cse1 (= v_~d1~0_Out_24 (ite (= (ite .cse3 1 0) 0) 0 1))) (.cse2 (< (mod v_~i1~0_In_10 4294967296) (* 2 (mod v_~N~0_In_3 2147483648))))) (or (and .cse0 .cse1 (= v_~pos~0_In_13 (+ v_~pos~0_Out_24 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_Out_4| |v_thread1Thread1of1ForFork0_#t~post1_In_1|) .cse2 .cse3) (and (= |v_thread1Thread1of1ForFork0_#t~post2_In_1| |v_thread1Thread1of1ForFork0_#t~post2_Out_4|) .cse0 .cse1 (not .cse3) (= (+ v_~pos~0_In_13 1) v_~pos~0_Out_24) .cse2)))) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_In_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_In_1|, ~i1~0=v_~i1~0_In_10, ~pos~0=v_~pos~0_In_13, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_In_4} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_Out_4|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_Out_4|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_8|, ~i1~0=v_~i1~0_Out_24, ~pos~0=v_~pos~0_Out_24, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_Out_24} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i1~0, ~pos~0, ~d1~0] and [355] L61-1-->L61-1: Formula: (let ((.cse0 (= (mod v_~d2~0_In_4 256) 0))) (let ((.cse1 (< (mod v_~i2~0_In_9 4294967296) (* (mod v_~N~0_In_5 2147483648) 2))) (.cse2 (= v_~d2~0_Out_26 (ite (= (ite .cse0 1 0) 0) 0 1))) (.cse3 (= (+ v_~i2~0_In_9 1) v_~i2~0_Out_20))) (or (and .cse0 .cse1 (= (+ v_~pos~0_Out_28 2) v_~pos~0_In_15) .cse2 .cse3) (and .cse1 (= v_~pos~0_Out_28 (+ v_~pos~0_In_15 2)) .cse2 (not .cse0) .cse3)))) InVars {~i2~0=v_~i2~0_In_9, ~pos~0=v_~pos~0_In_15, ~N~0=v_~N~0_In_5, ~d2~0=v_~d2~0_In_4} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_Out_10|, ~i2~0=v_~i2~0_Out_20, ~pos~0=v_~pos~0_Out_28, ~N~0=v_~N~0_In_5, ~d2~0=v_~d2~0_Out_26} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~i2~0, ~pos~0, ~d2~0] [2022-12-06 05:18:14,672 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:18:14,672 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1342 [2022-12-06 05:18:14,673 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 401 flow [2022-12-06 05:18:14,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 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-06 05:18:14,673 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:14,673 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:14,686 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-06 05:18:14,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:18:14,877 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-06 05:18:14,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:14,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1312265035, now seen corresponding path program 1 times [2022-12-06 05:18:14,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:14,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739734964] [2022-12-06 05:18:14,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:14,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:15,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:18:15,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:15,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739734964] [2022-12-06 05:18:15,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739734964] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:18:15,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239397585] [2022-12-06 05:18:15,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:15,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:18:15,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:18:15,484 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:18:15,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 05:18:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:15,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 05:18:15,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:18:15,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:15,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:18:16,575 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-06 05:18:16,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239397585] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:18:16,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:18:16,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 11 [2022-12-06 05:18:16,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243057991] [2022-12-06 05:18:16,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:18:16,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:18:16,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:16,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:18:16,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-12-06 05:18:16,577 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 05:18:16,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 401 flow. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:16,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:16,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 05:18:16,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:17,829 INFO L130 PetriNetUnfolder]: 229/451 cut-off events. [2022-12-06 05:18:17,830 INFO L131 PetriNetUnfolder]: For 1919/1919 co-relation queries the response was YES. [2022-12-06 05:18:17,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2442 conditions, 451 events. 229/451 cut-off events. For 1919/1919 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2082 event pairs, 0 based on Foata normal form. 3/448 useless extension candidates. Maximal degree in co-relation 1122. Up to 213 conditions per place. [2022-12-06 05:18:17,833 INFO L137 encePairwiseOnDemand]: 7/19 looper letters, 81 selfloop transitions, 66 changer transitions 6/153 dead transitions. [2022-12-06 05:18:17,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 153 transitions, 1564 flow [2022-12-06 05:18:17,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 05:18:17,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 05:18:17,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 122 transitions. [2022-12-06 05:18:17,834 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3379501385041551 [2022-12-06 05:18:17,834 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 401 flow. Second operand 19 states and 122 transitions. [2022-12-06 05:18:17,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 153 transitions, 1564 flow [2022-12-06 05:18:17,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 153 transitions, 1399 flow, removed 74 selfloop flow, removed 2 redundant places. [2022-12-06 05:18:17,840 INFO L231 Difference]: Finished difference. Result has 63 places, 88 transitions, 1115 flow [2022-12-06 05:18:17,840 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1115, PETRI_PLACES=63, PETRI_TRANSITIONS=88} [2022-12-06 05:18:17,840 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 45 predicate places. [2022-12-06 05:18:17,840 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:17,840 INFO L89 Accepts]: Start accepts. Operand has 63 places, 88 transitions, 1115 flow [2022-12-06 05:18:17,841 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:17,841 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:17,841 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 88 transitions, 1115 flow [2022-12-06 05:18:17,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 88 transitions, 1115 flow [2022-12-06 05:18:17,855 INFO L130 PetriNetUnfolder]: 52/170 cut-off events. [2022-12-06 05:18:17,855 INFO L131 PetriNetUnfolder]: For 926/929 co-relation queries the response was YES. [2022-12-06 05:18:17,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 936 conditions, 170 events. 52/170 cut-off events. For 926/929 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 854 event pairs, 1 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 845. Up to 77 conditions per place. [2022-12-06 05:18:17,856 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 88 transitions, 1115 flow [2022-12-06 05:18:17,856 INFO L188 LiptonReduction]: Number of co-enabled transitions 258 [2022-12-06 05:18:20,064 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [366] L42-1-->L42-1: Formula: (let ((.cse4 (+ v_~pos~0_307 1)) (.cse5 (* 2 (mod v_~N~0_115 2147483648)))) (and (let ((.cse0 (= (mod v_~d1~0_162 256) 0))) (let ((.cse1 (= (+ v_~i1~0_161 1) v_~i1~0_160)) (.cse2 (< (mod v_~i1~0_161 4294967296) .cse5)) (.cse3 (= v_~d1~0_161 (ite (= (ite .cse0 1 0) 0) 0 1)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_67| |v_thread1Thread1of1ForFork0_#t~post1_66|) (= v_~pos~0_307 (+ v_~pos~0_306 1)) .cse0 .cse1 .cse2 .cse3) (and (= v_~pos~0_306 .cse4) (not .cse0) .cse1 .cse2 .cse3 (= |v_thread1Thread1of1ForFork0_#t~post2_67| |v_thread1Thread1of1ForFork0_#t~post2_66|))))) (let ((.cse8 (= (mod v_~d1~0_163 256) 0))) (let ((.cse6 (= v_~d1~0_162 (ite (= (ite .cse8 1 0) 0) 0 1))) (.cse7 (= v_~i1~0_161 (+ v_~i1~0_162 1))) (.cse9 (< (mod v_~i1~0_162 4294967296) .cse5))) (or (and .cse6 .cse7 (not .cse8) (= v_~pos~0_307 (+ v_~pos~0_308 1)) (= |v_thread1Thread1of1ForFork0_#t~post2_68| |v_thread1Thread1of1ForFork0_#t~post2_67|) .cse9) (and .cse8 .cse6 .cse7 .cse9 (= |v_thread1Thread1of1ForFork0_#t~post1_68| |v_thread1Thread1of1ForFork0_#t~post1_67|) (= v_~pos~0_308 .cse4))))))) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_68|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_68|, ~i1~0=v_~i1~0_162, ~pos~0=v_~pos~0_308, ~N~0=v_~N~0_115, ~d1~0=v_~d1~0_163} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_66|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_66|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_59|, ~i1~0=v_~i1~0_160, ~pos~0=v_~pos~0_306, ~N~0=v_~N~0_115, ~d1~0=v_~d1~0_161} AuxVars[v_~pos~0_307, v_~i1~0_161, |v_thread1Thread1of1ForFork0_#t~post1_67|, |v_thread1Thread1of1ForFork0_#t~post2_67|, v_~d1~0_162] AssignedVars[thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i1~0, ~pos~0, ~d1~0] and [355] L61-1-->L61-1: Formula: (let ((.cse0 (= (mod v_~d2~0_In_4 256) 0))) (let ((.cse1 (< (mod v_~i2~0_In_9 4294967296) (* (mod v_~N~0_In_5 2147483648) 2))) (.cse2 (= v_~d2~0_Out_26 (ite (= (ite .cse0 1 0) 0) 0 1))) (.cse3 (= (+ v_~i2~0_In_9 1) v_~i2~0_Out_20))) (or (and .cse0 .cse1 (= (+ v_~pos~0_Out_28 2) v_~pos~0_In_15) .cse2 .cse3) (and .cse1 (= v_~pos~0_Out_28 (+ v_~pos~0_In_15 2)) .cse2 (not .cse0) .cse3)))) InVars {~i2~0=v_~i2~0_In_9, ~pos~0=v_~pos~0_In_15, ~N~0=v_~N~0_In_5, ~d2~0=v_~d2~0_In_4} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_Out_10|, ~i2~0=v_~i2~0_Out_20, ~pos~0=v_~pos~0_Out_28, ~N~0=v_~N~0_In_5, ~d2~0=v_~d2~0_Out_26} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~i2~0, ~pos~0, ~d2~0] [2022-12-06 05:18:20,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 05:18:20,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:18:20,686 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Function c_aux_v_~pos~0_310 is already defined. at de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.declareFun(Scriptor.java:115) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.declareFun(HistoryRecordingScript.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.declareFun(ManagedScript.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:117) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToTransFormula(BranchEncoderRenaming.java:114) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToIcfgEdge(BranchEncoderRenaming.java:134) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:119) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:1) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:67) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.executeComposition(SequenceRule.java:724) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.applyInternal(SequenceRule.java:150) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.sequenceRuleWrapper(LiptonReduction.java:252) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:199) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 05:18:20,688 INFO L158 Benchmark]: Toolchain (without parser) took 13773.46ms. Allocated memory was 179.3MB in the beginning and 337.6MB in the end (delta: 158.3MB). Free memory was 155.3MB in the beginning and 178.8MB in the end (delta: -23.5MB). Peak memory consumption was 198.3MB. Max. memory is 8.0GB. [2022-12-06 05:18:20,689 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 179.3MB. Free memory was 156.0MB in the beginning and 155.9MB in the end (delta: 71.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:18:20,689 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.16ms. Allocated memory is still 179.3MB. Free memory was 155.3MB in the beginning and 143.3MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 05:18:20,689 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.32ms. Allocated memory is still 179.3MB. Free memory was 143.3MB in the beginning and 141.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:18:20,689 INFO L158 Benchmark]: Boogie Preprocessor took 28.53ms. Allocated memory is still 179.3MB. Free memory was 141.6MB in the beginning and 140.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 05:18:20,689 INFO L158 Benchmark]: RCFGBuilder took 397.74ms. Allocated memory is still 179.3MB. Free memory was 140.1MB in the beginning and 126.0MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 05:18:20,690 INFO L158 Benchmark]: TraceAbstraction took 13072.87ms. Allocated memory was 179.3MB in the beginning and 337.6MB in the end (delta: 158.3MB). Free memory was 125.4MB in the beginning and 178.8MB in the end (delta: -53.4MB). Peak memory consumption was 168.9MB. Max. memory is 8.0GB. [2022-12-06 05:18:20,690 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 179.3MB. Free memory was 156.0MB in the beginning and 155.9MB in the end (delta: 71.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 231.16ms. Allocated memory is still 179.3MB. Free memory was 155.3MB in the beginning and 143.3MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.32ms. Allocated memory is still 179.3MB. Free memory was 143.3MB in the beginning and 141.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.53ms. Allocated memory is still 179.3MB. Free memory was 141.6MB in the beginning and 140.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 397.74ms. Allocated memory is still 179.3MB. Free memory was 140.1MB in the beginning and 126.0MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 13072.87ms. Allocated memory was 179.3MB in the beginning and 337.6MB in the end (delta: 158.3MB). Free memory was 125.4MB in the beginning and 178.8MB in the end (delta: -53.4MB). Peak memory consumption was 168.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 86 PlacesBefore, 18 PlacesAfterwards, 87 TransitionsBefore, 13 TransitionsAfterwards, 728 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 25 ConcurrentYvCompositions, 6 ChoiceCompositions, 74 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 461, independent: 461, independent conditional: 461, 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: 461, independent: 461, independent conditional: 0, independent unconditional: 461, 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: 461, independent: 461, independent conditional: 0, independent unconditional: 461, 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: 461, independent: 461, independent conditional: 0, independent unconditional: 461, 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: 421, independent: 421, independent conditional: 0, independent unconditional: 421, 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: 421, independent: 401, independent conditional: 0, independent unconditional: 401, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 461, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 421, unknown conditional: 0, unknown unconditional: 421] , Statistics on independence cache: Total cache size (in pairs): 780, Positive cache size: 780, Positive conditional cache size: 0, Positive unconditional cache size: 780, 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, 15 TransitionsBefore, 15 TransitionsAfterwards, 46 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, 21 PlacesBefore, 21 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 60 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.2s, 26 PlacesBefore, 26 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 62 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4, Positive cache size: 4, Positive conditional cache size: 4, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 30 PlacesBefore, 30 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 4, independent unconditional: 3, 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: 7, independent: 7, independent conditional: 4, independent unconditional: 3, 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: 7, independent: 7, independent conditional: 4, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 7, Positive cache size: 7, Positive conditional cache size: 4, Positive unconditional cache size: 3, 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.3s, 40 PlacesBefore, 40 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 13, Positive conditional cache size: 10, Positive unconditional cache size: 3, 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 - ExceptionOrErrorResult: SMTLIBException: Function c_aux_v_~pos~0_310 is already defined. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Function c_aux_v_~pos~0_310 is already defined.: de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 05:18:20,710 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...