/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 13:16:40,005 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:16:40,007 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:16:40,045 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:16:40,047 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:16:40,050 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:16:40,052 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:16:40,057 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:16:40,061 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:16:40,065 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:16:40,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:16:40,069 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:16:40,069 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:16:40,070 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:16:40,070 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:16:40,071 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:16:40,072 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:16:40,072 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:16:40,073 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:16:40,075 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:16:40,076 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:16:40,079 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:16:40,080 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:16:40,081 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:16:40,083 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:16:40,084 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:16:40,084 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:16:40,085 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:16:40,085 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:16:40,086 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:16:40,086 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:16:40,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:16:40,087 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:16:40,088 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:16:40,088 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:16:40,088 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:16:40,089 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:16:40,089 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:16:40,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:16:40,090 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:16:40,090 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:16:40,091 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 13:16:40,122 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:16:40,122 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:16:40,124 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:16:40,124 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:16:40,124 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:16:40,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:16:40,125 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:16:40,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:16:40,126 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:16:40,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:16:40,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 13:16:40,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:16:40,127 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 13:16:40,127 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:16:40,127 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:16:40,127 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:16:40,127 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 13:16:40,127 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:16:40,127 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:16:40,127 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 13:16:40,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:16:40,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:16:40,128 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:16:40,128 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:16:40,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:16:40,128 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 13:16:40,128 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:16:40,128 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 13:16:40,129 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 13:16:40,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:16:40,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:16:40,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:16:40,483 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:16:40,483 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:16:40,484 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c [2022-12-13 13:16:41,571 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:16:41,787 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:16:41,787 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c [2022-12-13 13:16:41,793 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc40eb376/aaa6a007fb184aa0894afe64113c6a3b/FLAGf7dfa4595 [2022-12-13 13:16:41,809 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc40eb376/aaa6a007fb184aa0894afe64113c6a3b [2022-12-13 13:16:41,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:16:41,812 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 13:16:41,813 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:16:41,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:16:41,816 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:16:41,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:16:41" (1/1) ... [2022-12-13 13:16:41,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49162381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:41, skipping insertion in model container [2022-12-13 13:16:41,818 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:16:41" (1/1) ... [2022-12-13 13:16:41,823 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:16:41,842 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:16:41,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:41,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:41,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:41,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:41,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:41,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:41,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:41,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:41,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:41,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:41,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:41,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:41,975 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/popl20-more-array-sum-alt.wvr.c[2761,2774] [2022-12-13 13:16:41,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:16:41,992 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:16:42,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,016 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/popl20-more-array-sum-alt.wvr.c[2761,2774] [2022-12-13 13:16:42,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:16:42,033 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:16:42,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:42 WrapperNode [2022-12-13 13:16:42,033 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:16:42,034 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:16:42,034 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:16:42,034 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:16:42,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:42" (1/1) ... [2022-12-13 13:16:42,059 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:42" (1/1) ... [2022-12-13 13:16:42,098 INFO L138 Inliner]: procedures = 25, calls = 51, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 200 [2022-12-13 13:16:42,099 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:16:42,100 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:16:42,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:16:42,100 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:16:42,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:42" (1/1) ... [2022-12-13 13:16:42,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:42" (1/1) ... [2022-12-13 13:16:42,123 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:42" (1/1) ... [2022-12-13 13:16:42,124 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:42" (1/1) ... [2022-12-13 13:16:42,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:42" (1/1) ... [2022-12-13 13:16:42,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:42" (1/1) ... [2022-12-13 13:16:42,135 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:42" (1/1) ... [2022-12-13 13:16:42,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:42" (1/1) ... [2022-12-13 13:16:42,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:16:42,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:16:42,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:16:42,154 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:16:42,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:42" (1/1) ... [2022-12-13 13:16:42,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:16:42,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:16:42,189 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:42,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:16:42,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:16:42,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 13:16:42,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:16:42,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 13:16:42,234 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 13:16:42,234 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 13:16:42,234 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 13:16:42,235 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 13:16:42,235 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 13:16:42,235 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 13:16:42,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:16:42,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 13:16:42,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 13:16:42,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 13:16:42,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:16:42,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:16:42,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:16:42,237 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 13:16:42,388 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 13:16:42,390 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:16:42,665 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 13:16:42,935 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:16:42,935 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 13:16:42,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:16:42 BoogieIcfgContainer [2022-12-13 13:16:42,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:16:42,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:16:42,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:16:42,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:16:42,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:16:41" (1/3) ... [2022-12-13 13:16:42,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe42452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:16:42, skipping insertion in model container [2022-12-13 13:16:42,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:42" (2/3) ... [2022-12-13 13:16:42,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe42452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:16:42, skipping insertion in model container [2022-12-13 13:16:42,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:16:42" (3/3) ... [2022-12-13 13:16:42,952 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt.wvr.c [2022-12-13 13:16:42,970 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:16:42,970 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 13:16:42,971 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 13:16:43,086 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 13:16:43,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 144 transitions, 312 flow [2022-12-13 13:16:43,228 INFO L130 PetriNetUnfolder]: 12/141 cut-off events. [2022-12-13 13:16:43,228 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 13:16:43,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 12/141 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 95 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2022-12-13 13:16:43,234 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 144 transitions, 312 flow [2022-12-13 13:16:43,243 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 131 transitions, 280 flow [2022-12-13 13:16:43,245 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:16:43,275 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 131 transitions, 280 flow [2022-12-13 13:16:43,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 131 transitions, 280 flow [2022-12-13 13:16:43,332 INFO L130 PetriNetUnfolder]: 12/131 cut-off events. [2022-12-13 13:16:43,332 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 13:16:43,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 131 events. 12/131 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 94 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2022-12-13 13:16:43,338 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 131 transitions, 280 flow [2022-12-13 13:16:43,338 INFO L226 LiptonReduction]: Number of co-enabled transitions 1518 [2022-12-13 13:16:48,634 INFO L241 LiptonReduction]: Total number of compositions: 105 [2022-12-13 13:16:48,647 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:16:48,652 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;@1fd325cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 13:16:48,652 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 13:16:48,657 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-13 13:16:48,657 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 13:16:48,658 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:16:48,658 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:16:48,659 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 13:16:48,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:48,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1674226892, now seen corresponding path program 1 times [2022-12-13 13:16:48,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:48,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766900670] [2022-12-13 13:16:48,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:48,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:49,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:16:49,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:16:49,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766900670] [2022-12-13 13:16:49,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766900670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:16:49,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:16:49,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:16:49,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508494566] [2022-12-13 13:16:49,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:16:49,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:16:49,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:16:49,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:16:49,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:16:49,220 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-13 13:16:49,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:49,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:16:49,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-13 13:16:49,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:16:49,371 INFO L130 PetriNetUnfolder]: 619/869 cut-off events. [2022-12-13 13:16:49,371 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-12-13 13:16:49,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1812 conditions, 869 events. 619/869 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3388 event pairs, 95 based on Foata normal form. 1/582 useless extension candidates. Maximal degree in co-relation 1365. Up to 688 conditions per place. [2022-12-13 13:16:49,379 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 36 selfloop transitions, 4 changer transitions 1/44 dead transitions. [2022-12-13 13:16:49,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 44 transitions, 203 flow [2022-12-13 13:16:49,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:16:49,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:16:49,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-12-13 13:16:49,389 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6538461538461539 [2022-12-13 13:16:49,390 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 70 flow. Second operand 3 states and 51 transitions. [2022-12-13 13:16:49,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 44 transitions, 203 flow [2022-12-13 13:16:49,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 44 transitions, 181 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-13 13:16:49,399 INFO L231 Difference]: Finished difference. Result has 29 places, 29 transitions, 84 flow [2022-12-13 13:16:49,401 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=29, PETRI_TRANSITIONS=29} [2022-12-13 13:16:49,405 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, -3 predicate places. [2022-12-13 13:16:49,406 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:16:49,407 INFO L89 Accepts]: Start accepts. Operand has 29 places, 29 transitions, 84 flow [2022-12-13 13:16:49,409 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:16:49,410 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:16:49,410 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 29 transitions, 84 flow [2022-12-13 13:16:49,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 29 transitions, 84 flow [2022-12-13 13:16:49,427 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([543] thread3EXIT-->L101-2: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem21#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} AuxVars[] AssignedVars[][27], [Black: 147#(= ~res2~0 ~res1~0), 145#true, 87#L101-2true]) [2022-12-13 13:16:49,427 INFO L382 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-12-13 13:16:49,428 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 13:16:49,428 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 13:16:49,428 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 13:16:49,428 INFO L130 PetriNetUnfolder]: 23/72 cut-off events. [2022-12-13 13:16:49,428 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:16:49,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 72 events. 23/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 187 event pairs, 1 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 72. Up to 26 conditions per place. [2022-12-13 13:16:49,433 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 29 transitions, 84 flow [2022-12-13 13:16:49,433 INFO L226 LiptonReduction]: Number of co-enabled transitions 246 [2022-12-13 13:16:49,443 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:16:49,446 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-13 13:16:49,446 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 29 transitions, 84 flow [2022-12-13 13:16:49,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:49,446 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:16:49,446 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:16:49,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:16:49,450 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 13:16:49,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:49,450 INFO L85 PathProgramCache]: Analyzing trace with hash 693833528, now seen corresponding path program 1 times [2022-12-13 13:16:49,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:49,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585269153] [2022-12-13 13:16:49,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:49,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:49,605 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-13 13:16:49,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:16:49,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585269153] [2022-12-13 13:16:49,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585269153] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:16:49,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:16:49,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:16:49,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759313645] [2022-12-13 13:16:49,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:16:49,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:16:49,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:16:49,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:16:49,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:16:49,609 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-13 13:16:49,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 29 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:49,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:16:49,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-13 13:16:49,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:16:49,832 INFO L130 PetriNetUnfolder]: 1155/1690 cut-off events. [2022-12-13 13:16:49,832 INFO L131 PetriNetUnfolder]: For 273/273 co-relation queries the response was YES. [2022-12-13 13:16:49,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3871 conditions, 1690 events. 1155/1690 cut-off events. For 273/273 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 7700 event pairs, 608 based on Foata normal form. 62/1383 useless extension candidates. Maximal degree in co-relation 1013. Up to 880 conditions per place. [2022-12-13 13:16:49,842 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 60 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2022-12-13 13:16:49,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 66 transitions, 316 flow [2022-12-13 13:16:49,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:16:49,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:16:49,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-13 13:16:49,844 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5230769230769231 [2022-12-13 13:16:49,844 INFO L175 Difference]: Start difference. First operand has 29 places, 29 transitions, 84 flow. Second operand 5 states and 68 transitions. [2022-12-13 13:16:49,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 66 transitions, 316 flow [2022-12-13 13:16:49,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 66 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:16:49,846 INFO L231 Difference]: Finished difference. Result has 35 places, 32 transitions, 110 flow [2022-12-13 13:16:49,846 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=35, PETRI_TRANSITIONS=32} [2022-12-13 13:16:49,847 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2022-12-13 13:16:49,847 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:16:49,847 INFO L89 Accepts]: Start accepts. Operand has 35 places, 32 transitions, 110 flow [2022-12-13 13:16:49,848 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:16:49,848 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:16:49,849 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 32 transitions, 110 flow [2022-12-13 13:16:49,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 110 flow [2022-12-13 13:16:49,859 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([543] thread3EXIT-->L101-2: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem21#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} AuxVars[] AssignedVars[][30], [Black: 155#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~N~0 0)), Black: 147#(= ~res2~0 ~res1~0), 149#true, 87#L101-2true, Black: 157#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 151#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) |ULTIMATE.start_create_fresh_int_array_~size#1|)]) [2022-12-13 13:16:49,859 INFO L382 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-12-13 13:16:49,859 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 13:16:49,859 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 13:16:49,859 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 13:16:49,859 INFO L130 PetriNetUnfolder]: 30/113 cut-off events. [2022-12-13 13:16:49,859 INFO L131 PetriNetUnfolder]: For 8/11 co-relation queries the response was YES. [2022-12-13 13:16:49,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 113 events. 30/113 cut-off events. For 8/11 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 420 event pairs, 1 based on Foata normal form. 3/93 useless extension candidates. Maximal degree in co-relation 110. Up to 35 conditions per place. [2022-12-13 13:16:49,861 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 32 transitions, 110 flow [2022-12-13 13:16:49,861 INFO L226 LiptonReduction]: Number of co-enabled transitions 276 [2022-12-13 13:16:51,690 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:16:51,691 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1844 [2022-12-13 13:16:51,691 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 32 transitions, 116 flow [2022-12-13 13:16:51,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:51,692 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:16:51,692 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:16:51,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:16:51,692 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 13:16:51,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:51,693 INFO L85 PathProgramCache]: Analyzing trace with hash 997092377, now seen corresponding path program 1 times [2022-12-13 13:16:51,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:51,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2515797] [2022-12-13 13:16:51,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:51,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:51,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:16:51,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:16:51,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2515797] [2022-12-13 13:16:51,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2515797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:16:51,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:16:51,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:16:51,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454549388] [2022-12-13 13:16:51,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:16:51,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:16:51,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:16:51,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:16:51,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:16:51,884 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-13 13:16:51,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 116 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) 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-13 13:16:51,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:16:51,885 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-13 13:16:51,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:16:52,298 INFO L130 PetriNetUnfolder]: 1377/2035 cut-off events. [2022-12-13 13:16:52,298 INFO L131 PetriNetUnfolder]: For 706/782 co-relation queries the response was YES. [2022-12-13 13:16:52,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4776 conditions, 2035 events. 1377/2035 cut-off events. For 706/782 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 9626 event pairs, 437 based on Foata normal form. 76/1812 useless extension candidates. Maximal degree in co-relation 3286. Up to 521 conditions per place. [2022-12-13 13:16:52,311 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 105 selfloop transitions, 22 changer transitions 1/130 dead transitions. [2022-12-13 13:16:52,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 130 transitions, 659 flow [2022-12-13 13:16:52,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:16:52,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:16:52,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 124 transitions. [2022-12-13 13:16:52,316 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49206349206349204 [2022-12-13 13:16:52,316 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 116 flow. Second operand 9 states and 124 transitions. [2022-12-13 13:16:52,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 130 transitions, 659 flow [2022-12-13 13:16:52,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 130 transitions, 651 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-13 13:16:52,321 INFO L231 Difference]: Finished difference. Result has 48 places, 50 transitions, 263 flow [2022-12-13 13:16:52,322 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=263, PETRI_PLACES=48, PETRI_TRANSITIONS=50} [2022-12-13 13:16:52,323 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 16 predicate places. [2022-12-13 13:16:52,323 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:16:52,323 INFO L89 Accepts]: Start accepts. Operand has 48 places, 50 transitions, 263 flow [2022-12-13 13:16:52,325 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:16:52,326 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:16:52,326 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 50 transitions, 263 flow [2022-12-13 13:16:52,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 50 transitions, 263 flow [2022-12-13 13:16:52,351 INFO L130 PetriNetUnfolder]: 56/174 cut-off events. [2022-12-13 13:16:52,351 INFO L131 PetriNetUnfolder]: For 102/112 co-relation queries the response was YES. [2022-12-13 13:16:52,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 174 events. 56/174 cut-off events. For 102/112 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 767 event pairs, 0 based on Foata normal form. 3/166 useless extension candidates. Maximal degree in co-relation 329. Up to 52 conditions per place. [2022-12-13 13:16:52,356 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 50 transitions, 263 flow [2022-12-13 13:16:52,357 INFO L226 LiptonReduction]: Number of co-enabled transitions 556 [2022-12-13 13:16:52,367 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:16:52,368 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-13 13:16:52,369 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 50 transitions, 263 flow [2022-12-13 13:16:52,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) 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-13 13:16:52,369 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:16:52,370 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:16:52,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:16:52,370 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 13:16:52,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:52,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1568792965, now seen corresponding path program 2 times [2022-12-13 13:16:52,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:52,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920193904] [2022-12-13 13:16:52,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:52,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:52,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:16:52,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:16:52,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920193904] [2022-12-13 13:16:52,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920193904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:16:52,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:16:52,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:16:52,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793211804] [2022-12-13 13:16:52,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:16:52,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:16:52,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:16:52,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:16:52,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:16:52,500 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-13 13:16:52,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 50 transitions, 263 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) 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-13 13:16:52,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:16:52,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-13 13:16:52,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:16:52,918 INFO L130 PetriNetUnfolder]: 1778/2619 cut-off events. [2022-12-13 13:16:52,918 INFO L131 PetriNetUnfolder]: For 3204/3280 co-relation queries the response was YES. [2022-12-13 13:16:52,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8260 conditions, 2619 events. 1778/2619 cut-off events. For 3204/3280 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 12588 event pairs, 726 based on Foata normal form. 88/2703 useless extension candidates. Maximal degree in co-relation 6246. Up to 1072 conditions per place. [2022-12-13 13:16:52,935 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 104 selfloop transitions, 13 changer transitions 0/119 dead transitions. [2022-12-13 13:16:52,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 119 transitions, 807 flow [2022-12-13 13:16:52,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:16:52,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:16:52,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-12-13 13:16:52,938 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5432098765432098 [2022-12-13 13:16:52,938 INFO L175 Difference]: Start difference. First operand has 47 places, 50 transitions, 263 flow. Second operand 6 states and 88 transitions. [2022-12-13 13:16:52,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 119 transitions, 807 flow [2022-12-13 13:16:52,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 119 transitions, 803 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 13:16:52,957 INFO L231 Difference]: Finished difference. Result has 55 places, 58 transitions, 382 flow [2022-12-13 13:16:52,957 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=382, PETRI_PLACES=55, PETRI_TRANSITIONS=58} [2022-12-13 13:16:52,959 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 23 predicate places. [2022-12-13 13:16:52,959 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:16:52,959 INFO L89 Accepts]: Start accepts. Operand has 55 places, 58 transitions, 382 flow [2022-12-13 13:16:52,960 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:16:52,960 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:16:52,960 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 58 transitions, 382 flow [2022-12-13 13:16:52,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 58 transitions, 382 flow [2022-12-13 13:16:52,978 INFO L130 PetriNetUnfolder]: 53/177 cut-off events. [2022-12-13 13:16:52,978 INFO L131 PetriNetUnfolder]: For 182/193 co-relation queries the response was YES. [2022-12-13 13:16:52,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 177 events. 53/177 cut-off events. For 182/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 788 event pairs, 1 based on Foata normal form. 3/169 useless extension candidates. Maximal degree in co-relation 379. Up to 56 conditions per place. [2022-12-13 13:16:52,981 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 58 transitions, 382 flow [2022-12-13 13:16:52,981 INFO L226 LiptonReduction]: Number of co-enabled transitions 672 [2022-12-13 13:16:52,991 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [669] L73-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread3Thread1of1ForFork0_~i~2#1_In_1| v_~N~0_In_3)) (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_2| 0)) InVars {thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_In_1|, ~N~0=v_~N~0_In_3} OutVars{thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_2|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_2|, ~N~0=v_~N~0_In_3, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_In_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base] and [513] $Ultimate##0-->L60-4: Formula: (= |v_thread2Thread1of1ForFork2_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1#1] [2022-12-13 13:16:53,033 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:16:53,037 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-13 13:16:53,037 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 55 transitions, 356 flow [2022-12-13 13:16:53,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) 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-13 13:16:53,037 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:16:53,037 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:16:53,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 13:16:53,038 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 13:16:53,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:53,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1445137536, now seen corresponding path program 1 times [2022-12-13 13:16:53,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:53,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753312509] [2022-12-13 13:16:53,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:53,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:53,202 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-13 13:16:53,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:16:53,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753312509] [2022-12-13 13:16:53,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753312509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:16:53,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:16:53,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:16:53,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968839278] [2022-12-13 13:16:53,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:16:53,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:16:53,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:16:53,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:16:53,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:16:53,204 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-13 13:16:53,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 55 transitions, 356 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:53,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:16:53,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-13 13:16:53,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:16:53,478 INFO L130 PetriNetUnfolder]: 1405/2085 cut-off events. [2022-12-13 13:16:53,478 INFO L131 PetriNetUnfolder]: For 4437/4485 co-relation queries the response was YES. [2022-12-13 13:16:53,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7349 conditions, 2085 events. 1405/2085 cut-off events. For 4437/4485 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 9690 event pairs, 710 based on Foata normal form. 94/2175 useless extension candidates. Maximal degree in co-relation 6077. Up to 1683 conditions per place. [2022-12-13 13:16:53,495 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 75 selfloop transitions, 2 changer transitions 1/80 dead transitions. [2022-12-13 13:16:53,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 80 transitions, 592 flow [2022-12-13 13:16:53,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:16:53,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:16:53,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-13 13:16:53,497 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5446428571428571 [2022-12-13 13:16:53,497 INFO L175 Difference]: Start difference. First operand has 54 places, 55 transitions, 356 flow. Second operand 4 states and 61 transitions. [2022-12-13 13:16:53,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 80 transitions, 592 flow [2022-12-13 13:16:53,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 80 transitions, 587 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 13:16:53,511 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 336 flow [2022-12-13 13:16:53,512 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=336, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2022-12-13 13:16:53,514 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 24 predicate places. [2022-12-13 13:16:53,514 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:16:53,514 INFO L89 Accepts]: Start accepts. Operand has 56 places, 53 transitions, 336 flow [2022-12-13 13:16:53,516 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:16:53,516 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:16:53,517 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 53 transitions, 336 flow [2022-12-13 13:16:53,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 53 transitions, 336 flow [2022-12-13 13:16:53,530 INFO L130 PetriNetUnfolder]: 41/139 cut-off events. [2022-12-13 13:16:53,530 INFO L131 PetriNetUnfolder]: For 132/137 co-relation queries the response was YES. [2022-12-13 13:16:53,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 139 events. 41/139 cut-off events. For 132/137 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 550 event pairs, 1 based on Foata normal form. 1/133 useless extension candidates. Maximal degree in co-relation 333. Up to 42 conditions per place. [2022-12-13 13:16:53,533 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 53 transitions, 336 flow [2022-12-13 13:16:53,533 INFO L226 LiptonReduction]: Number of co-enabled transitions 574 [2022-12-13 13:16:53,736 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:16:53,737 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-13 13:16:53,737 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 332 flow [2022-12-13 13:16:53,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:53,737 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:16:53,737 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:16:53,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 13:16:53,737 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 13:16:53,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:53,738 INFO L85 PathProgramCache]: Analyzing trace with hash -565878226, now seen corresponding path program 1 times [2022-12-13 13:16:53,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:53,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135999295] [2022-12-13 13:16:53,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:53,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:53,843 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-13 13:16:53,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:16:53,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135999295] [2022-12-13 13:16:53,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135999295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:16:53,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:16:53,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:16:53,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535358292] [2022-12-13 13:16:53,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:16:53,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:16:53,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:16:53,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:16:53,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:16:53,845 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 13:16:53,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 332 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:53,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:16:53,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 13:16:53,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:16:54,072 INFO L130 PetriNetUnfolder]: 1113/1638 cut-off events. [2022-12-13 13:16:54,073 INFO L131 PetriNetUnfolder]: For 3497/3556 co-relation queries the response was YES. [2022-12-13 13:16:54,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5930 conditions, 1638 events. 1113/1638 cut-off events. For 3497/3556 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7265 event pairs, 503 based on Foata normal form. 73/1697 useless extension candidates. Maximal degree in co-relation 5566. Up to 1292 conditions per place. [2022-12-13 13:16:54,085 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 54 selfloop transitions, 1 changer transitions 25/83 dead transitions. [2022-12-13 13:16:54,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 83 transitions, 594 flow [2022-12-13 13:16:54,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:16:54,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:16:54,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-13 13:16:54,086 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4689655172413793 [2022-12-13 13:16:54,086 INFO L175 Difference]: Start difference. First operand has 54 places, 52 transitions, 332 flow. Second operand 5 states and 68 transitions. [2022-12-13 13:16:54,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 83 transitions, 594 flow [2022-12-13 13:16:54,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 83 transitions, 558 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-13 13:16:54,098 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 269 flow [2022-12-13 13:16:54,098 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2022-12-13 13:16:54,099 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 21 predicate places. [2022-12-13 13:16:54,099 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:16:54,099 INFO L89 Accepts]: Start accepts. Operand has 53 places, 46 transitions, 269 flow [2022-12-13 13:16:54,100 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:16:54,100 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:16:54,100 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 46 transitions, 269 flow [2022-12-13 13:16:54,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 46 transitions, 269 flow [2022-12-13 13:16:54,112 INFO L130 PetriNetUnfolder]: 46/128 cut-off events. [2022-12-13 13:16:54,112 INFO L131 PetriNetUnfolder]: For 87/89 co-relation queries the response was YES. [2022-12-13 13:16:54,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346 conditions, 128 events. 46/128 cut-off events. For 87/89 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 458 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 324. Up to 45 conditions per place. [2022-12-13 13:16:54,114 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 46 transitions, 269 flow [2022-12-13 13:16:54,114 INFO L226 LiptonReduction]: Number of co-enabled transitions 472 [2022-12-13 13:16:54,115 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:16:54,116 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 13:16:54,116 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 46 transitions, 269 flow [2022-12-13 13:16:54,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:54,116 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:16:54,116 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:16:54,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 13:16:54,116 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 13:16:54,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:54,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1561468071, now seen corresponding path program 1 times [2022-12-13 13:16:54,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:54,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864204105] [2022-12-13 13:16:54,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:54,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:54,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:16:54,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:16:54,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864204105] [2022-12-13 13:16:54,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864204105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:16:54,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:16:54,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:16:54,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100177759] [2022-12-13 13:16:54,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:16:54,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:16:54,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:16:54,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:16:54,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:16:54,182 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-13 13:16:54,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 46 transitions, 269 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:54,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:16:54,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-13 13:16:54,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:16:54,338 INFO L130 PetriNetUnfolder]: 955/1400 cut-off events. [2022-12-13 13:16:54,338 INFO L131 PetriNetUnfolder]: For 2673/2740 co-relation queries the response was YES. [2022-12-13 13:16:54,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4888 conditions, 1400 events. 955/1400 cut-off events. For 2673/2740 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5776 event pairs, 388 based on Foata normal form. 151/1537 useless extension candidates. Maximal degree in co-relation 4009. Up to 1093 conditions per place. [2022-12-13 13:16:54,349 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 65 selfloop transitions, 4 changer transitions 0/73 dead transitions. [2022-12-13 13:16:54,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 73 transitions, 581 flow [2022-12-13 13:16:54,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:16:54,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:16:54,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-13 13:16:54,350 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4326923076923077 [2022-12-13 13:16:54,350 INFO L175 Difference]: Start difference. First operand has 47 places, 46 transitions, 269 flow. Second operand 4 states and 45 transitions. [2022-12-13 13:16:54,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 73 transitions, 581 flow [2022-12-13 13:16:54,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 73 transitions, 543 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-12-13 13:16:54,358 INFO L231 Difference]: Finished difference. Result has 45 places, 47 transitions, 261 flow [2022-12-13 13:16:54,358 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=261, PETRI_PLACES=45, PETRI_TRANSITIONS=47} [2022-12-13 13:16:54,359 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2022-12-13 13:16:54,359 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:16:54,359 INFO L89 Accepts]: Start accepts. Operand has 45 places, 47 transitions, 261 flow [2022-12-13 13:16:54,360 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:16:54,360 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:16:54,360 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 47 transitions, 261 flow [2022-12-13 13:16:54,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 47 transitions, 261 flow [2022-12-13 13:16:54,376 INFO L130 PetriNetUnfolder]: 43/118 cut-off events. [2022-12-13 13:16:54,376 INFO L131 PetriNetUnfolder]: For 71/83 co-relation queries the response was YES. [2022-12-13 13:16:54,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332 conditions, 118 events. 43/118 cut-off events. For 71/83 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 387 event pairs, 0 based on Foata normal form. 4/119 useless extension candidates. Maximal degree in co-relation 288. Up to 43 conditions per place. [2022-12-13 13:16:54,378 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 47 transitions, 261 flow [2022-12-13 13:16:54,378 INFO L226 LiptonReduction]: Number of co-enabled transitions 466 [2022-12-13 13:16:54,380 ERROR L806 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-13 13:16:54,385 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:16:54,386 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-13 13:16:54,386 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 247 flow [2022-12-13 13:16:54,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:54,386 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:16:54,386 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:16:54,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 13:16:54,387 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 13:16:54,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:54,387 INFO L85 PathProgramCache]: Analyzing trace with hash 413844321, now seen corresponding path program 1 times [2022-12-13 13:16:54,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:54,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340167827] [2022-12-13 13:16:54,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:54,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:55,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:16:55,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:16:55,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340167827] [2022-12-13 13:16:55,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340167827] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:16:55,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243723107] [2022-12-13 13:16:55,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:55,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:16:55,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:16:55,151 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:16:55,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 13:16:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:55,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-13 13:16:55,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:16:55,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:16:55,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 13:16:55,674 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:16:55,676 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:16:55,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-12-13 13:16:55,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:16:55,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:16:55,870 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:16:55,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 42 [2022-12-13 13:16:55,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2022-12-13 13:16:56,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:16:56,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243723107] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:16:56,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:16:56,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2022-12-13 13:16:56,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050740871] [2022-12-13 13:16:56,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:16:56,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 13:16:56,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:16:56,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 13:16:56,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=436, Unknown=1, NotChecked=0, Total=506 [2022-12-13 13:16:56,093 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-13 13:16:56,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 247 flow. Second operand has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:56,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:16:56,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-13 13:16:56,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:16:56,598 INFO L130 PetriNetUnfolder]: 531/826 cut-off events. [2022-12-13 13:16:56,598 INFO L131 PetriNetUnfolder]: For 1243/1262 co-relation queries the response was YES. [2022-12-13 13:16:56,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2857 conditions, 826 events. 531/826 cut-off events. For 1243/1262 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3254 event pairs, 91 based on Foata normal form. 19/841 useless extension candidates. Maximal degree in co-relation 2183. Up to 363 conditions per place. [2022-12-13 13:16:56,601 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 0 selfloop transitions, 0 changer transitions 102/102 dead transitions. [2022-12-13 13:16:56,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 102 transitions, 741 flow [2022-12-13 13:16:56,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:16:56,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:16:56,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 7 states and 71 transitions. [2022-12-13 13:16:56,602 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3901098901098901 [2022-12-13 13:16:56,602 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 247 flow. Second operand 7 states and 71 transitions. [2022-12-13 13:16:56,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 102 transitions, 741 flow [2022-12-13 13:16:56,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 102 transitions, 729 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 13:16:56,606 INFO L231 Difference]: Finished difference. Result has 42 places, 0 transitions, 0 flow [2022-12-13 13:16:56,606 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=42, PETRI_TRANSITIONS=0} [2022-12-13 13:16:56,607 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2022-12-13 13:16:56,607 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:16:56,607 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 0 transitions, 0 flow [2022-12-13 13:16:56,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 13:16:56,607 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 13:16:56,608 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:16:56,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-13 13:16:56,608 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 13:16:56,608 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 13:16:56,608 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:16:56,609 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 13:16:56,609 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 13:16:56,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:56,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 13:16:56,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 13:16:56,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 13:16:56,612 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 13:16:56,619 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-13 13:16:56,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:16:56,818 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-12-13 13:16:56,820 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 13:16:56,820 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 13:16:56,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:16:56 BasicIcfg [2022-12-13 13:16:56,822 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 13:16:56,823 INFO L158 Benchmark]: Toolchain (without parser) took 15010.59ms. Allocated memory was 200.3MB in the beginning and 295.7MB in the end (delta: 95.4MB). Free memory was 176.7MB in the beginning and 237.5MB in the end (delta: -60.8MB). Peak memory consumption was 35.0MB. Max. memory is 8.0GB. [2022-12-13 13:16:56,823 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 127.9MB. Free memory was 105.8MB in the beginning and 105.7MB in the end (delta: 87.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 13:16:56,823 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.21ms. Allocated memory is still 200.3MB. Free memory was 176.1MB in the beginning and 163.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 13:16:56,823 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.67ms. Allocated memory is still 200.3MB. Free memory was 163.0MB in the beginning and 160.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 13:16:56,824 INFO L158 Benchmark]: Boogie Preprocessor took 52.34ms. Allocated memory is still 200.3MB. Free memory was 160.9MB in the beginning and 159.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 13:16:56,824 INFO L158 Benchmark]: RCFGBuilder took 784.12ms. Allocated memory is still 200.3MB. Free memory was 159.4MB in the beginning and 126.8MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-13 13:16:56,824 INFO L158 Benchmark]: TraceAbstraction took 13882.93ms. Allocated memory was 200.3MB in the beginning and 295.7MB in the end (delta: 95.4MB). Free memory was 125.8MB in the beginning and 237.5MB in the end (delta: -111.7MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 13:16:56,825 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.14ms. Allocated memory is still 127.9MB. Free memory was 105.8MB in the beginning and 105.7MB in the end (delta: 87.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 220.21ms. Allocated memory is still 200.3MB. Free memory was 176.1MB in the beginning and 163.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.67ms. Allocated memory is still 200.3MB. Free memory was 163.0MB in the beginning and 160.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.34ms. Allocated memory is still 200.3MB. Free memory was 160.9MB in the beginning and 159.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 784.12ms. Allocated memory is still 200.3MB. Free memory was 159.4MB in the beginning and 126.8MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 13882.93ms. Allocated memory was 200.3MB in the beginning and 295.7MB in the end (delta: 95.4MB). Free memory was 125.8MB in the beginning and 237.5MB in the end (delta: -111.7MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 129 PlacesBefore, 32 PlacesAfterwards, 131 TransitionsBefore, 26 TransitionsAfterwards, 1518 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 66 TrivialYvCompositions, 31 ConcurrentYvCompositions, 8 ChoiceCompositions, 105 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 833, independent: 815, independent conditional: 815, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 833, independent: 815, independent conditional: 0, independent unconditional: 815, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 833, independent: 815, independent conditional: 0, independent unconditional: 815, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 833, independent: 815, independent conditional: 0, independent unconditional: 815, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 785, independent: 775, independent conditional: 0, independent unconditional: 775, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 785, independent: 775, independent conditional: 0, independent unconditional: 775, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 833, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 785, unknown conditional: 0, unknown unconditional: 785] , Statistics on independence cache: Total cache size (in pairs): 1250, Positive cache size: 1240, Positive conditional cache size: 0, Positive unconditional cache size: 1240, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 29 PlacesBefore, 29 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 246 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 4, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 14, unknown conditional: 3, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 12, Positive conditional cache size: 2, Positive unconditional cache size: 10, Negative cache size: 2, Negative conditional cache size: 1, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 35 PlacesBefore, 35 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 276 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30, independent: 26, independent conditional: 8, independent unconditional: 18, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30, independent: 26, independent conditional: 6, independent unconditional: 20, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30, independent: 26, independent conditional: 6, independent unconditional: 20, dependent: 4, dependent conditional: 2, dependent unconditional: 2, 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: 30, independent: 26, independent conditional: 6, independent unconditional: 20, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 12, Positive conditional cache size: 2, Positive unconditional cache size: 10, Negative cache size: 2, Negative conditional cache size: 1, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 556 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15, independent: 9, independent conditional: 1, independent unconditional: 8, dependent: 6, dependent conditional: 5, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 9, independent conditional: 1, independent unconditional: 8, dependent: 11, dependent conditional: 10, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 9, independent conditional: 1, independent unconditional: 8, dependent: 11, dependent conditional: 10, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 13, Positive conditional cache size: 2, Positive unconditional cache size: 11, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 55 PlacesBefore, 54 PlacesAfterwards, 58 TransitionsBefore, 55 TransitionsAfterwards, 672 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 111, independent: 97, independent conditional: 97, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 111, independent: 97, independent conditional: 55, independent unconditional: 42, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 111, independent: 97, independent conditional: 35, independent unconditional: 62, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, independent: 97, independent conditional: 35, independent unconditional: 62, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 23, independent conditional: 15, independent unconditional: 8, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 111, independent: 74, independent conditional: 20, independent unconditional: 54, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 24, unknown conditional: 16, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 36, Positive conditional cache size: 17, Positive unconditional cache size: 19, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 55 PlacesBefore, 54 PlacesAfterwards, 53 TransitionsBefore, 52 TransitionsAfterwards, 574 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 34, independent: 26, independent conditional: 4, independent unconditional: 22, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, independent: 26, independent conditional: 2, independent unconditional: 24, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 26, independent conditional: 2, independent unconditional: 24, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, independent: 24, independent conditional: 2, independent unconditional: 22, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 38, Positive conditional cache size: 17, Positive unconditional cache size: 21, Negative cache size: 7, Negative conditional cache size: 5, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 472 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 38, Positive conditional cache size: 17, Positive unconditional cache size: 21, Negative cache size: 7, Negative conditional cache size: 5, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 47 TransitionsBefore, 45 TransitionsAfterwards, 466 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, independent: 68, independent conditional: 68, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 76, independent: 68, independent conditional: 60, independent unconditional: 8, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 84, independent: 68, independent conditional: 10, independent unconditional: 58, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 84, independent: 68, independent conditional: 10, independent unconditional: 58, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 11, independent conditional: 1, independent unconditional: 10, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 84, independent: 57, independent conditional: 9, independent unconditional: 48, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 12, unknown conditional: 2, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 49, Positive conditional cache size: 18, Positive unconditional cache size: 31, Negative cache size: 8, Negative conditional cache size: 6, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 50, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 49, Positive conditional cache size: 18, Positive unconditional cache size: 31, Negative cache size: 8, Negative conditional cache size: 6, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 104]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 166 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 370 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 370 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1321 IncrementalHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 18 mSDtfsCounter, 1321 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=382occurred in iteration=4, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 205 ConstructedInterpolants, 5 QuantifiedInterpolants, 1446 SizeOfPredicates, 32 NumberOfNonLiveVariables, 253 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 6/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 13:16:56,845 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...